./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0513.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0513.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:02,649 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:02,652 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:02,693 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:02,694 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:02,697 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:02,698 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:02,701 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:02,703 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:02,707 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:02,708 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:02,709 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:02,709 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:02,712 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:02,713 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:02,716 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:02,717 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:02,718 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:02,720 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:02,721 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:02,722 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:02,724 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:02,725 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:02,726 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:02,727 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:02,728 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:02,728 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:02,728 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:02,729 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:02,729 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:02,730 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:02,730 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:02,731 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:02,731 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:02,732 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:02,732 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:02,732 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:02,733 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:02,733 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:02,733 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:02,734 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:02,735 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:46:02,760 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:02,761 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:02,761 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:02,762 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:02,762 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:02,763 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:02,763 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:02,763 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:02,763 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:02,764 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:02,764 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:02,765 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:02,766 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:02,766 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:02,766 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:02,766 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:02,766 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:02,766 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:02,767 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:02,767 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:02,767 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:02,767 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:02,768 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:02,769 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:02,769 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:02,769 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2022-02-20 23:46:03,007 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:03,038 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:03,041 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:03,042 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:03,043 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:03,044 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2022-02-20 23:46:03,108 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c86143a/bd9d2a0e69034014bd865f1928eba9ac/FLAGcede63e4c [2022-02-20 23:46:03,558 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:03,558 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2022-02-20 23:46:03,573 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c86143a/bd9d2a0e69034014bd865f1928eba9ac/FLAGcede63e4c [2022-02-20 23:46:03,596 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/86c86143a/bd9d2a0e69034014bd865f1928eba9ac [2022-02-20 23:46:03,598 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:03,599 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:03,600 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:03,600 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:03,603 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:03,603 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,604 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4a17f2c8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03, skipping insertion in model container [2022-02-20 23:46:03,605 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:03,610 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:03,655 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:03,913 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:03,920 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:03,959 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:03,998 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:03,999 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03 WrapperNode [2022-02-20 23:46:03,999 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:04,000 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:04,000 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:04,000 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:04,008 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:46:03" (1/1) ... [2022-02-20 23:46:04,037 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:46:03" (1/1) ... [2022-02-20 23:46:04,076 INFO L137 Inliner]: procedures = 123, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 124 [2022-02-20 23:46:04,077 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:04,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:04,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:04,078 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:04,085 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,085 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,103 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,103 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,113 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,116 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,118 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,123 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:04,124 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:04,124 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:04,124 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:04,125 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (1/1) ... [2022-02-20 23:46:04,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:04,151 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:04,162 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:46:04,175 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:46:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:46:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:46:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:04,209 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:46:04,210 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:04,210 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:04,324 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:04,325 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:04,764 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:04,771 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:04,773 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:46:04,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:04 BoogieIcfgContainer [2022-02-20 23:46:04,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:04,778 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:04,778 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:04,781 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:04,782 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:03" (1/3) ... [2022-02-20 23:46:04,782 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614d04d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:04, skipping insertion in model container [2022-02-20 23:46:04,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:03" (2/3) ... [2022-02-20 23:46:04,783 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@614d04d8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:04, skipping insertion in model container [2022-02-20 23:46:04,783 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:04" (3/3) ... [2022-02-20 23:46:04,784 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513.i [2022-02-20 23:46:04,789 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:04,789 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-02-20 23:46:04,824 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:04,828 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:46:04,829 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-02-20 23:46:04,846 INFO L276 IsEmpty]: Start isEmpty. Operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:04,851 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:04,851 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:04,852 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:04,852 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:04,856 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:04,857 INFO L85 PathProgramCache]: Analyzing trace with hash 28740643, now seen corresponding path program 1 times [2022-02-20 23:46:04,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:04,865 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [599511402] [2022-02-20 23:46:04,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:04,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:04,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:05,005 INFO L290 TraceCheckUtils]: 0: Hoare triple {135#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(12, 2); {135#true} is VALID [2022-02-20 23:46:05,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {135#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {135#true} is VALID [2022-02-20 23:46:05,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {135#true} assume !true; {136#false} is VALID [2022-02-20 23:46:05,007 INFO L290 TraceCheckUtils]: 3: Hoare triple {136#false} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {136#false} is VALID [2022-02-20 23:46:05,007 INFO L290 TraceCheckUtils]: 4: Hoare triple {136#false} assume !(#valid == main_old_#valid#1); {136#false} is VALID [2022-02-20 23:46:05,009 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:46:05,009 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:05,009 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [599511402] [2022-02-20 23:46:05,010 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [599511402] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:05,010 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:05,011 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:05,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [803987181] [2022-02-20 23:46:05,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:05,017 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:05,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:05,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,031 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:46:05,031 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:46:05,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:05,061 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.101449275362319) internal successors, (145), 131 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,188 INFO L93 Difference]: Finished difference Result 132 states and 140 transitions. [2022-02-20 23:46:05,189 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:46:05,189 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:05,189 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:05,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 145 transitions. [2022-02-20 23:46:05,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 145 transitions. [2022-02-20 23:46:05,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 145 transitions. [2022-02-20 23:46:05,332 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,350 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:46:05,350 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:46:05,352 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:05,355 INFO L933 BasicCegarLoop]: 140 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 140 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:05,356 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:05,371 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:46:05,383 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-02-20 23:46:05,383 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:05,385 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,386 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,387 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,393 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-02-20 23:46:05,393 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-02-20 23:46:05,394 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,394 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:46:05,395 INFO L87 Difference]: Start difference. First operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:46:05,401 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,401 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-02-20 23:46:05,401 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-02-20 23:46:05,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,402 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:05,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:05,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0294117647058822) internal successors, (138), 129 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 138 transitions. [2022-02-20 23:46:05,411 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 138 transitions. Word has length 5 [2022-02-20 23:46:05,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:05,411 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 138 transitions. [2022-02-20 23:46:05,412 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,412 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 138 transitions. [2022-02-20 23:46:05,412 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:05,412 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:05,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:05,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:46:05,413 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:05,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:05,414 INFO L85 PathProgramCache]: Analyzing trace with hash 889570808, now seen corresponding path program 1 times [2022-02-20 23:46:05,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:05,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [870784696] [2022-02-20 23:46:05,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:05,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:05,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:05,461 INFO L290 TraceCheckUtils]: 0: Hoare triple {661#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(12, 2); {661#true} is VALID [2022-02-20 23:46:05,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {661#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:05,464 INFO L290 TraceCheckUtils]: 2: Hoare triple {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:05,465 INFO L290 TraceCheckUtils]: 3: Hoare triple {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:05,465 INFO L290 TraceCheckUtils]: 4: Hoare triple {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:46:05,466 INFO L290 TraceCheckUtils]: 5: Hoare triple {663#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {662#false} is VALID [2022-02-20 23:46:05,466 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:46:05,467 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:05,467 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [870784696] [2022-02-20 23:46:05,467 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [870784696] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:05,468 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:05,468 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:05,468 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349549045] [2022-02-20 23:46:05,469 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:05,470 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:05,471 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:05,471 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,476 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:05,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:05,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:05,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:05,479 INFO L87 Difference]: Start difference. First operand 130 states and 138 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,740 INFO L93 Difference]: Finished difference Result 176 states and 186 transitions. [2022-02-20 23:46:05,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:05,741 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:05,741 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:05,741 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-20 23:46:05,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 187 transitions. [2022-02-20 23:46:05,746 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 187 transitions. [2022-02-20 23:46:05,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 187 edges. 187 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:05,913 INFO L225 Difference]: With dead ends: 176 [2022-02-20 23:46:05,913 INFO L226 Difference]: Without dead ends: 175 [2022-02-20 23:46:05,914 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:46:05,915 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 42 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:05,915 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 192 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:05,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 175 states. [2022-02-20 23:46:05,929 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 175 to 133. [2022-02-20 23:46:05,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:05,932 INFO L82 GeneralOperation]: Start isEquivalent. First operand 175 states. Second operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,933 INFO L74 IsIncluded]: Start isIncluded. First operand 175 states. Second operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,933 INFO L87 Difference]: Start difference. First operand 175 states. Second operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,941 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2022-02-20 23:46:05,941 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2022-02-20 23:46:05,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,948 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 23:46:05,948 INFO L87 Difference]: Start difference. First operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 175 states. [2022-02-20 23:46:05,956 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:05,956 INFO L93 Difference]: Finished difference Result 175 states and 185 transitions. [2022-02-20 23:46:05,956 INFO L276 IsEmpty]: Start isEmpty. Operand 175 states and 185 transitions. [2022-02-20 23:46:05,958 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:05,959 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:05,959 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:05,959 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:05,959 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 71 states have (on average 2.0) internal successors, (142), 132 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 142 transitions. [2022-02-20 23:46:05,962 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 142 transitions. Word has length 6 [2022-02-20 23:46:05,962 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:05,962 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 142 transitions. [2022-02-20 23:46:05,962 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:05,962 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 142 transitions. [2022-02-20 23:46:05,962 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:05,962 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:05,962 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:05,963 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:46:05,963 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:05,963 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:05,963 INFO L85 PathProgramCache]: Analyzing trace with hash 889570732, now seen corresponding path program 1 times [2022-02-20 23:46:05,963 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:05,964 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984043372] [2022-02-20 23:46:05,964 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:05,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:05,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:05,997 INFO L290 TraceCheckUtils]: 0: Hoare triple {1325#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(12, 2); {1325#true} is VALID [2022-02-20 23:46:05,998 INFO L290 TraceCheckUtils]: 1: Hoare triple {1325#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:05,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:05,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:06,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {1327#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {1326#false} is VALID [2022-02-20 23:46:06,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {1326#false} assume !(1 == #valid[main_~data~0#1.base]); {1326#false} is VALID [2022-02-20 23:46:06,000 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:46:06,000 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:06,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984043372] [2022-02-20 23:46:06,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984043372] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:06,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:06,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:06,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576370095] [2022-02-20 23:46:06,002 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:06,003 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,003 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:06,004 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,008 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,009 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:06,009 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:06,010 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:06,011 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:06,011 INFO L87 Difference]: Start difference. First operand 133 states and 142 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,195 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,195 INFO L93 Difference]: Finished difference Result 145 states and 152 transitions. [2022-02-20 23:46:06,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:06,195 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:06,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:46:06,197 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:46:06,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-20 23:46:06,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,324 INFO L225 Difference]: With dead ends: 145 [2022-02-20 23:46:06,324 INFO L226 Difference]: Without dead ends: 144 [2022-02-20 23:46:06,325 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:46:06,325 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 15 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 229 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:06,326 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [15 Valid, 229 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:06,327 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2022-02-20 23:46:06,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 138. [2022-02-20 23:46:06,331 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:06,331 INFO L82 GeneralOperation]: Start isEquivalent. First operand 144 states. Second operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,332 INFO L74 IsIncluded]: Start isIncluded. First operand 144 states. Second operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,332 INFO L87 Difference]: Start difference. First operand 144 states. Second operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,337 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,338 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-02-20 23:46:06,338 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2022-02-20 23:46:06,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,339 INFO L74 IsIncluded]: Start isIncluded. First operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 144 states. [2022-02-20 23:46:06,340 INFO L87 Difference]: Start difference. First operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 144 states. [2022-02-20 23:46:06,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,345 INFO L93 Difference]: Finished difference Result 144 states and 151 transitions. [2022-02-20 23:46:06,346 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 151 transitions. [2022-02-20 23:46:06,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:06,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:06,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 138 states, 76 states have (on average 1.9736842105263157) internal successors, (150), 137 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 138 states to 138 states and 150 transitions. [2022-02-20 23:46:06,352 INFO L78 Accepts]: Start accepts. Automaton has 138 states and 150 transitions. Word has length 6 [2022-02-20 23:46:06,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:06,353 INFO L470 AbstractCegarLoop]: Abstraction has 138 states and 150 transitions. [2022-02-20 23:46:06,353 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,353 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 150 transitions. [2022-02-20 23:46:06,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:06,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:06,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:06,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:46:06,354 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:06,355 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:06,355 INFO L85 PathProgramCache]: Analyzing trace with hash 889571339, now seen corresponding path program 1 times [2022-02-20 23:46:06,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:06,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1637861645] [2022-02-20 23:46:06,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:06,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:06,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:06,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {1901#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(12, 2); {1901#true} is VALID [2022-02-20 23:46:06,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {1901#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {1901#true} is VALID [2022-02-20 23:46:06,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {1901#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {1901#true} is VALID [2022-02-20 23:46:06,403 INFO L290 TraceCheckUtils]: 3: Hoare triple {1901#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1903#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:06,404 INFO L290 TraceCheckUtils]: 4: Hoare triple {1903#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {1903#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:06,405 INFO L290 TraceCheckUtils]: 5: Hoare triple {1903#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {1902#false} is VALID [2022-02-20 23:46:06,405 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:46:06,405 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:06,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1637861645] [2022-02-20 23:46:06,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1637861645] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:06,406 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:06,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:06,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2070913386] [2022-02-20 23:46:06,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:06,407 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,407 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:06,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,413 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:06,413 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:06,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:06,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:06,414 INFO L87 Difference]: Start difference. First operand 138 states and 150 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,641 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,642 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2022-02-20 23:46:06,642 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:06,642 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,642 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:06,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-02-20 23:46:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 177 transitions. [2022-02-20 23:46:06,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 177 transitions. [2022-02-20 23:46:06,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,793 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:46:06,793 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:46:06,794 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:46:06,795 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 75 mSDsluCounter, 40 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 167 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:06,795 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [75 Valid, 167 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:06,796 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:46:06,800 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 139. [2022-02-20 23:46:06,800 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:06,801 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,801 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,802 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,806 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2022-02-20 23:46:06,806 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2022-02-20 23:46:06,810 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,811 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:46:06,812 INFO L87 Difference]: Start difference. First operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 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 169 states. [2022-02-20 23:46:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:06,816 INFO L93 Difference]: Finished difference Result 169 states and 183 transitions. [2022-02-20 23:46:06,816 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 183 transitions. [2022-02-20 23:46:06,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:06,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:06,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:06,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 80 states have (on average 1.9125) internal successors, (153), 138 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 153 transitions. [2022-02-20 23:46:06,820 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 153 transitions. Word has length 6 [2022-02-20 23:46:06,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:06,821 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 153 transitions. [2022-02-20 23:46:06,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,821 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 153 transitions. [2022-02-20 23:46:06,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:46:06,822 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:06,822 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:46:06,822 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:46:06,822 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:06,823 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:06,823 INFO L85 PathProgramCache]: Analyzing trace with hash 889571340, now seen corresponding path program 1 times [2022-02-20 23:46:06,823 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:06,823 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [275947117] [2022-02-20 23:46:06,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:06,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:06,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:06,872 INFO L290 TraceCheckUtils]: 0: Hoare triple {2552#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(12, 2); {2552#true} is VALID [2022-02-20 23:46:06,872 INFO L290 TraceCheckUtils]: 1: Hoare triple {2552#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {2552#true} is VALID [2022-02-20 23:46:06,872 INFO L290 TraceCheckUtils]: 2: Hoare triple {2552#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {2552#true} is VALID [2022-02-20 23:46:06,873 INFO L290 TraceCheckUtils]: 3: Hoare triple {2552#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2554#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:06,874 INFO L290 TraceCheckUtils]: 4: Hoare triple {2554#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {2554#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:06,875 INFO L290 TraceCheckUtils]: 5: Hoare triple {2554#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(4 + main_~item~0#1.offset <= #length[main_~item~0#1.base] && 0 <= main_~item~0#1.offset); {2553#false} is VALID [2022-02-20 23:46:06,875 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:46:06,875 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:06,875 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [275947117] [2022-02-20 23:46:06,876 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [275947117] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:06,876 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:06,876 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:06,876 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [291779110] [2022-02-20 23:46:06,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:06,877 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:06,877 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:06,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:06,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:06,883 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:06,883 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:06,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:06,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:06,884 INFO L87 Difference]: Start difference. First operand 139 states and 153 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,068 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,068 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-02-20 23:46:07,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:07,069 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:46:07,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 23:46:07,071 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,072 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-20 23:46:07,072 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2022-02-20 23:46:07,174 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,176 INFO L225 Difference]: With dead ends: 137 [2022-02-20 23:46:07,176 INFO L226 Difference]: Without dead ends: 137 [2022-02-20 23:46:07,176 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:46:07,177 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 22 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 173 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:07,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 173 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:07,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 137 states. [2022-02-20 23:46:07,183 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 137 to 137. [2022-02-20 23:46:07,183 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:07,184 INFO L82 GeneralOperation]: Start isEquivalent. First operand 137 states. Second operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,184 INFO L74 IsIncluded]: Start isIncluded. First operand 137 states. Second operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,184 INFO L87 Difference]: Start difference. First operand 137 states. Second operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,188 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-02-20 23:46:07,188 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-02-20 23:46:07,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-20 23:46:07,189 INFO L87 Difference]: Start difference. First operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 137 states. [2022-02-20 23:46:07,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,193 INFO L93 Difference]: Finished difference Result 137 states and 149 transitions. [2022-02-20 23:46:07,193 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-02-20 23:46:07,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:07,194 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:07,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 80 states have (on average 1.8625) internal successors, (149), 136 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 149 transitions. [2022-02-20 23:46:07,197 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 149 transitions. Word has length 6 [2022-02-20 23:46:07,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:07,197 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 149 transitions. [2022-02-20 23:46:07,198 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,198 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 149 transitions. [2022-02-20 23:46:07,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:46:07,198 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:07,198 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:07,199 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:46:07,199 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:07,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:07,199 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659887, now seen corresponding path program 1 times [2022-02-20 23:46:07,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:07,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [336649131] [2022-02-20 23:46:07,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:07,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:07,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:07,241 INFO L290 TraceCheckUtils]: 0: Hoare triple {3105#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(12, 2); {3105#true} is VALID [2022-02-20 23:46:07,242 INFO L290 TraceCheckUtils]: 1: Hoare triple {3105#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {3105#true} is VALID [2022-02-20 23:46:07,242 INFO L290 TraceCheckUtils]: 2: Hoare triple {3105#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {3105#true} is VALID [2022-02-20 23:46:07,242 INFO L290 TraceCheckUtils]: 3: Hoare triple {3105#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3105#true} is VALID [2022-02-20 23:46:07,242 INFO L290 TraceCheckUtils]: 4: Hoare triple {3105#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {3105#true} is VALID [2022-02-20 23:46:07,243 INFO L290 TraceCheckUtils]: 5: Hoare triple {3105#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {3105#true} is VALID [2022-02-20 23:46:07,243 INFO L290 TraceCheckUtils]: 6: Hoare triple {3105#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3105#true} is VALID [2022-02-20 23:46:07,243 INFO L290 TraceCheckUtils]: 7: Hoare triple {3105#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {3105#true} is VALID [2022-02-20 23:46:07,244 INFO L290 TraceCheckUtils]: 8: Hoare triple {3105#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3107#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:46:07,244 INFO L290 TraceCheckUtils]: 9: Hoare triple {3107#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {3107#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:46:07,245 INFO L290 TraceCheckUtils]: 10: Hoare triple {3107#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} assume !(1 == #valid[main_~lItem~0#1.base]); {3106#false} is VALID [2022-02-20 23:46:07,245 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:46:07,245 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:07,246 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [336649131] [2022-02-20 23:46:07,246 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [336649131] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:07,246 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:07,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:07,246 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [858481127] [2022-02-20 23:46:07,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:07,247 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,247 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:07,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) 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:46:07,256 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:46:07,256 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:07,256 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:07,257 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:07,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:07,257 INFO L87 Difference]: Start difference. First operand 137 states and 149 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:46:07,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,422 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:07,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:07,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:46:07,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:46:07,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:46:07,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:46:07,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 133 transitions. [2022-02-20 23:46:07,530 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,532 INFO L225 Difference]: With dead ends: 133 [2022-02-20 23:46:07,532 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 23:46:07,533 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:46:07,534 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 23 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:07,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 168 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:07,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 23:46:07,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 23:46:07,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:07,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,538 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,538 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,541 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:07,541 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:07,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 133 states. [2022-02-20 23:46:07,543 INFO L87 Difference]: Start difference. First operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 133 states. [2022-02-20 23:46:07,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,546 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:07,546 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:07,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:07,547 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:07,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 80 states have (on average 1.8125) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-02-20 23:46:07,550 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 11 [2022-02-20 23:46:07,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:07,550 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-02-20 23:46:07,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,551 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:07,551 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:46:07,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:07,551 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:07,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:46:07,552 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:07,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:07,552 INFO L85 PathProgramCache]: Analyzing trace with hash -2119659886, now seen corresponding path program 1 times [2022-02-20 23:46:07,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:07,553 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [465324192] [2022-02-20 23:46:07,553 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:07,553 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:07,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:07,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {3642#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(12, 2); {3642#true} is VALID [2022-02-20 23:46:07,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {3642#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {3642#true} is VALID [2022-02-20 23:46:07,637 INFO L290 TraceCheckUtils]: 2: Hoare triple {3642#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {3642#true} is VALID [2022-02-20 23:46:07,637 INFO L290 TraceCheckUtils]: 3: Hoare triple {3642#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3642#true} is VALID [2022-02-20 23:46:07,637 INFO L290 TraceCheckUtils]: 4: Hoare triple {3642#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {3642#true} is VALID [2022-02-20 23:46:07,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {3642#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {3642#true} is VALID [2022-02-20 23:46:07,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {3642#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {3642#true} is VALID [2022-02-20 23:46:07,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {3642#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {3642#true} is VALID [2022-02-20 23:46:07,639 INFO L290 TraceCheckUtils]: 8: Hoare triple {3642#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3644#(and (= (+ (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:07,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {3644#(and (= (+ (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {3644#(and (= (+ (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:07,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3644#(and (= (+ (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(4 + main_~lItem~0#1.offset <= #length[main_~lItem~0#1.base] && 0 <= main_~lItem~0#1.offset); {3643#false} is VALID [2022-02-20 23:46:07,645 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:46:07,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:07,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [465324192] [2022-02-20 23:46:07,646 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [465324192] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:07,646 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:07,646 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:07,646 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [370792856] [2022-02-20 23:46:07,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:07,647 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:07,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) 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:46:07,656 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:46:07,656 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:07,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:07,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:07,657 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:07,657 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 5.5) 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:46:07,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,818 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:46:07,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:07,818 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:07,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:46:07,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:46:07,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) 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:46:07,822 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-20 23:46:07,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-20 23:46:07,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,927 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:46:07,927 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:46:07,928 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:46:07,931 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 12 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 179 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:07,932 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 179 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:07,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:46:07,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 130. [2022-02-20 23:46:07,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:07,935 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,935 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,935 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,938 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:46:07,938 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:46:07,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,939 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:46:07,939 INFO L87 Difference]: Start difference. First operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:46:07,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:07,942 INFO L93 Difference]: Finished difference Result 130 states and 142 transitions. [2022-02-20 23:46:07,942 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:46:07,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:07,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:07,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:07,943 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:07,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.775) internal successors, (142), 129 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,945 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 142 transitions. [2022-02-20 23:46:07,945 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 142 transitions. Word has length 11 [2022-02-20 23:46:07,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:07,946 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 142 transitions. [2022-02-20 23:46:07,946 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) 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:46:07,946 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 142 transitions. [2022-02-20 23:46:07,946 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:07,946 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:07,947 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:07,947 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:46:07,947 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:07,947 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash -967503371, now seen corresponding path program 1 times [2022-02-20 23:46:07,948 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:07,948 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1119301348] [2022-02-20 23:46:07,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:07,948 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:07,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:08,026 INFO L290 TraceCheckUtils]: 0: Hoare triple {4167#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(12, 2); {4167#true} is VALID [2022-02-20 23:46:08,027 INFO L290 TraceCheckUtils]: 1: Hoare triple {4167#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {4167#true} is VALID [2022-02-20 23:46:08,027 INFO L290 TraceCheckUtils]: 2: Hoare triple {4167#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4167#true} is VALID [2022-02-20 23:46:08,027 INFO L290 TraceCheckUtils]: 3: Hoare triple {4167#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4167#true} is VALID [2022-02-20 23:46:08,027 INFO L290 TraceCheckUtils]: 4: Hoare triple {4167#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4167#true} is VALID [2022-02-20 23:46:08,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {4167#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {4167#true} is VALID [2022-02-20 23:46:08,028 INFO L290 TraceCheckUtils]: 6: Hoare triple {4167#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4167#true} is VALID [2022-02-20 23:46:08,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {4167#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {4167#true} is VALID [2022-02-20 23:46:08,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {4167#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:46:08,029 INFO L290 TraceCheckUtils]: 9: Hoare triple {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:46:08,029 INFO L290 TraceCheckUtils]: 10: Hoare triple {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:46:08,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {4169#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,032 INFO L290 TraceCheckUtils]: 15: Hoare triple {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:46:08,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {4170#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {4168#false} is VALID [2022-02-20 23:46:08,032 INFO L290 TraceCheckUtils]: 17: Hoare triple {4168#false} assume !(#valid == main_old_#valid#1); {4168#false} is VALID [2022-02-20 23:46:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:08,033 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:08,033 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1119301348] [2022-02-20 23:46:08,033 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1119301348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:08,033 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:08,033 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:08,034 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1251768129] [2022-02-20 23:46:08,034 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:08,034 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:08,034 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:08,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,047 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,047 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:08,047 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:08,048 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:08,048 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:08,048 INFO L87 Difference]: Start difference. First operand 130 states and 142 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,349 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-02-20 23:46:08,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:08,350 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:08,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:08,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2022-02-20 23:46:08,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 234 transitions. [2022-02-20 23:46:08,356 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 234 transitions. [2022-02-20 23:46:08,526 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 234 edges. 234 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,529 INFO L225 Difference]: With dead ends: 228 [2022-02-20 23:46:08,530 INFO L226 Difference]: Without dead ends: 228 [2022-02-20 23:46:08,530 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:46:08,530 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 126 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:08,531 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [126 Valid, 251 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:08,531 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-20 23:46:08,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 130. [2022-02-20 23:46:08,534 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:08,534 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,534 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,535 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,541 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-02-20 23:46:08,541 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2022-02-20 23:46:08,541 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,541 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 228 states. [2022-02-20 23:46:08,542 INFO L87 Difference]: Start difference. First operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 228 states. [2022-02-20 23:46:08,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,548 INFO L93 Difference]: Finished difference Result 228 states and 248 transitions. [2022-02-20 23:46:08,548 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 248 transitions. [2022-02-20 23:46:08,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:08,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:08,549 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:08,549 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:08,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 80 states have (on average 1.75) internal successors, (140), 129 states have internal predecessors, (140), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2022-02-20 23:46:08,552 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 18 [2022-02-20 23:46:08,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:08,552 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2022-02-20 23:46:08,553 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,553 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2022-02-20 23:46:08,553 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:08,553 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:08,553 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:08,554 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:46:08,554 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:08,554 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:08,554 INFO L85 PathProgramCache]: Analyzing trace with hash -967503447, now seen corresponding path program 1 times [2022-02-20 23:46:08,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:08,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339689476] [2022-02-20 23:46:08,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:08,555 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:08,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:08,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {4989#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(12, 2); {4989#true} is VALID [2022-02-20 23:46:08,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {4989#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {4989#true} is VALID [2022-02-20 23:46:08,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {4989#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4989#true} is VALID [2022-02-20 23:46:08,640 INFO L290 TraceCheckUtils]: 3: Hoare triple {4989#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4989#true} is VALID [2022-02-20 23:46:08,640 INFO L290 TraceCheckUtils]: 4: Hoare triple {4989#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4989#true} is VALID [2022-02-20 23:46:08,641 INFO L290 TraceCheckUtils]: 5: Hoare triple {4989#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {4989#true} is VALID [2022-02-20 23:46:08,641 INFO L290 TraceCheckUtils]: 6: Hoare triple {4989#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {4989#true} is VALID [2022-02-20 23:46:08,641 INFO L290 TraceCheckUtils]: 7: Hoare triple {4989#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {4989#true} is VALID [2022-02-20 23:46:08,641 INFO L290 TraceCheckUtils]: 8: Hoare triple {4989#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4989#true} is VALID [2022-02-20 23:46:08,642 INFO L290 TraceCheckUtils]: 9: Hoare triple {4989#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {4989#true} is VALID [2022-02-20 23:46:08,642 INFO L290 TraceCheckUtils]: 10: Hoare triple {4989#true} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {4991#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,643 INFO L290 TraceCheckUtils]: 11: Hoare triple {4991#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {4992#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} is VALID [2022-02-20 23:46:08,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {4992#(and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,645 INFO L290 TraceCheckUtils]: 15: Hoare triple {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:46:08,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {4993#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(1 == #valid[main_~data~0#1.base]); {4990#false} is VALID [2022-02-20 23:46:08,648 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:08,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:08,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339689476] [2022-02-20 23:46:08,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339689476] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:08,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:08,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:08,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1358425379] [2022-02-20 23:46:08,649 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:08,650 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:08,650 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:08,650 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:08,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:08,665 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:08,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:08,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:08,666 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,061 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-20 23:46:09,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:09,061 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:09,061 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:09,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-02-20 23:46:09,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 135 transitions. [2022-02-20 23:46:09,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 135 transitions. [2022-02-20 23:46:09,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,155 INFO L225 Difference]: With dead ends: 124 [2022-02-20 23:46:09,155 INFO L226 Difference]: Without dead ends: 124 [2022-02-20 23:46:09,155 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:09,155 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 46 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:09,156 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 213 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:09,156 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2022-02-20 23:46:09,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2022-02-20 23:46:09,157 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:09,158 INFO L82 GeneralOperation]: Start isEquivalent. First operand 124 states. Second operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,158 INFO L74 IsIncluded]: Start isIncluded. First operand 124 states. Second operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,158 INFO L87 Difference]: Start difference. First operand 124 states. Second operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,160 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,160 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-20 23:46:09,160 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-02-20 23:46:09,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,161 INFO L74 IsIncluded]: Start isIncluded. First operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:46:09,161 INFO L87 Difference]: Start difference. First operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 124 states. [2022-02-20 23:46:09,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,163 INFO L93 Difference]: Finished difference Result 124 states and 134 transitions. [2022-02-20 23:46:09,163 INFO L276 IsEmpty]: Start isEmpty. Operand 124 states and 134 transitions. [2022-02-20 23:46:09,164 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,164 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,164 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:09,164 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:09,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 81 states have (on average 1.654320987654321) internal successors, (134), 122 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,166 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 134 transitions. [2022-02-20 23:46:09,166 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 134 transitions. Word has length 18 [2022-02-20 23:46:09,167 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:09,167 INFO L470 AbstractCegarLoop]: Abstraction has 123 states and 134 transitions. [2022-02-20 23:46:09,167 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,167 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 134 transitions. [2022-02-20 23:46:09,167 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:09,168 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:09,168 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:09,168 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:46:09,168 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:09,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:09,171 INFO L85 PathProgramCache]: Analyzing trace with hash -967503446, now seen corresponding path program 1 times [2022-02-20 23:46:09,172 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:09,172 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879144501] [2022-02-20 23:46:09,172 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:09,172 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:09,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:09,282 INFO L290 TraceCheckUtils]: 0: Hoare triple {5491#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(12, 2); {5491#true} is VALID [2022-02-20 23:46:09,283 INFO L290 TraceCheckUtils]: 1: Hoare triple {5491#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {5491#true} is VALID [2022-02-20 23:46:09,283 INFO L290 TraceCheckUtils]: 2: Hoare triple {5491#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5491#true} is VALID [2022-02-20 23:46:09,284 INFO L290 TraceCheckUtils]: 3: Hoare triple {5491#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5491#true} is VALID [2022-02-20 23:46:09,284 INFO L290 TraceCheckUtils]: 4: Hoare triple {5491#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {5491#true} is VALID [2022-02-20 23:46:09,285 INFO L290 TraceCheckUtils]: 5: Hoare triple {5491#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {5491#true} is VALID [2022-02-20 23:46:09,286 INFO L290 TraceCheckUtils]: 6: Hoare triple {5491#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {5491#true} is VALID [2022-02-20 23:46:09,286 INFO L290 TraceCheckUtils]: 7: Hoare triple {5491#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {5491#true} is VALID [2022-02-20 23:46:09,287 INFO L290 TraceCheckUtils]: 8: Hoare triple {5491#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:09,287 INFO L290 TraceCheckUtils]: 9: Hoare triple {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:09,288 INFO L290 TraceCheckUtils]: 10: Hoare triple {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:09,288 INFO L290 TraceCheckUtils]: 11: Hoare triple {5493#(and (= (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|) 8) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,290 INFO L290 TraceCheckUtils]: 14: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:09,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {5494#(and (= (+ (select |#length| |ULTIMATE.start_main_~data~0#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(4 + main_~data~0#1.offset <= #length[main_~data~0#1.base] && 0 <= main_~data~0#1.offset); {5492#false} is VALID [2022-02-20 23:46:09,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:09,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:09,293 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879144501] [2022-02-20 23:46:09,293 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879144501] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:09,293 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:09,293 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:09,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1868944013] [2022-02-20 23:46:09,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:09,295 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:09,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:09,296 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:09,310 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:09,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:09,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:09,311 INFO L87 Difference]: Start difference. First operand 123 states and 134 transitions. Second operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,702 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,702 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2022-02-20 23:46:09,702 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:09,702 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:09,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:09,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,704 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2022-02-20 23:46:09,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 217 transitions. [2022-02-20 23:46:09,706 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 217 transitions. [2022-02-20 23:46:09,869 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 217 edges. 217 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:09,871 INFO L225 Difference]: With dead ends: 204 [2022-02-20 23:46:09,871 INFO L226 Difference]: Without dead ends: 204 [2022-02-20 23:46:09,871 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:09,872 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 100 mSDsluCounter, 97 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:09,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [100 Valid, 168 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:09,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 204 states. [2022-02-20 23:46:09,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 204 to 162. [2022-02-20 23:46:09,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:09,876 INFO L82 GeneralOperation]: Start isEquivalent. First operand 204 states. Second operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,876 INFO L74 IsIncluded]: Start isIncluded. First operand 204 states. Second operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,877 INFO L87 Difference]: Start difference. First operand 204 states. Second operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,880 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,880 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2022-02-20 23:46:09,880 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2022-02-20 23:46:09,881 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,881 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,881 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 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 204 states. [2022-02-20 23:46:09,882 INFO L87 Difference]: Start difference. First operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 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 204 states. [2022-02-20 23:46:09,885 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:09,885 INFO L93 Difference]: Finished difference Result 204 states and 223 transitions. [2022-02-20 23:46:09,886 INFO L276 IsEmpty]: Start isEmpty. Operand 204 states and 223 transitions. [2022-02-20 23:46:09,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:09,886 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:09,886 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:09,887 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:09,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 122 states have (on average 1.680327868852459) internal successors, (205), 161 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 205 transitions. [2022-02-20 23:46:09,890 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 205 transitions. Word has length 18 [2022-02-20 23:46:09,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:09,890 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 205 transitions. [2022-02-20 23:46:09,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 6.0) internal successors, (18), 4 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:09,890 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 205 transitions. [2022-02-20 23:46:09,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:46:09,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:09,891 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] [2022-02-20 23:46:09,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:46:09,891 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:09,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:09,892 INFO L85 PathProgramCache]: Analyzing trace with hash 199814016, now seen corresponding path program 1 times [2022-02-20 23:46:09,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:09,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1943373634] [2022-02-20 23:46:09,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:09,893 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:09,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:09,985 INFO L290 TraceCheckUtils]: 0: Hoare triple {6273#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(12, 2); {6273#true} is VALID [2022-02-20 23:46:09,986 INFO L290 TraceCheckUtils]: 1: Hoare triple {6273#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {6273#true} is VALID [2022-02-20 23:46:09,986 INFO L290 TraceCheckUtils]: 2: Hoare triple {6273#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {6273#true} is VALID [2022-02-20 23:46:09,986 INFO L290 TraceCheckUtils]: 3: Hoare triple {6273#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {6273#true} is VALID [2022-02-20 23:46:09,986 INFO L290 TraceCheckUtils]: 4: Hoare triple {6273#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {6273#true} is VALID [2022-02-20 23:46:09,987 INFO L290 TraceCheckUtils]: 5: Hoare triple {6273#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {6273#true} is VALID [2022-02-20 23:46:09,987 INFO L290 TraceCheckUtils]: 6: Hoare triple {6273#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {6273#true} is VALID [2022-02-20 23:46:09,987 INFO L290 TraceCheckUtils]: 7: Hoare triple {6273#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {6273#true} is VALID [2022-02-20 23:46:09,988 INFO L290 TraceCheckUtils]: 8: Hoare triple {6273#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,988 INFO L290 TraceCheckUtils]: 9: Hoare triple {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,988 INFO L290 TraceCheckUtils]: 10: Hoare triple {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,989 INFO L290 TraceCheckUtils]: 11: Hoare triple {6275#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {6276#(and (= (+ (* (- 1) |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:09,990 INFO L290 TraceCheckUtils]: 12: Hoare triple {6276#(and (= (+ (* (- 1) |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,990 INFO L290 TraceCheckUtils]: 13: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,991 INFO L290 TraceCheckUtils]: 14: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,991 INFO L290 TraceCheckUtils]: 15: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,992 INFO L290 TraceCheckUtils]: 16: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,992 INFO L290 TraceCheckUtils]: 17: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,993 INFO L290 TraceCheckUtils]: 18: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,993 INFO L290 TraceCheckUtils]: 19: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,994 INFO L290 TraceCheckUtils]: 20: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,994 INFO L290 TraceCheckUtils]: 21: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~data~0#1.offset; {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:09,995 INFO L290 TraceCheckUtils]: 22: Hoare triple {6277#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base < #StackHeapBarrier); {6274#false} is VALID [2022-02-20 23:46:09,995 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:09,995 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:09,995 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1943373634] [2022-02-20 23:46:09,996 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1943373634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:09,996 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:09,996 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:09,996 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [953641790] [2022-02-20 23:46:09,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:09,997 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:09,997 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:09,997 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:10,014 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:10,014 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:10,015 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:10,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:10,015 INFO L87 Difference]: Start difference. First operand 162 states and 205 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,465 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2022-02-20 23:46:10,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:10,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:10,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:10,466 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-20 23:46:10,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 209 transitions. [2022-02-20 23:46:10,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 209 transitions. [2022-02-20 23:46:10,637 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 209 edges. 209 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:10,640 INFO L225 Difference]: With dead ends: 205 [2022-02-20 23:46:10,640 INFO L226 Difference]: Without dead ends: 205 [2022-02-20 23:46:10,640 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:10,641 INFO L933 BasicCegarLoop]: 121 mSDtfsCounter, 225 mSDsluCounter, 188 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 225 SdHoareTripleChecker+Valid, 309 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:10,641 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [225 Valid, 309 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:10,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 205 states. [2022-02-20 23:46:10,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 205 to 163. [2022-02-20 23:46:10,644 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:10,644 INFO L82 GeneralOperation]: Start isEquivalent. First operand 205 states. Second operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,645 INFO L74 IsIncluded]: Start isIncluded. First operand 205 states. Second operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,645 INFO L87 Difference]: Start difference. First operand 205 states. Second operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,649 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2022-02-20 23:46:10,649 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2022-02-20 23:46:10,649 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:10,649 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:10,650 INFO L74 IsIncluded]: Start isIncluded. First operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 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 205 states. [2022-02-20 23:46:10,650 INFO L87 Difference]: Start difference. First operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 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 205 states. [2022-02-20 23:46:10,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:10,653 INFO L93 Difference]: Finished difference Result 205 states and 224 transitions. [2022-02-20 23:46:10,654 INFO L276 IsEmpty]: Start isEmpty. Operand 205 states and 224 transitions. [2022-02-20 23:46:10,654 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:10,654 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:10,654 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:10,654 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:10,655 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 123 states have (on average 1.6747967479674797) internal successors, (206), 162 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 206 transitions. [2022-02-20 23:46:10,657 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 206 transitions. Word has length 23 [2022-02-20 23:46:10,657 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:10,658 INFO L470 AbstractCegarLoop]: Abstraction has 163 states and 206 transitions. [2022-02-20 23:46:10,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,658 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 206 transitions. [2022-02-20 23:46:10,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:46:10,658 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:10,659 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] [2022-02-20 23:46:10,659 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:46:10,659 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:10,659 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:10,659 INFO L85 PathProgramCache]: Analyzing trace with hash 198674982, now seen corresponding path program 1 times [2022-02-20 23:46:10,660 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:10,660 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [898627391] [2022-02-20 23:46:10,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:10,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:10,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:10,806 INFO L290 TraceCheckUtils]: 0: Hoare triple {7060#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(12, 2); {7060#true} is VALID [2022-02-20 23:46:10,807 INFO L290 TraceCheckUtils]: 1: Hoare triple {7060#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {7060#true} is VALID [2022-02-20 23:46:10,807 INFO L290 TraceCheckUtils]: 2: Hoare triple {7060#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7060#true} is VALID [2022-02-20 23:46:10,807 INFO L290 TraceCheckUtils]: 3: Hoare triple {7060#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7060#true} is VALID [2022-02-20 23:46:10,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {7060#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {7060#true} is VALID [2022-02-20 23:46:10,808 INFO L290 TraceCheckUtils]: 5: Hoare triple {7060#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {7060#true} is VALID [2022-02-20 23:46:10,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {7060#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {7060#true} is VALID [2022-02-20 23:46:10,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {7060#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {7060#true} is VALID [2022-02-20 23:46:10,808 INFO L290 TraceCheckUtils]: 8: Hoare triple {7060#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7060#true} is VALID [2022-02-20 23:46:10,808 INFO L290 TraceCheckUtils]: 9: Hoare triple {7060#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {7060#true} is VALID [2022-02-20 23:46:10,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {7060#true} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {7062#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|))} is VALID [2022-02-20 23:46:10,810 INFO L290 TraceCheckUtils]: 11: Hoare triple {7062#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {7063#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,811 INFO L290 TraceCheckUtils]: 12: Hoare triple {7063#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~lItem~0#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,811 INFO L290 TraceCheckUtils]: 13: Hoare triple {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,812 INFO L290 TraceCheckUtils]: 14: Hoare triple {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,813 INFO L290 TraceCheckUtils]: 15: Hoare triple {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,813 INFO L290 TraceCheckUtils]: 16: Hoare triple {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:10,814 INFO L290 TraceCheckUtils]: 17: Hoare triple {7064#(and (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.offset|))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {7065#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|))} is VALID [2022-02-20 23:46:10,814 INFO L290 TraceCheckUtils]: 18: Hoare triple {7065#(and (= |ULTIMATE.start_main_#t~mem8#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem8#1.base|))} assume !!(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7061#false} is VALID [2022-02-20 23:46:10,814 INFO L290 TraceCheckUtils]: 19: Hoare triple {7061#false} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L557 {7061#false} is VALID [2022-02-20 23:46:10,817 INFO L290 TraceCheckUtils]: 20: Hoare triple {7061#false} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {7061#false} is VALID [2022-02-20 23:46:10,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {7061#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L558 {7061#false} is VALID [2022-02-20 23:46:10,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {7061#false} assume !(4 + (4 + main_#t~mem10#1.offset) <= #length[main_#t~mem10#1.base] && 0 <= 4 + main_#t~mem10#1.offset); {7061#false} is VALID [2022-02-20 23:46:10,818 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:10,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:10,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [898627391] [2022-02-20 23:46:10,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [898627391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:10,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:10,819 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:10,819 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1112733470] [2022-02-20 23:46:10,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:10,820 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:10,822 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:10,822 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:10,839 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:10,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:10,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:10,840 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:10,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:10,841 INFO L87 Difference]: Start difference. First operand 163 states and 206 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,208 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-02-20 23:46:11,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:11,209 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:11,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:11,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 23:46:11,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 145 transitions. [2022-02-20 23:46:11,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 145 transitions. [2022-02-20 23:46:11,327 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 145 edges. 145 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:11,330 INFO L225 Difference]: With dead ends: 191 [2022-02-20 23:46:11,330 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 23:46:11,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:11,331 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 23 mSDsluCounter, 229 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 337 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:11,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 337 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:11,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 23:46:11,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 170. [2022-02-20 23:46:11,335 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:11,335 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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:46:11,335 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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:46:11,336 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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:46:11,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,339 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-02-20 23:46:11,339 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-02-20 23:46:11,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,340 INFO L74 IsIncluded]: Start isIncluded. First operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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 191 states. [2022-02-20 23:46:11,340 INFO L87 Difference]: Start difference. First operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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 191 states. [2022-02-20 23:46:11,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,344 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-02-20 23:46:11,344 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-02-20 23:46:11,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:11,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:11,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 170 states, 130 states have (on average 1.646153846153846) internal successors, (214), 169 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:46:11,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 170 states to 170 states and 214 transitions. [2022-02-20 23:46:11,347 INFO L78 Accepts]: Start accepts. Automaton has 170 states and 214 transitions. Word has length 23 [2022-02-20 23:46:11,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:11,348 INFO L470 AbstractCegarLoop]: Abstraction has 170 states and 214 transitions. [2022-02-20 23:46:11,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,348 INFO L276 IsEmpty]: Start isEmpty. Operand 170 states and 214 transitions. [2022-02-20 23:46:11,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:46:11,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:11,349 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] [2022-02-20 23:46:11,349 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:46:11,349 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:11,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:11,350 INFO L85 PathProgramCache]: Analyzing trace with hash -165115758, now seen corresponding path program 1 times [2022-02-20 23:46:11,350 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:11,350 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [658720686] [2022-02-20 23:46:11,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:11,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:11,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:11,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {7813#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(12, 2); {7813#true} is VALID [2022-02-20 23:46:11,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {7813#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {7813#true} is VALID [2022-02-20 23:46:11,641 INFO L290 TraceCheckUtils]: 2: Hoare triple {7813#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7813#true} is VALID [2022-02-20 23:46:11,641 INFO L290 TraceCheckUtils]: 3: Hoare triple {7813#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7815#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:11,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {7815#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {7815#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:11,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {7815#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,643 INFO L290 TraceCheckUtils]: 6: Hoare triple {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,644 INFO L290 TraceCheckUtils]: 7: Hoare triple {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {7816#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,646 INFO L290 TraceCheckUtils]: 10: Hoare triple {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,647 INFO L290 TraceCheckUtils]: 11: Hoare triple {7817#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {7818#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,648 INFO L290 TraceCheckUtils]: 12: Hoare triple {7818#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,655 INFO L290 TraceCheckUtils]: 13: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,656 INFO L290 TraceCheckUtils]: 14: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,657 INFO L290 TraceCheckUtils]: 15: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,657 INFO L290 TraceCheckUtils]: 16: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:11,672 INFO L290 TraceCheckUtils]: 19: Hoare triple {7819#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 1) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|)))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {7820#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) 1))} is VALID [2022-02-20 23:46:11,673 INFO L290 TraceCheckUtils]: 20: Hoare triple {7820#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) 1))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {7821#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,673 INFO L290 TraceCheckUtils]: 21: Hoare triple {7821#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume 0 == main_~data~0#1.offset; {7822#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,674 INFO L290 TraceCheckUtils]: 22: Hoare triple {7822#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~data~0#1.base < #StackHeapBarrier; {7822#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:11,674 INFO L290 TraceCheckUtils]: 23: Hoare triple {7822#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {7823#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:11,675 INFO L290 TraceCheckUtils]: 24: Hoare triple {7823#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {7823#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:46:11,675 INFO L290 TraceCheckUtils]: 25: Hoare triple {7823#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {7814#false} is VALID [2022-02-20 23:46:11,676 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:11,676 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:11,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [658720686] [2022-02-20 23:46:11,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [658720686] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:11,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:11,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:46:11,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [698054406] [2022-02-20 23:46:11,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:11,677 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:11,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:11,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:11,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:46:11,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:11,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:46:11,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:46:11,702 INFO L87 Difference]: Start difference. First operand 170 states and 214 transitions. Second operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,114 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,114 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-02-20 23:46:13,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:46:13,114 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:13,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:13,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:46:13,116 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,117 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 184 transitions. [2022-02-20 23:46:13,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 184 transitions. [2022-02-20 23:46:13,284 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:46:13,287 INFO L225 Difference]: With dead ends: 228 [2022-02-20 23:46:13,287 INFO L226 Difference]: Without dead ends: 228 [2022-02-20 23:46:13,288 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=90, Invalid=216, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:13,288 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 130 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 771 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 130 SdHoareTripleChecker+Valid, 484 SdHoareTripleChecker+Invalid, 791 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 771 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:13,288 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [130 Valid, 484 Invalid, 791 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 771 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:46:13,289 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 228 states. [2022-02-20 23:46:13,291 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 228 to 177. [2022-02-20 23:46:13,291 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:13,292 INFO L82 GeneralOperation]: Start isEquivalent. First operand 228 states. Second operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,292 INFO L74 IsIncluded]: Start isIncluded. First operand 228 states. Second operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,292 INFO L87 Difference]: Start difference. First operand 228 states. Second operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,297 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,297 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-02-20 23:46:13,298 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2022-02-20 23:46:13,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:13,298 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:13,299 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 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 228 states. [2022-02-20 23:46:13,299 INFO L87 Difference]: Start difference. First operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 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 228 states. [2022-02-20 23:46:13,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:13,303 INFO L93 Difference]: Finished difference Result 228 states and 279 transitions. [2022-02-20 23:46:13,303 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 279 transitions. [2022-02-20 23:46:13,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:13,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:13,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:13,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:13,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6277372262773722) internal successors, (223), 176 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 223 transitions. [2022-02-20 23:46:13,307 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 223 transitions. Word has length 26 [2022-02-20 23:46:13,307 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:13,307 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 223 transitions. [2022-02-20 23:46:13,307 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.6) internal successors, (26), 11 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,307 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 223 transitions. [2022-02-20 23:46:13,308 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:46:13,308 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:13,308 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] [2022-02-20 23:46:13,308 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:46:13,308 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:13,309 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:13,309 INFO L85 PathProgramCache]: Analyzing trace with hash -165115757, now seen corresponding path program 1 times [2022-02-20 23:46:13,309 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:13,309 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1071370367] [2022-02-20 23:46:13,309 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:13,310 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:13,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:13,618 INFO L290 TraceCheckUtils]: 0: Hoare triple {8702#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(12, 2); {8702#true} is VALID [2022-02-20 23:46:13,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {8702#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {8702#true} is VALID [2022-02-20 23:46:13,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {8702#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8702#true} is VALID [2022-02-20 23:46:13,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {8702#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,621 INFO L290 TraceCheckUtils]: 5: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:13,621 INFO L290 TraceCheckUtils]: 6: Hoare triple {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:13,622 INFO L290 TraceCheckUtils]: 7: Hoare triple {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:46:13,623 INFO L290 TraceCheckUtils]: 8: Hoare triple {8705#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:13,624 INFO L290 TraceCheckUtils]: 9: Hoare triple {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:13,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:13,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {8706#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {8707#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:13,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {8707#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,631 INFO L290 TraceCheckUtils]: 17: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,632 INFO L290 TraceCheckUtils]: 18: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:13,632 INFO L290 TraceCheckUtils]: 19: Hoare triple {8708#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {8709#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} is VALID [2022-02-20 23:46:13,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {8709#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {8710#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:13,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {8710#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume 0 == main_~data~0#1.offset; {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,634 INFO L290 TraceCheckUtils]: 22: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume main_~data~0#1.base < #StackHeapBarrier; {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,635 INFO L290 TraceCheckUtils]: 23: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,635 INFO L290 TraceCheckUtils]: 24: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:46:13,636 INFO L290 TraceCheckUtils]: 25: Hoare triple {8704#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !(4 + main_~item~0#1.offset <= #length[main_~item~0#1.base] && 0 <= main_~item~0#1.offset); {8703#false} is VALID [2022-02-20 23:46:13,636 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:13,636 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:13,637 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1071370367] [2022-02-20 23:46:13,637 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1071370367] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:13,637 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:13,637 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:13,637 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031416417] [2022-02-20 23:46:13,637 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:13,638 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:13,638 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:13,638 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:13,665 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:13,666 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:13,666 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:13,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:13,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:13,667 INFO L87 Difference]: Start difference. First operand 177 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,613 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-02-20 23:46:14,613 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:46:14,613 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:46:14,614 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:14,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-02-20 23:46:14,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 161 transitions. [2022-02-20 23:46:14,616 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 161 transitions. [2022-02-20 23:46:14,762 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 161 edges. 161 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,765 INFO L225 Difference]: With dead ends: 207 [2022-02-20 23:46:14,765 INFO L226 Difference]: Without dead ends: 207 [2022-02-20 23:46:14,765 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:46:14,766 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 81 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 401 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 401 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:14,766 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 313 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 401 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:14,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 207 states. [2022-02-20 23:46:14,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 207 to 177. [2022-02-20 23:46:14,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:14,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 207 states. Second operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,770 INFO L74 IsIncluded]: Start isIncluded. First operand 207 states. Second operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,770 INFO L87 Difference]: Start difference. First operand 207 states. Second operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,773 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-02-20 23:46:14,773 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2022-02-20 23:46:14,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 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 207 states. [2022-02-20 23:46:14,774 INFO L87 Difference]: Start difference. First operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 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 207 states. [2022-02-20 23:46:14,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,777 INFO L93 Difference]: Finished difference Result 207 states and 251 transitions. [2022-02-20 23:46:14,777 INFO L276 IsEmpty]: Start isEmpty. Operand 207 states and 251 transitions. [2022-02-20 23:46:14,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:14,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:14,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6204379562043796) internal successors, (222), 176 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 222 transitions. [2022-02-20 23:46:14,781 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 222 transitions. Word has length 26 [2022-02-20 23:46:14,781 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:14,781 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 222 transitions. [2022-02-20 23:46:14,782 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.25) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,782 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 222 transitions. [2022-02-20 23:46:14,782 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:46:14,782 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:14,782 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] [2022-02-20 23:46:14,783 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:46:14,783 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:14,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:14,783 INFO L85 PathProgramCache]: Analyzing trace with hash -823622550, now seen corresponding path program 1 times [2022-02-20 23:46:14,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:14,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [729845282] [2022-02-20 23:46:14,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:14,804 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,916 INFO L290 TraceCheckUtils]: 0: Hoare triple {9527#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(12, 2); {9527#true} is VALID [2022-02-20 23:46:14,917 INFO L290 TraceCheckUtils]: 1: Hoare triple {9527#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {9527#true} is VALID [2022-02-20 23:46:14,917 INFO L290 TraceCheckUtils]: 2: Hoare triple {9527#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {9527#true} is VALID [2022-02-20 23:46:14,921 INFO L290 TraceCheckUtils]: 3: Hoare triple {9527#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:14,921 INFO L290 TraceCheckUtils]: 4: Hoare triple {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:14,922 INFO L290 TraceCheckUtils]: 5: Hoare triple {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:14,922 INFO L290 TraceCheckUtils]: 6: Hoare triple {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:14,923 INFO L290 TraceCheckUtils]: 7: Hoare triple {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:14,923 INFO L290 TraceCheckUtils]: 8: Hoare triple {9529#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:14,924 INFO L290 TraceCheckUtils]: 9: Hoare triple {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:14,924 INFO L290 TraceCheckUtils]: 10: Hoare triple {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:14,925 INFO L290 TraceCheckUtils]: 11: Hoare triple {9530#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {9531#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (= (+ 4 |ULTIMATE.start_main_~data~0#1.offset|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:46:14,925 INFO L290 TraceCheckUtils]: 12: Hoare triple {9531#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (= (+ 4 |ULTIMATE.start_main_~data~0#1.offset|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,929 INFO L290 TraceCheckUtils]: 14: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,929 INFO L290 TraceCheckUtils]: 16: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,930 INFO L290 TraceCheckUtils]: 18: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} is VALID [2022-02-20 23:46:14,931 INFO L290 TraceCheckUtils]: 19: Hoare triple {9532#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {9533#(not (= |ULTIMATE.start_main_#t~mem20#1.base| 0))} is VALID [2022-02-20 23:46:14,931 INFO L290 TraceCheckUtils]: 20: Hoare triple {9533#(not (= |ULTIMATE.start_main_#t~mem20#1.base| 0))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:14,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~data~0#1.offset; {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:14,932 INFO L290 TraceCheckUtils]: 22: Hoare triple {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume main_~data~0#1.base < #StackHeapBarrier; {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:14,932 INFO L290 TraceCheckUtils]: 23: Hoare triple {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:14,933 INFO L290 TraceCheckUtils]: 24: Hoare triple {9534#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0); {9528#false} is VALID [2022-02-20 23:46:14,933 INFO L290 TraceCheckUtils]: 25: Hoare triple {9528#false} main_#res#1 := 0; {9528#false} is VALID [2022-02-20 23:46:14,933 INFO L290 TraceCheckUtils]: 26: Hoare triple {9528#false} assume !(#valid == main_old_#valid#1); {9528#false} is VALID [2022-02-20 23:46:14,933 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:14,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:14,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [729845282] [2022-02-20 23:46:14,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [729845282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:14,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:14,934 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:14,934 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302922908] [2022-02-20 23:46:14,934 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:14,935 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:14,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:14,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:14,957 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:46:14,957 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:14,957 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:14,958 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:14,958 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:14,958 INFO L87 Difference]: Start difference. First operand 177 states and 222 transitions. Second operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:15,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,409 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-02-20 23:46:15,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:46:15,409 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:15,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:15,409 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:15,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-02-20 23:46:15,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:15,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 148 transitions. [2022-02-20 23:46:15,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 148 transitions. [2022-02-20 23:46:15,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 148 edges. 148 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:15,533 INFO L225 Difference]: With dead ends: 194 [2022-02-20 23:46:15,533 INFO L226 Difference]: Without dead ends: 194 [2022-02-20 23:46:15,534 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:46:15,534 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 41 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:15,534 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 477 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:15,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2022-02-20 23:46:15,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 177. [2022-02-20 23:46:15,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:15,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 194 states. Second operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,538 INFO L74 IsIncluded]: Start isIncluded. First operand 194 states. Second operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,538 INFO L87 Difference]: Start difference. First operand 194 states. Second operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,541 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-02-20 23:46:15,541 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2022-02-20 23:46:15,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,542 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,542 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 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 194 states. [2022-02-20 23:46:15,543 INFO L87 Difference]: Start difference. First operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 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 194 states. [2022-02-20 23:46:15,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:15,546 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-02-20 23:46:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 238 transitions. [2022-02-20 23:46:15,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:15,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:15,546 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:15,546 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:15,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 137 states have (on average 1.6131386861313868) internal successors, (221), 176 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 221 transitions. [2022-02-20 23:46:15,549 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 221 transitions. Word has length 27 [2022-02-20 23:46:15,550 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:15,550 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 221 transitions. [2022-02-20 23:46:15,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.375) internal successors, (27), 8 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:46:15,550 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 221 transitions. [2022-02-20 23:46:15,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:46:15,551 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:15,551 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] [2022-02-20 23:46:15,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:46:15,551 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:15,552 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:15,552 INFO L85 PathProgramCache]: Analyzing trace with hash 237551634, now seen corresponding path program 1 times [2022-02-20 23:46:15,552 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:15,552 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [955829183] [2022-02-20 23:46:15,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:15,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:15,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:15,684 INFO L290 TraceCheckUtils]: 0: Hoare triple {10304#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(12, 2); {10304#true} is VALID [2022-02-20 23:46:15,685 INFO L290 TraceCheckUtils]: 1: Hoare triple {10304#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {10304#true} is VALID [2022-02-20 23:46:15,685 INFO L290 TraceCheckUtils]: 2: Hoare triple {10304#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {10304#true} is VALID [2022-02-20 23:46:15,685 INFO L290 TraceCheckUtils]: 3: Hoare triple {10304#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,687 INFO L290 TraceCheckUtils]: 6: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,687 INFO L290 TraceCheckUtils]: 7: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,688 INFO L290 TraceCheckUtils]: 8: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:15,688 INFO L290 TraceCheckUtils]: 9: Hoare triple {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:15,693 INFO L290 TraceCheckUtils]: 10: Hoare triple {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:15,694 INFO L290 TraceCheckUtils]: 11: Hoare triple {10307#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {10308#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:15,695 INFO L290 TraceCheckUtils]: 12: Hoare triple {10308#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,696 INFO L290 TraceCheckUtils]: 13: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,696 INFO L290 TraceCheckUtils]: 14: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,697 INFO L290 TraceCheckUtils]: 15: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,698 INFO L290 TraceCheckUtils]: 17: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 23:46:15,699 INFO L290 TraceCheckUtils]: 19: Hoare triple {10309#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {10310#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} is VALID [2022-02-20 23:46:15,700 INFO L290 TraceCheckUtils]: 20: Hoare triple {10310#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem20#1.offset| 0))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {10311#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:15,700 INFO L290 TraceCheckUtils]: 21: Hoare triple {10311#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume 0 == main_~data~0#1.offset; {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,701 INFO L290 TraceCheckUtils]: 22: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume main_~data~0#1.base < #StackHeapBarrier; {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,701 INFO L290 TraceCheckUtils]: 23: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,702 INFO L290 TraceCheckUtils]: 24: Hoare triple {10306#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,702 INFO L290 TraceCheckUtils]: 25: Hoare triple {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,703 INFO L290 TraceCheckUtils]: 26: Hoare triple {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} is VALID [2022-02-20 23:46:15,703 INFO L290 TraceCheckUtils]: 27: Hoare triple {10312#(= |ULTIMATE.start_main_~item2~0#1.offset| 0)} assume !(0 == main_~item2~0#1.offset); {10305#false} is VALID [2022-02-20 23:46:15,704 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:15,704 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:15,704 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [955829183] [2022-02-20 23:46:15,704 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [955829183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:15,704 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:15,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:15,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1525838761] [2022-02-20 23:46:15,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:15,705 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:46:15,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:15,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:15,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:15,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:15,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:15,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:15,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:15,731 INFO L87 Difference]: Start difference. First operand 177 states and 221 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:16,409 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2022-02-20 23:46:16,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:46:16,410 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 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 28 [2022-02-20 23:46:16,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:16,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 196 transitions. [2022-02-20 23:46:16,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 196 transitions. [2022-02-20 23:46:16,413 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 196 transitions. [2022-02-20 23:46:16,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 196 edges. 196 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:16,562 INFO L225 Difference]: With dead ends: 229 [2022-02-20 23:46:16,562 INFO L226 Difference]: Without dead ends: 229 [2022-02-20 23:46:16,563 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 35 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=79, Invalid=193, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:46:16,563 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 171 mSDsluCounter, 402 mSDsCounter, 0 mSdLazyCounter, 279 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 514 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 279 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:16,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 514 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 279 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:16,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 229 states. [2022-02-20 23:46:16,566 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 229 to 179. [2022-02-20 23:46:16,567 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:16,567 INFO L82 GeneralOperation]: Start isEquivalent. First operand 229 states. Second operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,567 INFO L74 IsIncluded]: Start isIncluded. First operand 229 states. Second operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,568 INFO L87 Difference]: Start difference. First operand 229 states. Second operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:16,571 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2022-02-20 23:46:16,571 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2022-02-20 23:46:16,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:16,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:16,572 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 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 229 states. [2022-02-20 23:46:16,573 INFO L87 Difference]: Start difference. First operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 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 229 states. [2022-02-20 23:46:16,576 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:16,577 INFO L93 Difference]: Finished difference Result 229 states and 275 transitions. [2022-02-20 23:46:16,577 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 275 transitions. [2022-02-20 23:46:16,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:16,577 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:16,577 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:16,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:16,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 139 states have (on average 1.60431654676259) internal successors, (223), 178 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 223 transitions. [2022-02-20 23:46:16,581 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 223 transitions. Word has length 28 [2022-02-20 23:46:16,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:16,581 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 223 transitions. [2022-02-20 23:46:16,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 223 transitions. [2022-02-20 23:46:16,582 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:46:16,582 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:16,582 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:16,582 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:46:16,582 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:16,583 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:16,583 INFO L85 PathProgramCache]: Analyzing trace with hash -1225833714, now seen corresponding path program 1 times [2022-02-20 23:46:16,583 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:16,583 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [609791318] [2022-02-20 23:46:16,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:16,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:16,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:16,724 INFO L290 TraceCheckUtils]: 0: Hoare triple {11199#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(12, 2); {11199#true} is VALID [2022-02-20 23:46:16,724 INFO L290 TraceCheckUtils]: 1: Hoare triple {11199#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {11199#true} is VALID [2022-02-20 23:46:16,724 INFO L290 TraceCheckUtils]: 2: Hoare triple {11199#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {11199#true} is VALID [2022-02-20 23:46:16,725 INFO L290 TraceCheckUtils]: 3: Hoare triple {11199#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,725 INFO L290 TraceCheckUtils]: 4: Hoare triple {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,726 INFO L290 TraceCheckUtils]: 5: Hoare triple {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,727 INFO L290 TraceCheckUtils]: 6: Hoare triple {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,727 INFO L290 TraceCheckUtils]: 7: Hoare triple {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,728 INFO L290 TraceCheckUtils]: 8: Hoare triple {11201#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,728 INFO L290 TraceCheckUtils]: 9: Hoare triple {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,729 INFO L290 TraceCheckUtils]: 10: Hoare triple {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:16,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {11202#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {11203#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (= (+ 4 |ULTIMATE.start_main_~data~0#1.offset|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:46:16,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {11203#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (= (+ 4 |ULTIMATE.start_main_~data~0#1.offset|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,732 INFO L290 TraceCheckUtils]: 14: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,733 INFO L290 TraceCheckUtils]: 16: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,733 INFO L290 TraceCheckUtils]: 17: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,734 INFO L290 TraceCheckUtils]: 18: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,735 INFO L290 TraceCheckUtils]: 19: Hoare triple {11204#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {11205#(<= (+ |ULTIMATE.start_main_#t~mem20#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,736 INFO L290 TraceCheckUtils]: 20: Hoare triple {11205#(<= (+ |ULTIMATE.start_main_#t~mem20#1.base| 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,737 INFO L290 TraceCheckUtils]: 21: Hoare triple {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~data~0#1.offset; {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,737 INFO L290 TraceCheckUtils]: 22: Hoare triple {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} assume main_~data~0#1.base < #StackHeapBarrier; {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,737 INFO L290 TraceCheckUtils]: 23: Hoare triple {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,738 INFO L290 TraceCheckUtils]: 24: Hoare triple {11206#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,738 INFO L290 TraceCheckUtils]: 25: Hoare triple {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,739 INFO L290 TraceCheckUtils]: 26: Hoare triple {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,739 INFO L290 TraceCheckUtils]: 27: Hoare triple {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~item2~0#1.offset; {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:16,740 INFO L290 TraceCheckUtils]: 28: Hoare triple {11207#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~item2~0#1.base < #StackHeapBarrier); {11200#false} is VALID [2022-02-20 23:46:16,741 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:16,741 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:16,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [609791318] [2022-02-20 23:46:16,742 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [609791318] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:16,742 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:16,742 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:16,742 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [283402517] [2022-02-20 23:46:16,742 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:16,743 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:46:16,743 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:16,743 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:16,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:16,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:16,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:16,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:16,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:16,767 INFO L87 Difference]: Start difference. First operand 179 states and 223 transitions. Second operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,374 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2022-02-20 23:46:17,374 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:17,374 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:46:17,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:17,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-02-20 23:46:17,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 154 transitions. [2022-02-20 23:46:17,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 154 transitions. [2022-02-20 23:46:17,501 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:17,503 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:46:17,504 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:46:17,504 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=155, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:46:17,504 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 71 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 234 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:17,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 384 Invalid, 234 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:17,505 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:46:17,507 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 180. [2022-02-20 23:46:17,507 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:17,507 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,508 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,508 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,511 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2022-02-20 23:46:17,511 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 244 transitions. [2022-02-20 23:46:17,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:17,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:17,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:46:17,512 INFO L87 Difference]: Start difference. First operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:46:17,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,516 INFO L93 Difference]: Finished difference Result 200 states and 244 transitions. [2022-02-20 23:46:17,516 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 244 transitions. [2022-02-20 23:46:17,516 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:17,516 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:17,517 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:17,517 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:17,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 140 states have (on average 1.6) internal successors, (224), 179 states have internal predecessors, (224), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 224 transitions. [2022-02-20 23:46:17,520 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 224 transitions. Word has length 29 [2022-02-20 23:46:17,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:17,520 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 224 transitions. [2022-02-20 23:46:17,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.625) internal successors, (29), 9 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,521 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 224 transitions. [2022-02-20 23:46:17,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:46:17,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:17,521 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] [2022-02-20 23:46:17,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:46:17,522 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:17,522 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:17,522 INFO L85 PathProgramCache]: Analyzing trace with hash 653860756, now seen corresponding path program 1 times [2022-02-20 23:46:17,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:17,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1572237616] [2022-02-20 23:46:17,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:17,523 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:17,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:17,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {12002#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(12, 2); {12002#true} is VALID [2022-02-20 23:46:17,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {12002#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {12002#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12002#true} is VALID [2022-02-20 23:46:17,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {12002#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {12002#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {12002#true} is VALID [2022-02-20 23:46:17,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {12002#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {12002#true} is VALID [2022-02-20 23:46:17,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {12002#true} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {12002#true} is VALID [2022-02-20 23:46:17,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {12002#true} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {12002#true} is VALID [2022-02-20 23:46:17,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {12002#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {12002#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {12002#true} is VALID [2022-02-20 23:46:17,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {12002#true} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {12002#true} is VALID [2022-02-20 23:46:17,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {12002#true} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,570 INFO L290 TraceCheckUtils]: 12: Hoare triple {12002#true} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {12002#true} is VALID [2022-02-20 23:46:17,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {12002#true} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {12002#true} is VALID [2022-02-20 23:46:17,571 INFO L290 TraceCheckUtils]: 14: Hoare triple {12002#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12002#true} is VALID [2022-02-20 23:46:17,571 INFO L290 TraceCheckUtils]: 15: Hoare triple {12002#true} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12002#true} is VALID [2022-02-20 23:46:17,571 INFO L290 TraceCheckUtils]: 16: Hoare triple {12002#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {12002#true} is VALID [2022-02-20 23:46:17,572 INFO L290 TraceCheckUtils]: 17: Hoare triple {12002#true} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {12002#true} is VALID [2022-02-20 23:46:17,573 INFO L290 TraceCheckUtils]: 18: Hoare triple {12002#true} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,573 INFO L290 TraceCheckUtils]: 19: Hoare triple {12002#true} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {12002#true} is VALID [2022-02-20 23:46:17,573 INFO L290 TraceCheckUtils]: 20: Hoare triple {12002#true} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,573 INFO L290 TraceCheckUtils]: 21: Hoare triple {12002#true} assume 0 == main_~data~0#1.offset; {12002#true} is VALID [2022-02-20 23:46:17,573 INFO L290 TraceCheckUtils]: 22: Hoare triple {12002#true} assume main_~data~0#1.base < #StackHeapBarrier; {12002#true} is VALID [2022-02-20 23:46:17,574 INFO L290 TraceCheckUtils]: 23: Hoare triple {12002#true} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {12002#true} is VALID [2022-02-20 23:46:17,574 INFO L290 TraceCheckUtils]: 24: Hoare triple {12002#true} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {12004#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|))} is VALID [2022-02-20 23:46:17,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {12004#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:46:17,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:46:17,575 INFO L290 TraceCheckUtils]: 27: Hoare triple {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} assume 0 == main_~item2~0#1.offset; {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:46:17,576 INFO L290 TraceCheckUtils]: 28: Hoare triple {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} assume main_~item2~0#1.base < #StackHeapBarrier; {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:46:17,576 INFO L290 TraceCheckUtils]: 29: Hoare triple {12005#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} assume !(0 == main_~item2~0#1.base || 1 == #valid[main_~item2~0#1.base]); {12003#false} is VALID [2022-02-20 23:46:17,576 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:46:17,577 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:17,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1572237616] [2022-02-20 23:46:17,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1572237616] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:17,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:17,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:17,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [317345304] [2022-02-20 23:46:17,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:17,578 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 30 [2022-02-20 23:46:17,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:17,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,597 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:17,598 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:17,598 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:17,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:17,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:17,599 INFO L87 Difference]: Start difference. First operand 180 states and 224 transitions. Second operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:17,945 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2022-02-20 23:46:17,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:17,946 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 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 30 [2022-02-20 23:46:17,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:17,946 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,947 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 23:46:17,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:17,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 180 transitions. [2022-02-20 23:46:17,948 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 180 transitions. [2022-02-20 23:46:18,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 180 edges. 180 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:18,069 INFO L225 Difference]: With dead ends: 251 [2022-02-20 23:46:18,069 INFO L226 Difference]: Without dead ends: 251 [2022-02-20 23:46:18,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:18,070 INFO L933 BasicCegarLoop]: 127 mSDtfsCounter, 77 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 191 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 230 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 191 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:18,070 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [77 Valid, 230 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 191 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:18,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 251 states. [2022-02-20 23:46:18,073 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 251 to 184. [2022-02-20 23:46:18,073 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:18,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 251 states. Second operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,074 INFO L74 IsIncluded]: Start isIncluded. First operand 251 states. Second operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,074 INFO L87 Difference]: Start difference. First operand 251 states. Second operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,078 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2022-02-20 23:46:18,079 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 315 transitions. [2022-02-20 23:46:18,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,079 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 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:46:18,080 INFO L87 Difference]: Start difference. First operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 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:46:18,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:18,084 INFO L93 Difference]: Finished difference Result 251 states and 315 transitions. [2022-02-20 23:46:18,084 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 315 transitions. [2022-02-20 23:46:18,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:18,085 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:18,085 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:18,085 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 146 states have (on average 1.6095890410958904) internal successors, (235), 183 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 235 transitions. [2022-02-20 23:46:18,088 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 235 transitions. Word has length 30 [2022-02-20 23:46:18,089 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:18,089 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 235 transitions. [2022-02-20 23:46:18,089 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 9.666666666666666) internal successors, (29), 4 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:18,089 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 235 transitions. [2022-02-20 23:46:18,089 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:46:18,089 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:18,090 INFO L514 BasicCegarLoop]: trace histogram [2, 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] [2022-02-20 23:46:18,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:46:18,090 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:18,090 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:18,091 INFO L85 PathProgramCache]: Analyzing trace with hash 1294968215, now seen corresponding path program 1 times [2022-02-20 23:46:18,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:18,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [926520056] [2022-02-20 23:46:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:18,116 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,478 INFO L290 TraceCheckUtils]: 0: Hoare triple {12947#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(12, 2); {12947#true} is VALID [2022-02-20 23:46:18,478 INFO L290 TraceCheckUtils]: 1: Hoare triple {12947#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {12947#true} is VALID [2022-02-20 23:46:18,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {12947#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12947#true} is VALID [2022-02-20 23:46:18,478 INFO L290 TraceCheckUtils]: 3: Hoare triple {12947#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:18,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:18,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:46:18,480 INFO L290 TraceCheckUtils]: 6: Hoare triple {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:46:18,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:46:18,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:18,483 INFO L290 TraceCheckUtils]: 9: Hoare triple {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:18,484 INFO L290 TraceCheckUtils]: 10: Hoare triple {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:18,485 INFO L290 TraceCheckUtils]: 11: Hoare triple {12951#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {12952#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:18,486 INFO L290 TraceCheckUtils]: 12: Hoare triple {12952#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,487 INFO L290 TraceCheckUtils]: 13: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,487 INFO L290 TraceCheckUtils]: 14: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,488 INFO L290 TraceCheckUtils]: 15: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,489 INFO L290 TraceCheckUtils]: 16: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,490 INFO L290 TraceCheckUtils]: 17: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,490 INFO L290 TraceCheckUtils]: 18: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,491 INFO L290 TraceCheckUtils]: 19: Hoare triple {12953#(and (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) 0))) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {12954#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) 0) 0)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|)))} is VALID [2022-02-20 23:46:18,492 INFO L290 TraceCheckUtils]: 20: Hoare triple {12954#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) 0) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) 0) 0)) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {12955#(and (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:46:18,493 INFO L290 TraceCheckUtils]: 21: Hoare triple {12955#(and (or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume 0 == main_~data~0#1.offset; {12956#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:18,493 INFO L290 TraceCheckUtils]: 22: Hoare triple {12956#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} assume main_~data~0#1.base < #StackHeapBarrier; {12956#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:18,494 INFO L290 TraceCheckUtils]: 23: Hoare triple {12956#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {12957#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 0))} is VALID [2022-02-20 23:46:18,495 INFO L290 TraceCheckUtils]: 24: Hoare triple {12957#(or (not (= |ULTIMATE.start_main_~item~0#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 0))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {12958#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 0))} is VALID [2022-02-20 23:46:18,496 INFO L290 TraceCheckUtils]: 25: Hoare triple {12958#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 0))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {12959#(or (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)))} is VALID [2022-02-20 23:46:18,496 INFO L290 TraceCheckUtils]: 26: Hoare triple {12959#(or (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0)) (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {12960#(or (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:18,497 INFO L290 TraceCheckUtils]: 27: Hoare triple {12960#(or (not (= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume 0 == main_~item2~0#1.offset; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:18,497 INFO L290 TraceCheckUtils]: 28: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume main_~item2~0#1.base < #StackHeapBarrier; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:18,498 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~item2~0#1.base || 1 == #valid[main_~item2~0#1.base];call ULTIMATE.dealloc(main_~item2~0#1.base, main_~item2~0#1.offset); {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:18,498 INFO L290 TraceCheckUtils]: 30: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {12948#false} is VALID [2022-02-20 23:46:18,498 INFO L290 TraceCheckUtils]: 31: Hoare triple {12948#false} assume !(1 == #valid[main_~item~0#1.base]); {12948#false} is VALID [2022-02-20 23:46:18,499 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:18,499 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:18,499 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [926520056] [2022-02-20 23:46:18,499 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [926520056] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:46:18,500 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [873248283] [2022-02-20 23:46:18,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:18,500 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:18,500 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:18,507 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:46:18,535 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:46:18,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,633 INFO L263 TraceCheckSpWp]: Trace formula consists of 202 conjuncts, 48 conjunts are in the unsatisfiable core [2022-02-20 23:46:18,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:18,683 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:18,793 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:46:18,798 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:46:18,887 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 19 treesize of output 18 [2022-02-20 23:46:18,893 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 19 treesize of output 18 [2022-02-20 23:46:18,976 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:46:18,976 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 23:46:19,002 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:46:19,003 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 20 [2022-02-20 23:46:19,103 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 23 treesize of output 22 [2022-02-20 23:46:19,116 INFO L356 Elim1Store]: treesize reduction 19, result has 47.2 percent of original size [2022-02-20 23:46:19,116 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 26 treesize of output 36 [2022-02-20 23:46:19,641 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:46:20,926 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:46:20,937 INFO L356 Elim1Store]: treesize reduction 19, result has 29.6 percent of original size [2022-02-20 23:46:20,938 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 76 treesize of output 48 [2022-02-20 23:46:21,032 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:46:21,033 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 19 treesize of output 19 [2022-02-20 23:46:21,084 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:21,085 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:46:21,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {12947#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(12, 2); {12947#true} is VALID [2022-02-20 23:46:21,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {12947#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {12947#true} is VALID [2022-02-20 23:46:21,275 INFO L290 TraceCheckUtils]: 2: Hoare triple {12947#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12947#true} is VALID [2022-02-20 23:46:21,275 INFO L290 TraceCheckUtils]: 3: Hoare triple {12947#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:21,276 INFO L290 TraceCheckUtils]: 4: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:21,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:46:21,277 INFO L290 TraceCheckUtils]: 6: Hoare triple {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:46:21,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {12950#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {12986#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))} is VALID [2022-02-20 23:46:21,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {12986#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {12990#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:21,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {12990#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {12990#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:21,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {12990#(and (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {12997#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:21,281 INFO L290 TraceCheckUtils]: 11: Hoare triple {12997#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {13001#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:46:21,282 INFO L290 TraceCheckUtils]: 12: Hoare triple {13001#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) 0))) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,282 INFO L290 TraceCheckUtils]: 13: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {13021#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {13021#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {13021#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,287 INFO L290 TraceCheckUtils]: 19: Hoare triple {13021#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {13028#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_#t~mem20#1.base|) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,288 INFO L290 TraceCheckUtils]: 20: Hoare triple {13028#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_#t~mem20#1.base|) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {13032#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,290 INFO L290 TraceCheckUtils]: 21: Hoare triple {13032#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume 0 == main_~data~0#1.offset; {13036#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {13036#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume main_~data~0#1.base < #StackHeapBarrier; {13036#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:21,295 INFO L290 TraceCheckUtils]: 23: Hoare triple {13036#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (and (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {13043#(exists ((|ULTIMATE.start_main_~data~0#1.offset| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))) (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:46:21,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {13043#(exists ((|ULTIMATE.start_main_~data~0#1.offset| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))) (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {13047#(and (<= |ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~item2~0#1.offset|) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))))} is VALID [2022-02-20 23:46:21,297 INFO L290 TraceCheckUtils]: 25: Hoare triple {13047#(and (<= |ULTIMATE.start_main_~item~0#1.offset| |ULTIMATE.start_main_~item2~0#1.offset|) (exists ((|ULTIMATE.start_main_~data~0#1.offset| Int) (|ULTIMATE.start_main_~data~0#1.base| Int)) (and (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 0) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))) (<= |ULTIMATE.start_main_~data~0#1.offset| 0))))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {13051#(or (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|)) (< 0 |ULTIMATE.start_main_~item2~0#1.offset|))} is VALID [2022-02-20 23:46:21,298 INFO L290 TraceCheckUtils]: 26: Hoare triple {13051#(or (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|)) (< 0 |ULTIMATE.start_main_~item2~0#1.offset|))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {13055#(or (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|)) (< 0 |ULTIMATE.start_main_~item2~0#1.offset|))} is VALID [2022-02-20 23:46:21,298 INFO L290 TraceCheckUtils]: 27: Hoare triple {13055#(or (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|)) (< 0 |ULTIMATE.start_main_~item2~0#1.offset|))} assume 0 == main_~item2~0#1.offset; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:21,299 INFO L290 TraceCheckUtils]: 28: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume main_~item2~0#1.base < #StackHeapBarrier; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:21,300 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~item2~0#1.base || 1 == #valid[main_~item2~0#1.base];call ULTIMATE.dealloc(main_~item2~0#1.base, main_~item2~0#1.offset); {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:21,300 INFO L290 TraceCheckUtils]: 30: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {12948#false} is VALID [2022-02-20 23:46:21,300 INFO L290 TraceCheckUtils]: 31: Hoare triple {12948#false} assume !(1 == #valid[main_~item~0#1.base]); {12948#false} is VALID [2022-02-20 23:46:21,301 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:21,301 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:21,622 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 10 treesize of output 8 [2022-02-20 23:46:23,086 INFO L356 Elim1Store]: treesize reduction 14, result has 58.8 percent of original size [2022-02-20 23:46:23,086 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 72 [2022-02-20 23:46:23,551 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 57 treesize of output 53 [2022-02-20 23:46:24,035 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse1 (= (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) 4))) (let ((.cse3 (not .cse1)) (.cse2 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (and (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse1) (and (= (select (select .cse2 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) .cse1) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) .cse3) (and .cse3 (= (select (select .cse2 v_arrayElimCell_16) 0) 0))))))) is different from false [2022-02-20 23:46:24,691 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-02-20 23:46:24,843 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-02-20 23:46:25,218 INFO L356 Elim1Store]: treesize reduction 23, result has 50.0 percent of original size [2022-02-20 23:46:25,219 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 35 [2022-02-20 23:46:25,233 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:46:25,242 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:25,243 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 11 [2022-02-20 23:46:25,288 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:46:25,290 INFO L356 Elim1Store]: treesize reduction 18, result has 5.3 percent of original size [2022-02-20 23:46:25,291 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 23 treesize of output 1 [2022-02-20 23:46:25,301 INFO L290 TraceCheckUtils]: 31: Hoare triple {12948#false} assume !(1 == #valid[main_~item~0#1.base]); {12948#false} is VALID [2022-02-20 23:46:25,302 INFO L290 TraceCheckUtils]: 30: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {12948#false} is VALID [2022-02-20 23:46:25,302 INFO L290 TraceCheckUtils]: 29: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~item2~0#1.base || 1 == #valid[main_~item2~0#1.base];call ULTIMATE.dealloc(main_~item2~0#1.base, main_~item2~0#1.offset); {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:25,303 INFO L290 TraceCheckUtils]: 28: Hoare triple {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume main_~item2~0#1.base < #StackHeapBarrier; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:25,303 INFO L290 TraceCheckUtils]: 27: Hoare triple {13083#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume 0 == main_~item2~0#1.offset; {12961#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:46:25,304 INFO L290 TraceCheckUtils]: 26: Hoare triple {13087#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {13083#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:46:25,305 INFO L290 TraceCheckUtils]: 25: Hoare triple {13091#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L587 {13087#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (and (= |ULTIMATE.start_main_#t~mem21#1.base| 0) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0)))} is VALID [2022-02-20 23:46:25,306 INFO L290 TraceCheckUtils]: 24: Hoare triple {13095#(or (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} assume !!(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {13091#(or (not (<= |ULTIMATE.start_main_~item2~0#1.offset| 0)) (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:46:25,307 INFO L290 TraceCheckUtils]: 23: Hoare triple {13099#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} assume 0 == main_~data~0#1.base || 1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {13095#(or (not (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} is VALID [2022-02-20 23:46:25,308 INFO L290 TraceCheckUtils]: 22: Hoare triple {13099#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} assume main_~data~0#1.base < #StackHeapBarrier; {13099#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} is VALID [2022-02-20 23:46:25,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {13106#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} assume 0 == main_~data~0#1.offset; {13099#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))))} is VALID [2022-02-20 23:46:25,310 INFO L290 TraceCheckUtils]: 20: Hoare triple {13110#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {13106#(or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:46:25,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {13114#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L556-4 {13110#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem20#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem20#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem20#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:46:25,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {13114#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {13114#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:46:25,313 INFO L290 TraceCheckUtils]: 17: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L556-3 {13114#(or (forall ((|ULTIMATE.start_main_~item~0#1.offset| Int)) (or (< 0 |ULTIMATE.start_main_~item~0#1.offset|) (not (<= 0 |ULTIMATE.start_main_~item~0#1.offset|)) (and (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) |ULTIMATE.start_main_~item~0#1.offset|) 0)))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:46:25,314 INFO L290 TraceCheckUtils]: 16: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:25,314 INFO L290 TraceCheckUtils]: 15: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume !(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:25,315 INFO L290 TraceCheckUtils]: 14: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:25,316 INFO L290 TraceCheckUtils]: 13: Hoare triple {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} main_~item~0#1.base, main_~item~0#1.offset := 0, 0;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0, 0; {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:25,317 INFO L290 TraceCheckUtils]: 12: Hoare triple {13136#(and (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4))) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0))))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L543-1 {13005#(and (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0)) (or (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4))))} is VALID [2022-02-20 23:46:25,318 INFO L290 TraceCheckUtils]: 11: Hoare triple {13140#(and (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) 0) 0))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) 0) 0)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {13136#(and (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0) (= |ULTIMATE.start_main_~data~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4))) (or (= |ULTIMATE.start_main_~data~0#1.base| (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) |ULTIMATE.start_main_~data~0#1.base|) 4)) 0) 0))))} is VALID [2022-02-20 23:46:25,323 WARN L290 TraceCheckUtils]: 10: Hoare triple {13144#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (or (and (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_16) 0) 0) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4)))))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L547 {13140#(and (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) (forall ((v_ArrVal_422 (Array Int Int))) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) 0) 0))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|)) (select (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.base|) 4)) 0) 0)))} is UNKNOWN [2022-02-20 23:46:25,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {13144#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (or (and (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_16) 0) 0) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4)))))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {13144#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (or (and (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_16) 0) 0) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4)))))} is VALID [2022-02-20 23:46:25,327 INFO L290 TraceCheckUtils]: 8: Hoare triple {13151#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0))))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13144#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (or (and (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0)) (and (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) v_arrayElimCell_16) 0) 0) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) (not (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4))) (and (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) 4)))))} is VALID [2022-02-20 23:46:25,331 WARN L290 TraceCheckUtils]: 7: Hoare triple {13155#(and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= 0 (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))))} SUMMARY for call write~int(main_#t~nondet5#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L541 {13151#(and (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0) 0) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0) 0))))} is UNKNOWN [2022-02-20 23:46:25,334 WARN L290 TraceCheckUtils]: 6: Hoare triple {13155#(and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= 0 (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))))} assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647; {13155#(and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= 0 (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))))} is UNKNOWN [2022-02-20 23:46:25,335 INFO L290 TraceCheckUtils]: 5: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L538-2 {13155#(and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |ULTIMATE.start_main_~item~0#1.base|) 0)))) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (or (= 0 (select (select (store (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base| (store (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_1 4)) 0)) (= |ULTIMATE.start_main_~lItem~0#1.base| (select v_arrayElimArr_1 4)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_1 4))))))} is VALID [2022-02-20 23:46:25,336 INFO L290 TraceCheckUtils]: 4: Hoare triple {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:25,336 INFO L290 TraceCheckUtils]: 3: Hoare triple {12947#true} assume !!(0 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {12949#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:46:25,336 INFO L290 TraceCheckUtils]: 2: Hoare triple {12947#true} assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647; {12947#true} is VALID [2022-02-20 23:46:25,337 INFO L290 TraceCheckUtils]: 1: Hoare triple {12947#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {12947#true} is VALID [2022-02-20 23:46:25,337 INFO L290 TraceCheckUtils]: 0: Hoare triple {12947#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(12, 2); {12947#true} is VALID [2022-02-20 23:46:25,338 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 3 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:25,339 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [873248283] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:25,340 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:46:25,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 18, 18] total 41 [2022-02-20 23:46:25,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [373530866] [2022-02-20 23:46:25,341 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:25,343 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 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 32 [2022-02-20 23:46:25,343 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:25,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:25,435 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 69 inductive. 0 not inductive. 3 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:25,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-20 23:46:25,435 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:25,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-20 23:46:25,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=1253, Unknown=8, NotChecked=222, Total=1640 [2022-02-20 23:46:25,436 INFO L87 Difference]: Start difference. First operand 184 states and 235 transitions. Second operand has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:25,557 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0)) is different from false [2022-02-20 23:46:25,560 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse0 (select v_arrayElimArr_1 4))) (or (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse0) 0) 0) (not (= .cse0 |c_ULTIMATE.start_main_~item~0#1.base|)) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse0)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0)))) is different from false [2022-02-20 23:46:25,564 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse2 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= (select .cse0 0) 0) (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (select v_arrayElimArr_1 4))) (or (not (= (select v_arrayElimArr_1 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|)) |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse1) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse1)))) (= 0 (select .cse2 0)) (= |c_ULTIMATE.start_main_~item~0#1.offset| 0) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_arrayElimCell_16 Int) (v_ArrVal_422 (Array Int Int))) (let ((.cse3 (= (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|) 4))) (let ((.cse5 (not .cse3)) (.cse4 (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422))) (or (and (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) .cse3) (and (= (select (select .cse4 |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0) .cse3) (and (= |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimCell_16) .cse5) (and .cse5 (= (select (select .cse4 v_arrayElimCell_16) 0) 0)))))) (or (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (and (= (select .cse0 |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select .cse2 |c_ULTIMATE.start_main_~item~0#1.offset|) 0))))) is different from false [2022-02-20 23:46:25,843 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse2 (= (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0)) (.cse0 (= |c_ULTIMATE.start_main_~item~0#1.offset| 0))) (and (or (= |c_ULTIMATE.start_main_~item~0#1.base| |c_ULTIMATE.start_main_~data~0#1.base|) (not .cse0) (and .cse1 .cse2)) .cse1 (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|) (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4)))) (or (= .cse3 |c_ULTIMATE.start_main_~data~0#1.base|) (and (= (select (select |c_#memory_$Pointer$.offset| .cse3) 0) 0) (= (select (select |c_#memory_$Pointer$.base| .cse3) 0) 0)))) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (forall ((v_arrayElimArr_1 (Array Int Int)) (|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_418 Int)) (let ((.cse4 (select v_arrayElimArr_1 4))) (or (not (= .cse4 |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_418)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse4) 0) 0) (= |ULTIMATE.start_main_~lItem~0#1.base| .cse4)))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_415 Int) (v_ArrVal_422 (Array Int Int))) (or (= |ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|) (= (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4) v_ArrVal_415)) |ULTIMATE.start_main_~lItem~0#1.base| v_ArrVal_422) |c_ULTIMATE.start_main_~item~0#1.base|) 0) 0))) .cse2 .cse0)) is different from false [2022-02-20 23:46:27,722 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,722 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2022-02-20 23:46:27,722 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2022-02-20 23:46:27,723 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 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 32 [2022-02-20 23:46:27,723 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:27,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-02-20 23:46:27,724 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,725 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 164 transitions. [2022-02-20 23:46:27,725 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 23 states and 164 transitions. [2022-02-20 23:46:27,872 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:46:27,875 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:46:27,875 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:46:27,876 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 43 SyntacticMatches, 2 SemanticMatches, 53 ConstructedPredicates, 7 IntricatePredicates, 0 DeprecatedPredicates, 738 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=281, Invalid=1991, Unknown=12, NotChecked=686, Total=2970 [2022-02-20 23:46:27,876 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 129 mSDsluCounter, 1292 mSDsCounter, 0 mSdLazyCounter, 728 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 1390 SdHoareTripleChecker+Invalid, 1453 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 728 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 700 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:27,877 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 1390 Invalid, 1453 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 728 Invalid, 0 Unknown, 700 Unchecked, 0.6s Time] [2022-02-20 23:46:27,877 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:46:27,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 186. [2022-02-20 23:46:27,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:27,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,880 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,880 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,884 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2022-02-20 23:46:27,884 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2022-02-20 23:46:27,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:27,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:27,885 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:46:27,886 INFO L87 Difference]: Start difference. First operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 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 209 states. [2022-02-20 23:46:27,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:27,890 INFO L93 Difference]: Finished difference Result 209 states and 261 transitions. [2022-02-20 23:46:27,890 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 261 transitions. [2022-02-20 23:46:27,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:27,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:27,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:27,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:27,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 148 states have (on average 1.6013513513513513) internal successors, (237), 185 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,894 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 237 transitions. [2022-02-20 23:46:27,894 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 237 transitions. Word has length 32 [2022-02-20 23:46:27,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:27,894 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 237 transitions. [2022-02-20 23:46:27,895 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.7560975609756098) internal successors, (72), 41 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:27,895 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 237 transitions. [2022-02-20 23:46:27,895 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:46:27,895 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:27,896 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, 1, 1] [2022-02-20 23:46:27,926 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:28,111 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:46:28,111 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:28,112 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:28,112 INFO L85 PathProgramCache]: Analyzing trace with hash 1489307653, now seen corresponding path program 1 times [2022-02-20 23:46:28,112 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:28,112 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [720155647] [2022-02-20 23:46:28,112 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:28,113 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:28,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:28,187 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:46:28,188 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1402) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.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.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) 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:46:28,196 INFO L158 Benchmark]: Toolchain (without parser) took 24596.95ms. Allocated memory was 94.4MB in the beginning and 142.6MB in the end (delta: 48.2MB). Free memory was 72.6MB in the beginning and 114.3MB in the end (delta: -41.7MB). Peak memory consumption was 84.4MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,196 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:46:28,196 INFO L158 Benchmark]: CACSL2BoogieTranslator took 399.26ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 83.1MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,197 INFO L158 Benchmark]: Boogie Procedure Inliner took 77.08ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 80.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,197 INFO L158 Benchmark]: Boogie Preprocessor took 45.01ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,197 INFO L158 Benchmark]: RCFGBuilder took 652.71ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 89.6MB in the end (delta: -11.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,197 INFO L158 Benchmark]: TraceAbstraction took 23417.51ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.0MB in the beginning and 114.3MB in the end (delta: -25.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. [2022-02-20 23:46:28,198 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.19ms. Allocated memory is still 94.4MB. Free memory is still 51.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 399.26ms. Allocated memory was 94.4MB in the beginning and 117.4MB in the end (delta: 23.1MB). Free memory was 72.3MB in the beginning and 83.1MB in the end (delta: -10.8MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 77.08ms. Allocated memory is still 117.4MB. Free memory was 83.1MB in the beginning and 80.7MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 45.01ms. Allocated memory is still 117.4MB. Free memory was 80.7MB in the beginning and 78.2MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 652.71ms. Allocated memory is still 117.4MB. Free memory was 78.2MB in the beginning and 89.6MB in the end (delta: -11.4MB). Peak memory consumption was 28.9MB. Max. memory is 16.1GB. * TraceAbstraction took 23417.51ms. Allocated memory was 117.4MB in the beginning and 142.6MB in the end (delta: 25.2MB). Free memory was 89.0MB in the beginning and 114.3MB in the end (delta: -25.4MB). Peak memory consumption was 80.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:46:28,218 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/memsafety/test-0513.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:30,120 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:30,122 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:30,159 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:30,159 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:30,162 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:30,164 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:30,173 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:30,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:30,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:30,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:30,185 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:30,186 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:30,188 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:30,190 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:30,193 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:30,194 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:30,195 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:30,197 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:30,203 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:30,204 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:30,205 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:30,207 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:30,208 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:30,214 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:30,215 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:30,215 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:30,217 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:30,217 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:30,218 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:30,218 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:30,219 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:30,220 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:30,221 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:30,222 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:30,222 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:30,223 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:30,223 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:30,224 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:30,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:30,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:30,230 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:46:30,266 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:30,267 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:30,268 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:30,268 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:30,269 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:30,269 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:30,270 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:30,271 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:30,271 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:30,271 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:30,272 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:30,272 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:30,272 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:30,272 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:30,273 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:30,274 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:46:30,274 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:46:30,274 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:30,274 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:30,274 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:30,275 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:30,287 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:30,287 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:30,288 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:30,288 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:30,288 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:46:30,288 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:46:30,289 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:46:30,289 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> aaec9a71c2206d3d9fbfa56b3c6172e3ff60aad385f0ad346fdbde53f8ce1a2e [2022-02-20 23:46:30,603 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:30,621 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:30,624 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:30,625 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:30,626 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:30,627 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0513.i [2022-02-20 23:46:30,709 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5b96b96/41e1f5745c0f4264a77f1918aa8c53eb/FLAG6b37939f2 [2022-02-20 23:46:31,259 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:31,260 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0513.i [2022-02-20 23:46:31,269 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5b96b96/41e1f5745c0f4264a77f1918aa8c53eb/FLAG6b37939f2 [2022-02-20 23:46:31,665 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/5b5b96b96/41e1f5745c0f4264a77f1918aa8c53eb [2022-02-20 23:46:31,668 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:31,670 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:31,671 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:31,671 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:31,681 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:31,682 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:31" (1/1) ... [2022-02-20 23:46:31,683 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6d808a04 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:31, skipping insertion in model container [2022-02-20 23:46:31,684 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:31" (1/1) ... [2022-02-20 23:46:31,690 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:31,720 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:32,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:32,036 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:32,085 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:32,133 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:32,134 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32 WrapperNode [2022-02-20 23:46:32,135 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:32,136 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:32,137 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:32,137 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:32,144 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:46:32" (1/1) ... [2022-02-20 23:46:32,168 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:46:32" (1/1) ... [2022-02-20 23:46:32,216 INFO L137 Inliner]: procedures = 126, calls = 37, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 123 [2022-02-20 23:46:32,216 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:32,217 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:32,217 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:32,217 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:32,226 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,226 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,246 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,263 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,266 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,273 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:32,274 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:32,274 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:32,274 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:32,275 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (1/1) ... [2022-02-20 23:46:32,290 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:32,301 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:32,312 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:46:32,314 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:46:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:46:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:32,341 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:46:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:46:32,342 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:32,342 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:32,489 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:32,490 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:33,113 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:33,123 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:33,123 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:46:33,126 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:33 BoogieIcfgContainer [2022-02-20 23:46:33,126 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:33,127 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:33,127 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:33,130 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:33,130 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:31" (1/3) ... [2022-02-20 23:46:33,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abd48f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:33, skipping insertion in model container [2022-02-20 23:46:33,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:32" (2/3) ... [2022-02-20 23:46:33,131 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1abd48f7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:33, skipping insertion in model container [2022-02-20 23:46:33,131 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:33" (3/3) ... [2022-02-20 23:46:33,135 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513.i [2022-02-20 23:46:33,141 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:33,142 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2022-02-20 23:46:33,194 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:33,201 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:46:33,202 INFO L340 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2022-02-20 23:46:33,224 INFO L276 IsEmpty]: Start isEmpty. Operand has 130 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 129 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,229 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:33,229 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:33,230 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:33,231 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:33,235 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:33,236 INFO L85 PathProgramCache]: Analyzing trace with hash 28738657, now seen corresponding path program 1 times [2022-02-20 23:46:33,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:33,247 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [586354594] [2022-02-20 23:46:33,248 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:33,248 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:33,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:33,253 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:46:33,279 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:46:33,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:33,324 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:46:33,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:33,355 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:33,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {133#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(12bv32, 2bv32); {133#true} is VALID [2022-02-20 23:46:33,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {133#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {133#true} is VALID [2022-02-20 23:46:33,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {133#true} assume !true; {134#false} is VALID [2022-02-20 23:46:33,400 INFO L290 TraceCheckUtils]: 3: Hoare triple {134#false} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {134#false} is VALID [2022-02-20 23:46:33,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {134#false} assume !(#valid == main_old_#valid#1); {134#false} is VALID [2022-02-20 23:46:33,401 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:46:33,402 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:33,402 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:33,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [586354594] [2022-02-20 23:46:33,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [586354594] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:33,404 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:33,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:33,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488265065] [2022-02-20 23:46:33,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:33,413 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:33,414 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:33,416 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,426 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:33,427 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:46:33,427 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:33,449 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:46:33,450 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:33,456 INFO L87 Difference]: Start difference. First operand has 130 states, 67 states have (on average 2.1343283582089554) internal successors, (143), 129 states have internal predecessors, (143), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:33,724 INFO L93 Difference]: Finished difference Result 130 states and 138 transitions. [2022-02-20 23:46:33,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:46:33,724 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:33,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:33,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2022-02-20 23:46:33,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 143 transitions. [2022-02-20 23:46:33,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 143 transitions. [2022-02-20 23:46:33,946 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 143 edges. 143 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:33,958 INFO L225 Difference]: With dead ends: 130 [2022-02-20 23:46:33,959 INFO L226 Difference]: Without dead ends: 128 [2022-02-20 23:46:33,960 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:46:33,964 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 138 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:33,965 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:33,980 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2022-02-20 23:46:33,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 128. [2022-02-20 23:46:33,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:33,994 INFO L82 GeneralOperation]: Start isEquivalent. First operand 128 states. Second operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,995 INFO L74 IsIncluded]: Start isIncluded. First operand 128 states. Second operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:33,996 INFO L87 Difference]: Start difference. First operand 128 states. Second operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:34,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:34,002 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2022-02-20 23:46:34,002 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-02-20 23:46:34,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:34,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:34,011 INFO L74 IsIncluded]: Start isIncluded. First operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:46:34,013 INFO L87 Difference]: Start difference. First operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 128 states. [2022-02-20 23:46:34,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:34,022 INFO L93 Difference]: Finished difference Result 128 states and 136 transitions. [2022-02-20 23:46:34,023 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-02-20 23:46:34,024 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:34,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:34,025 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:34,025 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:34,026 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 128 states, 66 states have (on average 2.0606060606060606) internal successors, (136), 127 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:34,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 128 states to 128 states and 136 transitions. [2022-02-20 23:46:34,036 INFO L78 Accepts]: Start accepts. Automaton has 128 states and 136 transitions. Word has length 5 [2022-02-20 23:46:34,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:34,038 INFO L470 AbstractCegarLoop]: Abstraction has 128 states and 136 transitions. [2022-02-20 23:46:34,038 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 2.5) internal successors, (5), 2 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:34,039 INFO L276 IsEmpty]: Start isEmpty. Operand 128 states and 136 transitions. [2022-02-20 23:46:34,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:34,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:34,040 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:34,055 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:34,255 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:46:34,256 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:34,256 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:34,256 INFO L85 PathProgramCache]: Analyzing trace with hash 28699256, now seen corresponding path program 1 times [2022-02-20 23:46:34,257 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:34,257 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [936851240] [2022-02-20 23:46:34,257 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:34,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:34,258 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:34,259 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:46:34,262 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:46:34,309 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,310 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:46:34,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:34,321 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:34,342 INFO L290 TraceCheckUtils]: 0: Hoare triple {663#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(12bv32, 2bv32); {663#true} is VALID [2022-02-20 23:46:34,343 INFO L290 TraceCheckUtils]: 1: Hoare triple {663#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:34,344 INFO L290 TraceCheckUtils]: 2: Hoare triple {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:34,344 INFO L290 TraceCheckUtils]: 3: Hoare triple {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:46:34,345 INFO L290 TraceCheckUtils]: 4: Hoare triple {671#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {664#false} is VALID [2022-02-20 23:46:34,345 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:46:34,345 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:34,346 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:34,346 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [936851240] [2022-02-20 23:46:34,346 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [936851240] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:34,347 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:34,347 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:34,347 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198837513] [2022-02-20 23:46:34,347 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:34,348 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:34,348 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:34,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:34,354 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:34,354 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:34,357 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:34,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:34,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:34,359 INFO L87 Difference]: Start difference. First operand 128 states and 136 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:34,996 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:34,996 INFO L93 Difference]: Finished difference Result 173 states and 183 transitions. [2022-02-20 23:46:34,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:34,997 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:34,997 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:34,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:46:35,000 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 184 transitions. [2022-02-20 23:46:35,003 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 184 transitions. [2022-02-20 23:46:35,245 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:46:35,249 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:46:35,249 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:46:35,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:35,250 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 42 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 83 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:35,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [42 Valid, 188 Invalid, 83 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:35,252 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:46:35,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 130. [2022-02-20 23:46:35,257 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:35,257 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,258 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,258 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:35,264 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-02-20 23:46:35,264 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2022-02-20 23:46:35,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:35,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:35,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:46:35,266 INFO L87 Difference]: Start difference. First operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 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 172 states. [2022-02-20 23:46:35,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:35,272 INFO L93 Difference]: Finished difference Result 172 states and 182 transitions. [2022-02-20 23:46:35,272 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 182 transitions. [2022-02-20 23:46:35,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:35,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:35,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:35,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:35,274 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 68 states have (on average 2.0441176470588234) internal successors, (139), 129 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 139 transitions. [2022-02-20 23:46:35,278 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 139 transitions. Word has length 5 [2022-02-20 23:46:35,278 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:35,278 INFO L470 AbstractCegarLoop]: Abstraction has 130 states and 139 transitions. [2022-02-20 23:46:35,279 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,279 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 139 transitions. [2022-02-20 23:46:35,279 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:35,279 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:35,280 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:35,294 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:35,488 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:46:35,488 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:35,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:35,489 INFO L85 PathProgramCache]: Analyzing trace with hash 28699180, now seen corresponding path program 1 times [2022-02-20 23:46:35,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:35,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [174606840] [2022-02-20 23:46:35,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:35,490 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:35,490 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:35,491 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:46:35,495 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:46:35,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:35,530 INFO L263 TraceCheckSpWp]: Trace formula consists of 19 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:35,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:35,539 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:35,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {1327#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(12bv32, 2bv32); {1327#true} is VALID [2022-02-20 23:46:35,574 INFO L290 TraceCheckUtils]: 1: Hoare triple {1327#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {1335#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:35,575 INFO L290 TraceCheckUtils]: 2: Hoare triple {1335#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {1335#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:35,575 INFO L290 TraceCheckUtils]: 3: Hoare triple {1335#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {1328#false} is VALID [2022-02-20 23:46:35,575 INFO L290 TraceCheckUtils]: 4: Hoare triple {1328#false} assume !(1bv1 == #valid[main_~data~0#1.base]); {1328#false} is VALID [2022-02-20 23:46:35,576 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:46:35,580 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:35,581 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:35,581 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [174606840] [2022-02-20 23:46:35,581 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [174606840] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:35,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:35,582 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:35,582 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [275540249] [2022-02-20 23:46:35,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:35,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:35,585 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:35,585 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:35,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:35,590 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:35,590 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:35,591 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:35,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:35,594 INFO L87 Difference]: Start difference. First operand 130 states and 139 transitions. Second operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:36,080 INFO L93 Difference]: Finished difference Result 141 states and 148 transitions. [2022-02-20 23:46:36,080 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:36,080 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:36,080 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:36,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:46:36,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,085 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:46:36,085 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-20 23:46:36,246 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:36,248 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:46:36,248 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:46:36,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:36,250 INFO L933 BasicCegarLoop]: 135 mSDtfsCounter, 14 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:36,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 225 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:36,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:46:36,256 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 134. [2022-02-20 23:46:36,256 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:36,256 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,257 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,257 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,260 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:36,260 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2022-02-20 23:46:36,260 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2022-02-20 23:46:36,261 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:36,261 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:36,261 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:46:36,262 INFO L87 Difference]: Start difference. First operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 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 140 states. [2022-02-20 23:46:36,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:36,265 INFO L93 Difference]: Finished difference Result 140 states and 147 transitions. [2022-02-20 23:46:36,265 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 147 transitions. [2022-02-20 23:46:36,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:36,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:36,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:36,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:36,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 72 states have (on average 2.0277777777777777) internal successors, (146), 133 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 146 transitions. [2022-02-20 23:46:36,270 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 146 transitions. Word has length 5 [2022-02-20 23:46:36,270 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:36,270 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 146 transitions. [2022-02-20 23:46:36,270 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 1.6666666666666667) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 146 transitions. [2022-02-20 23:46:36,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:36,271 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:36,271 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:36,285 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:36,479 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:46:36,480 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:36,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:36,480 INFO L85 PathProgramCache]: Analyzing trace with hash 28699819, now seen corresponding path program 1 times [2022-02-20 23:46:36,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:36,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1642788959] [2022-02-20 23:46:36,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:36,481 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:36,481 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:36,482 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:46:36,484 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:46:36,528 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:36,529 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:36,541 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:36,595 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:46:36,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {1899#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(12bv32, 2bv32); {1899#true} is VALID [2022-02-20 23:46:36,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {1899#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {1899#true} is VALID [2022-02-20 23:46:36,606 INFO L290 TraceCheckUtils]: 2: Hoare triple {1899#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {1910#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:36,607 INFO L290 TraceCheckUtils]: 3: Hoare triple {1910#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {1910#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:36,607 INFO L290 TraceCheckUtils]: 4: Hoare triple {1910#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~item~0#1.base]); {1900#false} is VALID [2022-02-20 23:46:36,607 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:36,607 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:36,607 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:36,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1642788959] [2022-02-20 23:46:36,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1642788959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:36,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:36,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:36,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081158451] [2022-02-20 23:46:36,608 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:36,609 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:36,609 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:36,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:36,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:36,615 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:36,615 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:36,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:36,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:36,616 INFO L87 Difference]: Start difference. First operand 134 states and 146 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,215 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:37,215 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:46:37,215 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:37,215 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:37,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:37,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-20 23:46:37,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,219 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 175 transitions. [2022-02-20 23:46:37,220 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 175 transitions. [2022-02-20 23:46:37,402 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 175 edges. 175 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:37,405 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:46:37,405 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:46:37,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:37,406 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 74 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 74 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:37,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [74 Valid, 164 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:37,407 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:46:37,412 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 135. [2022-02-20 23:46:37,412 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:37,413 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,413 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,413 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:37,417 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:46:37,417 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:46:37,418 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:37,418 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:37,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:46:37,419 INFO L87 Difference]: Start difference. First operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:46:37,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:37,423 INFO L93 Difference]: Finished difference Result 165 states and 179 transitions. [2022-02-20 23:46:37,423 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 179 transitions. [2022-02-20 23:46:37,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:37,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:37,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:37,424 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:37,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 135 states, 76 states have (on average 1.9605263157894737) internal successors, (149), 134 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 135 states to 135 states and 149 transitions. [2022-02-20 23:46:37,427 INFO L78 Accepts]: Start accepts. Automaton has 135 states and 149 transitions. Word has length 5 [2022-02-20 23:46:37,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:37,427 INFO L470 AbstractCegarLoop]: Abstraction has 135 states and 149 transitions. [2022-02-20 23:46:37,428 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,428 INFO L276 IsEmpty]: Start isEmpty. Operand 135 states and 149 transitions. [2022-02-20 23:46:37,428 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:46:37,428 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:37,428 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:46:37,437 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:46:37,635 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:46:37,636 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:37,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:37,636 INFO L85 PathProgramCache]: Analyzing trace with hash 28699820, now seen corresponding path program 1 times [2022-02-20 23:46:37,637 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:37,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [147066113] [2022-02-20 23:46:37,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:37,637 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:37,637 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:37,639 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:46:37,641 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:46:37,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:37,678 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:46:37,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:37,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:37,700 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:46:37,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {2546#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(12bv32, 2bv32); {2546#true} is VALID [2022-02-20 23:46:37,719 INFO L290 TraceCheckUtils]: 1: Hoare triple {2546#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {2546#true} is VALID [2022-02-20 23:46:37,721 INFO L290 TraceCheckUtils]: 2: Hoare triple {2546#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {2557#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:37,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {2557#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {2557#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:37,722 INFO L290 TraceCheckUtils]: 4: Hoare triple {2557#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~item~0#1.offset), #length[main_~item~0#1.base]) && ~bvule32(main_~item~0#1.offset, ~bvadd32(4bv32, main_~item~0#1.offset))) && ~bvule32(0bv32, main_~item~0#1.offset)); {2547#false} is VALID [2022-02-20 23:46:37,722 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:37,722 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:37,722 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:37,722 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [147066113] [2022-02-20 23:46:37,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [147066113] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:37,723 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:37,723 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:37,723 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650101975] [2022-02-20 23:46:37,723 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:37,723 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:37,724 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:37,724 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:37,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 5 edges. 5 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:37,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:37,730 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:37,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:37,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:37,731 INFO L87 Difference]: Start difference. First operand 135 states and 149 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,256 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:38,256 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:38,256 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:38,257 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 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 5 [2022-02-20 23:46:38,257 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:38,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:46:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 133 transitions. [2022-02-20 23:46:38,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 133 transitions. [2022-02-20 23:46:38,384 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:38,386 INFO L225 Difference]: With dead ends: 133 [2022-02-20 23:46:38,386 INFO L226 Difference]: Without dead ends: 133 [2022-02-20 23:46:38,387 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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:46:38,387 INFO L933 BasicCegarLoop]: 117 mSDtfsCounter, 21 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 170 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:38,388 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [21 Valid, 170 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:38,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2022-02-20 23:46:38,392 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 133. [2022-02-20 23:46:38,392 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:38,393 INFO L82 GeneralOperation]: Start isEquivalent. First operand 133 states. Second operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,393 INFO L74 IsIncluded]: Start isIncluded. First operand 133 states. Second operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,393 INFO L87 Difference]: Start difference. First operand 133 states. Second operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:38,396 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:38,396 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:38,397 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:38,397 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:38,397 INFO L74 IsIncluded]: Start isIncluded. First operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 133 states. [2022-02-20 23:46:38,398 INFO L87 Difference]: Start difference. First operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 133 states. [2022-02-20 23:46:38,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:38,401 INFO L93 Difference]: Finished difference Result 133 states and 145 transitions. [2022-02-20 23:46:38,401 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:38,401 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:38,401 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:38,401 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:38,401 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:38,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 76 states have (on average 1.9078947368421053) internal successors, (145), 132 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 145 transitions. [2022-02-20 23:46:38,405 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 145 transitions. Word has length 5 [2022-02-20 23:46:38,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:38,405 INFO L470 AbstractCegarLoop]: Abstraction has 133 states and 145 transitions. [2022-02-20 23:46:38,405 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:38,405 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 145 transitions. [2022-02-20 23:46:38,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:46:38,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:38,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:38,411 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:46:38,606 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:46:38,606 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:38,607 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:38,607 INFO L85 PathProgramCache]: Analyzing trace with hash 642085487, now seen corresponding path program 1 times [2022-02-20 23:46:38,607 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:38,607 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [226940385] [2022-02-20 23:46:38,607 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:38,607 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:38,607 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:38,608 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:46:38,609 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:46:38,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:38,660 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:38,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:38,670 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:38,693 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:46:38,707 INFO L290 TraceCheckUtils]: 0: Hoare triple {3095#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(12bv32, 2bv32); {3095#true} is VALID [2022-02-20 23:46:38,707 INFO L290 TraceCheckUtils]: 1: Hoare triple {3095#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {3095#true} is VALID [2022-02-20 23:46:38,707 INFO L290 TraceCheckUtils]: 2: Hoare triple {3095#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3095#true} is VALID [2022-02-20 23:46:38,707 INFO L290 TraceCheckUtils]: 3: Hoare triple {3095#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {3095#true} is VALID [2022-02-20 23:46:38,708 INFO L290 TraceCheckUtils]: 4: Hoare triple {3095#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {3095#true} is VALID [2022-02-20 23:46:38,708 INFO L290 TraceCheckUtils]: 5: Hoare triple {3095#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {3095#true} is VALID [2022-02-20 23:46:38,709 INFO L290 TraceCheckUtils]: 6: Hoare triple {3095#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3118#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:38,710 INFO L290 TraceCheckUtils]: 7: Hoare triple {3118#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {3118#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:38,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {3118#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~lItem~0#1.base]); {3096#false} is VALID [2022-02-20 23:46:38,710 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:46:38,710 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:38,711 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:38,711 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [226940385] [2022-02-20 23:46:38,711 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [226940385] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:38,711 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:38,711 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:38,711 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1258883402] [2022-02-20 23:46:38,712 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:38,712 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:38,712 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:38,712 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:38,723 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:46:38,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:38,724 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:38,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:38,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:38,725 INFO L87 Difference]: Start difference. First operand 133 states and 145 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,194 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-02-20 23:46:39,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:39,194 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 23:46:39,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,199 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-20 23:46:39,199 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2022-02-20 23:46:39,343 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:39,345 INFO L225 Difference]: With dead ends: 129 [2022-02-20 23:46:39,345 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:46:39,345 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:46:39,346 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 23 mSDsluCounter, 53 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:39,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 164 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:39,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:46:39,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 129. [2022-02-20 23:46:39,350 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:39,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,351 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,351 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,354 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-02-20 23:46:39,354 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-02-20 23:46:39,354 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,354 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,354 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 129 states. [2022-02-20 23:46:39,363 INFO L87 Difference]: Start difference. First operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 129 states. [2022-02-20 23:46:39,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:39,366 INFO L93 Difference]: Finished difference Result 129 states and 141 transitions. [2022-02-20 23:46:39,367 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-02-20 23:46:39,367 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:39,367 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:39,367 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:39,367 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:39,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 76 states have (on average 1.855263157894737) internal successors, (141), 128 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:39,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 141 transitions. [2022-02-20 23:46:39,370 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 141 transitions. Word has length 9 [2022-02-20 23:46:39,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:39,370 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 141 transitions. [2022-02-20 23:46:39,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,371 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 141 transitions. [2022-02-20 23:46:39,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:46:39,371 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:39,371 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:39,384 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:46:39,579 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:46:39,580 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:39,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:39,580 INFO L85 PathProgramCache]: Analyzing trace with hash 642085488, now seen corresponding path program 1 times [2022-02-20 23:46:39,581 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:39,581 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1323945862] [2022-02-20 23:46:39,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:39,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:39,581 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:39,582 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:46:39,583 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:46:39,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,641 INFO L263 TraceCheckSpWp]: Trace formula consists of 63 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:46:39,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:39,649 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:39,670 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:46:39,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {3640#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(12bv32, 2bv32); {3640#true} is VALID [2022-02-20 23:46:39,696 INFO L290 TraceCheckUtils]: 1: Hoare triple {3640#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {3640#true} is VALID [2022-02-20 23:46:39,696 INFO L290 TraceCheckUtils]: 2: Hoare triple {3640#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {3640#true} is VALID [2022-02-20 23:46:39,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {3640#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {3640#true} is VALID [2022-02-20 23:46:39,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {3640#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {3640#true} is VALID [2022-02-20 23:46:39,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {3640#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {3640#true} is VALID [2022-02-20 23:46:39,697 INFO L290 TraceCheckUtils]: 6: Hoare triple {3640#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3663#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:39,698 INFO L290 TraceCheckUtils]: 7: Hoare triple {3663#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {3663#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:39,698 INFO L290 TraceCheckUtils]: 8: Hoare triple {3663#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~lItem~0#1.offset), #length[main_~lItem~0#1.base]) && ~bvule32(main_~lItem~0#1.offset, ~bvadd32(4bv32, main_~lItem~0#1.offset))) && ~bvule32(0bv32, main_~lItem~0#1.offset)); {3641#false} is VALID [2022-02-20 23:46:39,698 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:46:39,698 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:39,698 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:39,698 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1323945862] [2022-02-20 23:46:39,698 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1323945862] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:39,698 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:39,699 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:39,699 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [760105541] [2022-02-20 23:46:39,699 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:39,699 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,699 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:39,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:39,710 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:46:39,711 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:39,711 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:39,711 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:39,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:39,712 INFO L87 Difference]: Start difference. First operand 129 states and 141 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:40,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:40,150 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:46:40,150 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:40,151 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:40,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:40,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:40,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:46:40,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:40,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:46:40,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 23:46:40,263 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:40,268 INFO L225 Difference]: With dead ends: 126 [2022-02-20 23:46:40,269 INFO L226 Difference]: Without dead ends: 126 [2022-02-20 23:46:40,269 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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:46:40,271 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 12 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:40,272 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 175 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:40,272 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2022-02-20 23:46:40,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2022-02-20 23:46:40,276 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:40,276 INFO L82 GeneralOperation]: Start isEquivalent. First operand 126 states. Second operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:40,276 INFO L74 IsIncluded]: Start isIncluded. First operand 126 states. Second operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:40,277 INFO L87 Difference]: Start difference. First operand 126 states. Second operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:40,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:40,279 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:46:40,279 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:46:40,280 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:40,280 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:40,280 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 126 states. [2022-02-20 23:46:40,281 INFO L87 Difference]: Start difference. First operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 126 states. [2022-02-20 23:46:40,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:40,283 INFO L93 Difference]: Finished difference Result 126 states and 138 transitions. [2022-02-20 23:46:40,283 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:46:40,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:40,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:40,284 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:40,284 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:40,285 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 125 states have internal predecessors, (138), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:40,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 138 transitions. [2022-02-20 23:46:40,287 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 138 transitions. Word has length 9 [2022-02-20 23:46:40,287 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:40,288 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 138 transitions. [2022-02-20 23:46:40,288 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 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:46:40,288 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 138 transitions. [2022-02-20 23:46:40,288 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:40,288 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:40,288 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:40,303 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:46:40,497 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:46:40,497 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:40,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:40,498 INFO L85 PathProgramCache]: Analyzing trace with hash 734390075, now seen corresponding path program 1 times [2022-02-20 23:46:40,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:40,498 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1651215854] [2022-02-20 23:46:40,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:40,498 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:40,499 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:40,499 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:46:40,500 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:46:40,577 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:40,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:46:40,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:40,592 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:40,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {4173#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(12bv32, 2bv32); {4173#true} is VALID [2022-02-20 23:46:40,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {4173#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {4173#true} is VALID [2022-02-20 23:46:40,646 INFO L290 TraceCheckUtils]: 2: Hoare triple {4173#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {4173#true} is VALID [2022-02-20 23:46:40,646 INFO L290 TraceCheckUtils]: 3: Hoare triple {4173#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {4173#true} is VALID [2022-02-20 23:46:40,646 INFO L290 TraceCheckUtils]: 4: Hoare triple {4173#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {4173#true} is VALID [2022-02-20 23:46:40,646 INFO L290 TraceCheckUtils]: 5: Hoare triple {4173#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {4173#true} is VALID [2022-02-20 23:46:40,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {4173#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} is VALID [2022-02-20 23:46:40,650 INFO L290 TraceCheckUtils]: 7: Hoare triple {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} is VALID [2022-02-20 23:46:40,651 INFO L290 TraceCheckUtils]: 8: Hoare triple {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} is VALID [2022-02-20 23:46:40,651 INFO L290 TraceCheckUtils]: 9: Hoare triple {4196#(not (= (_ bv0 32) |ULTIMATE.start_main_~lItem~0#1.base|))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:40,652 INFO L290 TraceCheckUtils]: 10: Hoare triple {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:40,652 INFO L290 TraceCheckUtils]: 11: Hoare triple {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:40,653 INFO L290 TraceCheckUtils]: 12: Hoare triple {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:40,653 INFO L290 TraceCheckUtils]: 13: Hoare triple {4206#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {4174#false} is VALID [2022-02-20 23:46:40,653 INFO L290 TraceCheckUtils]: 14: Hoare triple {4174#false} assume !(#valid == main_old_#valid#1); {4174#false} is VALID [2022-02-20 23:46:40,654 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:40,654 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:40,654 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:40,654 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1651215854] [2022-02-20 23:46:40,654 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1651215854] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:40,654 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:40,654 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:40,654 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [918867790] [2022-02-20 23:46:40,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:40,655 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:40,655 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:40,655 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:40,672 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:46:40,672 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:40,672 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:40,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:40,673 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:40,674 INFO L87 Difference]: Start difference. First operand 126 states and 138 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:41,312 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2022-02-20 23:46:41,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:41,313 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:41,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:41,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2022-02-20 23:46:41,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 230 transitions. [2022-02-20 23:46:41,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 230 transitions. [2022-02-20 23:46:41,549 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:41,552 INFO L225 Difference]: With dead ends: 224 [2022-02-20 23:46:41,552 INFO L226 Difference]: Without dead ends: 224 [2022-02-20 23:46:41,552 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:46:41,552 INFO L933 BasicCegarLoop]: 88 mSDtfsCounter, 125 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 241 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 108 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:41,553 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [125 Valid, 241 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:41,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 224 states. [2022-02-20 23:46:41,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 224 to 126. [2022-02-20 23:46:41,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:41,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 224 states. Second operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,558 INFO L74 IsIncluded]: Start isIncluded. First operand 224 states. Second operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,558 INFO L87 Difference]: Start difference. First operand 224 states. Second operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,564 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:41,564 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2022-02-20 23:46:41,565 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 244 transitions. [2022-02-20 23:46:41,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:41,565 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:41,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2022-02-20 23:46:41,566 INFO L87 Difference]: Start difference. First operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 224 states. [2022-02-20 23:46:41,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:41,571 INFO L93 Difference]: Finished difference Result 224 states and 244 transitions. [2022-02-20 23:46:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 224 states and 244 transitions. [2022-02-20 23:46:41,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:41,572 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:41,572 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:41,572 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:41,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 76 states have (on average 1.7894736842105263) internal successors, (136), 125 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 136 transitions. [2022-02-20 23:46:41,591 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 136 transitions. Word has length 15 [2022-02-20 23:46:41,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:41,591 INFO L470 AbstractCegarLoop]: Abstraction has 126 states and 136 transitions. [2022-02-20 23:46:41,591 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,591 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 136 transitions. [2022-02-20 23:46:41,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:41,592 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:41,592 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:41,604 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:41,792 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:46:41,793 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:41,793 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:41,793 INFO L85 PathProgramCache]: Analyzing trace with hash 734389999, now seen corresponding path program 1 times [2022-02-20 23:46:41,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:41,794 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [246020340] [2022-02-20 23:46:41,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:41,794 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:41,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:41,795 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:46:41,796 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:46:41,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:41,864 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:46:41,875 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:41,876 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:41,900 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:46:41,940 INFO L290 TraceCheckUtils]: 0: Hoare triple {5021#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(12bv32, 2bv32); {5021#true} is VALID [2022-02-20 23:46:41,940 INFO L290 TraceCheckUtils]: 1: Hoare triple {5021#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {5021#true} is VALID [2022-02-20 23:46:41,940 INFO L290 TraceCheckUtils]: 2: Hoare triple {5021#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5021#true} is VALID [2022-02-20 23:46:41,940 INFO L290 TraceCheckUtils]: 3: Hoare triple {5021#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5021#true} is VALID [2022-02-20 23:46:41,940 INFO L290 TraceCheckUtils]: 4: Hoare triple {5021#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {5021#true} is VALID [2022-02-20 23:46:41,940 INFO L290 TraceCheckUtils]: 5: Hoare triple {5021#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {5021#true} is VALID [2022-02-20 23:46:41,941 INFO L290 TraceCheckUtils]: 6: Hoare triple {5021#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,941 INFO L290 TraceCheckUtils]: 7: Hoare triple {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,942 INFO L290 TraceCheckUtils]: 8: Hoare triple {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,942 INFO L290 TraceCheckUtils]: 9: Hoare triple {5044#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,942 INFO L290 TraceCheckUtils]: 10: Hoare triple {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,943 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,943 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,943 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:41,944 INFO L290 TraceCheckUtils]: 14: Hoare triple {5054#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~data~0#1.base]); {5022#false} is VALID [2022-02-20 23:46:41,944 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:41,944 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:41,944 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:41,944 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [246020340] [2022-02-20 23:46:41,944 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [246020340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:41,944 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:41,944 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:41,944 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895437314] [2022-02-20 23:46:41,944 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:41,945 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:41,945 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:41,945 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:41,966 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:46:41,966 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:41,966 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:41,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:41,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:41,967 INFO L87 Difference]: Start difference. First operand 126 states and 136 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,599 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-02-20 23:46:42,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:42,599 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:42,599 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:42,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 23:46:42,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,602 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 131 transitions. [2022-02-20 23:46:42,602 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 131 transitions. [2022-02-20 23:46:42,743 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:42,745 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:46:42,745 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:46:42,745 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:46:42,745 INFO L933 BasicCegarLoop]: 82 mSDtfsCounter, 59 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:42,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 158 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:42,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:46:42,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 119. [2022-02-20 23:46:42,748 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:42,748 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,748 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,749 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,750 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-02-20 23:46:42,751 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-02-20 23:46:42,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,751 INFO L74 IsIncluded]: Start isIncluded. First operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:46:42,752 INFO L87 Difference]: Start difference. First operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:46:42,753 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:42,754 INFO L93 Difference]: Finished difference Result 120 states and 130 transitions. [2022-02-20 23:46:42,754 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 130 transitions. [2022-02-20 23:46:42,754 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:42,754 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:42,754 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:42,754 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:42,755 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 77 states have (on average 1.6883116883116882) internal successors, (130), 118 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,756 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 130 transitions. [2022-02-20 23:46:42,756 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 130 transitions. Word has length 15 [2022-02-20 23:46:42,757 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:42,757 INFO L470 AbstractCegarLoop]: Abstraction has 119 states and 130 transitions. [2022-02-20 23:46:42,757 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:42,758 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 130 transitions. [2022-02-20 23:46:42,758 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:46:42,758 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:42,758 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:42,770 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:46:42,966 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:46:42,967 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:42,967 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:42,967 INFO L85 PathProgramCache]: Analyzing trace with hash 734390000, now seen corresponding path program 1 times [2022-02-20 23:46:42,967 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:42,967 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1250263325] [2022-02-20 23:46:42,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:42,968 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:42,968 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:42,969 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:46:42,970 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:46:43,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:43,029 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:46:43,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:43,040 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:43,065 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:46:43,166 INFO L290 TraceCheckUtils]: 0: Hoare triple {5550#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(12bv32, 2bv32); {5550#true} is VALID [2022-02-20 23:46:43,167 INFO L290 TraceCheckUtils]: 1: Hoare triple {5550#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {5550#true} is VALID [2022-02-20 23:46:43,167 INFO L290 TraceCheckUtils]: 2: Hoare triple {5550#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {5550#true} is VALID [2022-02-20 23:46:43,167 INFO L290 TraceCheckUtils]: 3: Hoare triple {5550#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5550#true} is VALID [2022-02-20 23:46:43,167 INFO L290 TraceCheckUtils]: 4: Hoare triple {5550#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {5550#true} is VALID [2022-02-20 23:46:43,167 INFO L290 TraceCheckUtils]: 5: Hoare triple {5550#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {5550#true} is VALID [2022-02-20 23:46:43,168 INFO L290 TraceCheckUtils]: 6: Hoare triple {5550#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:43,168 INFO L290 TraceCheckUtils]: 7: Hoare triple {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:43,169 INFO L290 TraceCheckUtils]: 8: Hoare triple {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:43,169 INFO L290 TraceCheckUtils]: 9: Hoare triple {5573#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:43,170 INFO L290 TraceCheckUtils]: 10: Hoare triple {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:43,170 INFO L290 TraceCheckUtils]: 11: Hoare triple {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:43,170 INFO L290 TraceCheckUtils]: 12: Hoare triple {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:43,171 INFO L290 TraceCheckUtils]: 13: Hoare triple {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:46:43,171 INFO L290 TraceCheckUtils]: 14: Hoare triple {5583#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~data~0#1.offset), #length[main_~data~0#1.base]) && ~bvule32(main_~data~0#1.offset, ~bvadd32(4bv32, main_~data~0#1.offset))) && ~bvule32(0bv32, main_~data~0#1.offset)); {5551#false} is VALID [2022-02-20 23:46:43,171 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:43,172 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:43,172 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:43,172 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1250263325] [2022-02-20 23:46:43,172 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1250263325] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:43,172 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:43,172 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:43,172 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [209137741] [2022-02-20 23:46:43,172 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:43,172 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:43,172 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:43,172 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:43,188 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:46:43,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:43,188 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:43,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:43,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:43,189 INFO L87 Difference]: Start difference. First operand 119 states and 130 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,051 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2022-02-20 23:46:44,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:44,051 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:46:44,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:44,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2022-02-20 23:46:44,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 213 transitions. [2022-02-20 23:46:44,054 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 213 transitions. [2022-02-20 23:46:44,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 213 edges. 213 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:44,275 INFO L225 Difference]: With dead ends: 200 [2022-02-20 23:46:44,275 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 23:46:44,276 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 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:46:44,276 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 99 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:44,276 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [99 Valid, 158 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:46:44,277 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 23:46:44,279 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 158. [2022-02-20 23:46:44,279 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:44,280 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,280 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,280 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,283 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,284 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2022-02-20 23:46:44,284 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2022-02-20 23:46:44,284 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:44,284 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:44,285 INFO L74 IsIncluded]: Start isIncluded. First operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:46:44,285 INFO L87 Difference]: Start difference. First operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 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 200 states. [2022-02-20 23:46:44,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:44,288 INFO L93 Difference]: Finished difference Result 200 states and 219 transitions. [2022-02-20 23:46:44,288 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 219 transitions. [2022-02-20 23:46:44,289 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:44,289 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:44,289 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:44,289 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:44,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 158 states, 118 states have (on average 1.7033898305084745) internal successors, (201), 157 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 158 states to 158 states and 201 transitions. [2022-02-20 23:46:44,292 INFO L78 Accepts]: Start accepts. Automaton has 158 states and 201 transitions. Word has length 15 [2022-02-20 23:46:44,292 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:44,292 INFO L470 AbstractCegarLoop]: Abstraction has 158 states and 201 transitions. [2022-02-20 23:46:44,292 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:44,292 INFO L276 IsEmpty]: Start isEmpty. Operand 158 states and 201 transitions. [2022-02-20 23:46:44,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:46:44,293 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:44,293 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:44,303 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:44,502 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:46:44,502 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:44,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:44,503 INFO L85 PathProgramCache]: Analyzing trace with hash 2081116792, now seen corresponding path program 1 times [2022-02-20 23:46:44,503 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:44,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1208949644] [2022-02-20 23:46:44,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:44,503 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:44,503 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:44,504 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:46:44,505 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:46:44,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:44,583 INFO L263 TraceCheckSpWp]: Trace formula consists of 114 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:46:44,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:44,595 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:45,211 INFO L290 TraceCheckUtils]: 0: Hoare triple {6358#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(12bv32, 2bv32); {6363#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:45,211 INFO L290 TraceCheckUtils]: 1: Hoare triple {6363#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {6363#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:45,214 INFO L290 TraceCheckUtils]: 2: Hoare triple {6363#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:46:45,214 INFO L290 TraceCheckUtils]: 3: Hoare triple {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:46:45,215 INFO L290 TraceCheckUtils]: 4: Hoare triple {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:46:45,215 INFO L290 TraceCheckUtils]: 5: Hoare triple {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:46:45,216 INFO L290 TraceCheckUtils]: 6: Hoare triple {6370#(exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:45,216 INFO L290 TraceCheckUtils]: 7: Hoare triple {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:45,219 INFO L290 TraceCheckUtils]: 8: Hoare triple {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:45,219 INFO L290 TraceCheckUtils]: 9: Hoare triple {6383#(and (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))) (bvult |ULTIMATE.start_main_~lItem~0#1.base| |#StackHeapBarrier|))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,220 INFO L290 TraceCheckUtils]: 10: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,221 INFO L290 TraceCheckUtils]: 12: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L556-3 {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,228 INFO L290 TraceCheckUtils]: 15: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,229 INFO L290 TraceCheckUtils]: 16: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, ~bvadd32(4bv32, main_~data~0#1.offset), 4bv32); srcloc: L556-4 {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,232 INFO L290 TraceCheckUtils]: 17: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} assume 0bv32 == main_~data~0#1.offset; {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:46:45,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {6393#(and (bvult |ULTIMATE.start_main_~data~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~item~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~item~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32))))))} assume !~bvult32(main_~data~0#1.base, #StackHeapBarrier); {6359#false} is VALID [2022-02-20 23:46:45,235 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:45,235 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:45,235 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:45,235 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1208949644] [2022-02-20 23:46:45,235 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1208949644] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:45,235 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:45,235 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:45,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1895749173] [2022-02-20 23:46:45,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:45,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:45,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:45,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:45,306 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:45,306 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:45,306 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:45,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:45,307 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:45,307 INFO L87 Difference]: Start difference. First operand 158 states and 201 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:45,844 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:45,844 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-02-20 23:46:45,844 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:45,844 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:45,844 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:45,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:45,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 23:46:45,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:45,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 151 transitions. [2022-02-20 23:46:45,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 151 transitions. [2022-02-20 23:46:46,065 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 151 edges. 151 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:46,067 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:46:46,067 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:46:46,068 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:46,068 INFO L933 BasicCegarLoop]: 115 mSDtfsCounter, 81 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 30 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:46,068 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [81 Valid, 274 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 30 Unchecked, 0.0s Time] [2022-02-20 23:46:46,069 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:46:46,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 168. [2022-02-20 23:46:46,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:46,072 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,072 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,072 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:46,076 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-02-20 23:46:46,076 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2022-02-20 23:46:46,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:46,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:46,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:46:46,077 INFO L87 Difference]: Start difference. First operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 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 187 states. [2022-02-20 23:46:46,080 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:46,080 INFO L93 Difference]: Finished difference Result 187 states and 232 transitions. [2022-02-20 23:46:46,080 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 232 transitions. [2022-02-20 23:46:46,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:46,081 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:46,081 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:46,081 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:46,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 128 states have (on average 1.6640625) internal successors, (213), 167 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 213 transitions. [2022-02-20 23:46:46,084 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 213 transitions. Word has length 20 [2022-02-20 23:46:46,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:46,084 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 213 transitions. [2022-02-20 23:46:46,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,084 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 213 transitions. [2022-02-20 23:46:46,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:46:46,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:46,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:46,094 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:46,294 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:46:46,294 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:46,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:46,294 INFO L85 PathProgramCache]: Analyzing trace with hash 2079977757, now seen corresponding path program 1 times [2022-02-20 23:46:46,295 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:46,295 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [704565539] [2022-02-20 23:46:46,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:46,295 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:46,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:46,296 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:46:46,297 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:46:46,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:46,403 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 23:46:46,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:46,425 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:46,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:46:46,470 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:46:46,558 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:46:46,558 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 21 treesize of output 20 [2022-02-20 23:46:46,651 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:46:46,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {7152#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(12bv32, 2bv32); {7152#true} is VALID [2022-02-20 23:46:46,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {7152#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {7152#true} is VALID [2022-02-20 23:46:46,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {7152#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7152#true} is VALID [2022-02-20 23:46:46,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {7152#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {7152#true} is VALID [2022-02-20 23:46:46,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {7152#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {7152#true} is VALID [2022-02-20 23:46:46,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {7152#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {7152#true} is VALID [2022-02-20 23:46:46,663 INFO L290 TraceCheckUtils]: 6: Hoare triple {7152#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7175#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:46,664 INFO L290 TraceCheckUtils]: 7: Hoare triple {7175#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {7175#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:46,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {7175#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {7182#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,676 INFO L290 TraceCheckUtils]: 9: Hoare triple {7182#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {7186#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,681 INFO L290 TraceCheckUtils]: 10: Hoare triple {7186#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,682 INFO L290 TraceCheckUtils]: 11: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,683 INFO L290 TraceCheckUtils]: 13: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,684 INFO L290 TraceCheckUtils]: 14: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L556-3 {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,685 INFO L290 TraceCheckUtils]: 15: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} assume !!(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,685 INFO L290 TraceCheckUtils]: 16: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, ~bvadd32(4bv32, main_~data~0#1.offset), 4bv32); srcloc: L557 {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,686 INFO L290 TraceCheckUtils]: 17: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:46,686 INFO L290 TraceCheckUtils]: 18: Hoare triple {7190#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) |ULTIMATE.start_main_~data~0#1.base|) (= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1)))} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L558 {7215#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:46,687 INFO L290 TraceCheckUtils]: 19: Hoare triple {7215#(= (select |#valid| |ULTIMATE.start_main_#t~mem10#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem10#1.base]); {7153#false} is VALID [2022-02-20 23:46:46,688 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:46,688 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:46,688 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:46,689 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [704565539] [2022-02-20 23:46:46,689 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [704565539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:46,689 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:46,689 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:46,689 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1404755090] [2022-02-20 23:46:46,689 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:46,690 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:46,690 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:46,690 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:46,712 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:46,712 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:46:46,713 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:46,713 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:46:46,714 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:46,714 INFO L87 Difference]: Start difference. First operand 168 states and 213 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:47,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:47,895 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2022-02-20 23:46:47,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:47,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:47,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:47,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2022-02-20 23:46:47,896 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:47,897 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 141 transitions. [2022-02-20 23:46:47,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 141 transitions. [2022-02-20 23:46:48,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 141 edges. 141 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:48,043 INFO L225 Difference]: With dead ends: 183 [2022-02-20 23:46:48,043 INFO L226 Difference]: Without dead ends: 183 [2022-02-20 23:46:48,043 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:48,044 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 33 mSDsluCounter, 153 mSDsCounter, 0 mSdLazyCounter, 216 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 225 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 216 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:48,044 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 242 Invalid, 225 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 216 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:46:48,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2022-02-20 23:46:48,047 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 172. [2022-02-20 23:46:48,047 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:48,048 INFO L82 GeneralOperation]: Start isEquivalent. First operand 183 states. Second operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,048 INFO L74 IsIncluded]: Start isIncluded. First operand 183 states. Second operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,049 INFO L87 Difference]: Start difference. First operand 183 states. Second operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,052 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2022-02-20 23:46:48,052 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2022-02-20 23:46:48,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,053 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 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 183 states. [2022-02-20 23:46:48,053 INFO L87 Difference]: Start difference. First operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 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 183 states. [2022-02-20 23:46:48,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:48,056 INFO L93 Difference]: Finished difference Result 183 states and 228 transitions. [2022-02-20 23:46:48,056 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 228 transitions. [2022-02-20 23:46:48,057 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:48,058 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:48,058 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:48,058 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:48,058 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 132 states have (on average 1.6515151515151516) internal successors, (218), 171 states have internal predecessors, (218), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,062 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 218 transitions. [2022-02-20 23:46:48,062 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 218 transitions. Word has length 20 [2022-02-20 23:46:48,062 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:48,062 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 218 transitions. [2022-02-20 23:46:48,063 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,063 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 218 transitions. [2022-02-20 23:46:48,063 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:46:48,063 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:48,063 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:48,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Ended with exit code 0 [2022-02-20 23:46:48,272 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:46:48,273 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:48,273 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:48,273 INFO L85 PathProgramCache]: Analyzing trace with hash 2079977758, now seen corresponding path program 1 times [2022-02-20 23:46:48,273 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:48,273 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1484124189] [2022-02-20 23:46:48,273 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:48,274 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:48,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:48,275 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:46:48,276 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:46:48,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,373 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 16 conjunts are in the unsatisfiable core [2022-02-20 23:46:48,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:48,385 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:48,418 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:46:48,432 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:46:48,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, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 23:46:48,516 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 19 treesize of output 18 [2022-02-20 23:46:48,584 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:46:48,585 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 15 treesize of output 10 [2022-02-20 23:46:48,594 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:46:48,594 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 15 treesize of output 10 [2022-02-20 23:46:48,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {7943#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(12bv32, 2bv32); {7943#true} is VALID [2022-02-20 23:46:48,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {7943#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {7943#true} is VALID [2022-02-20 23:46:48,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {7943#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {7943#true} is VALID [2022-02-20 23:46:48,620 INFO L290 TraceCheckUtils]: 3: Hoare triple {7943#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {7943#true} is VALID [2022-02-20 23:46:48,620 INFO L290 TraceCheckUtils]: 4: Hoare triple {7943#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {7943#true} is VALID [2022-02-20 23:46:48,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {7943#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {7943#true} is VALID [2022-02-20 23:46:48,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {7943#true} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7966#(= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:46:48,621 INFO L290 TraceCheckUtils]: 7: Hoare triple {7966#(= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {7966#(= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:46:48,622 INFO L290 TraceCheckUtils]: 8: Hoare triple {7966#(= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {7973#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:46:48,623 INFO L290 TraceCheckUtils]: 9: Hoare triple {7973#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {7977#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:46:48,626 INFO L290 TraceCheckUtils]: 10: Hoare triple {7977#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) |ULTIMATE.start_main_~lItem~0#1.offset|) |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:46:48,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:46:48,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:46:48,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} is VALID [2022-02-20 23:46:48,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {7981#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) |ULTIMATE.start_main_~data~0#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv0 32)) (_ bv0 32)))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L556-3 {7994#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~data~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|))} is VALID [2022-02-20 23:46:48,630 INFO L290 TraceCheckUtils]: 15: Hoare triple {7994#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem8#1.base| |ULTIMATE.start_main_~data~0#1.base|) (= (_ bv0 32) |ULTIMATE.start_main_#t~mem8#1.offset|))} assume !!(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {7944#false} is VALID [2022-02-20 23:46:48,630 INFO L290 TraceCheckUtils]: 16: Hoare triple {7944#false} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, ~bvadd32(4bv32, main_~data~0#1.offset), 4bv32); srcloc: L557 {7944#false} is VALID [2022-02-20 23:46:48,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {7944#false} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem9#1.base, main_#t~mem9#1.offset;havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {7944#false} is VALID [2022-02-20 23:46:48,631 INFO L290 TraceCheckUtils]: 18: Hoare triple {7944#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L558 {7944#false} is VALID [2022-02-20 23:46:48,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {7944#false} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset)), #length[main_#t~mem10#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem10#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem10#1.offset))); {7944#false} is VALID [2022-02-20 23:46:48,637 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:48,637 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:48,637 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:48,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1484124189] [2022-02-20 23:46:48,638 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1484124189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:48,638 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:48,638 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:48,638 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [654963987] [2022-02-20 23:46:48,638 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:48,639 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:48,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:48,641 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:48,668 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:48,668 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:46:48,668 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:48,669 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:46:48,669 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:48,669 INFO L87 Difference]: Start difference. First operand 172 states and 218 transitions. Second operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,102 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2022-02-20 23:46:50,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:50,102 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:50,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:50,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-02-20 23:46:50,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 147 transitions. [2022-02-20 23:46:50,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 147 transitions. [2022-02-20 23:46:50,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:50,279 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:46:50,279 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:46:50,279 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:50,280 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 146 mSDsluCounter, 283 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 387 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:50,280 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 387 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:46:50,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:46:50,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 168. [2022-02-20 23:46:50,283 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:50,283 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,283 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,283 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,286 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,286 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2022-02-20 23:46:50,286 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2022-02-20 23:46:50,287 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:50,287 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:50,287 INFO L74 IsIncluded]: Start isIncluded. First operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:46:50,288 INFO L87 Difference]: Start difference. First operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 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 185 states. [2022-02-20 23:46:50,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,291 INFO L93 Difference]: Finished difference Result 185 states and 229 transitions. [2022-02-20 23:46:50,291 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 229 transitions. [2022-02-20 23:46:50,291 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:50,291 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:50,291 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:50,291 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:50,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 128 states have (on average 1.65625) internal successors, (212), 167 states have internal predecessors, (212), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 212 transitions. [2022-02-20 23:46:50,294 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 212 transitions. Word has length 20 [2022-02-20 23:46:50,294 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:50,294 INFO L470 AbstractCegarLoop]: Abstraction has 168 states and 212 transitions. [2022-02-20 23:46:50,295 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.857142857142857) internal successors, (20), 7 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,295 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 212 transitions. [2022-02-20 23:46:50,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:46:50,295 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:50,295 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] [2022-02-20 23:46:50,309 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:50,510 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:46:50,510 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:50,511 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:50,511 INFO L85 PathProgramCache]: Analyzing trace with hash 697636568, now seen corresponding path program 1 times [2022-02-20 23:46:50,511 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:50,511 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [322997874] [2022-02-20 23:46:50,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:50,511 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:50,511 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:50,512 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:46:50,516 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:46:50,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:50,607 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:46:50,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:50,619 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:50,629 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:46:50,667 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:46:50,668 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:46:50,797 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:46:50,897 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 27 treesize of output 15 [2022-02-20 23:46:50,990 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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:46:51,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {8737#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(12bv32, 2bv32); {8737#true} is VALID [2022-02-20 23:46:51,006 INFO L290 TraceCheckUtils]: 1: Hoare triple {8737#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {8737#true} is VALID [2022-02-20 23:46:51,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {8737#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:51,010 INFO L290 TraceCheckUtils]: 7: Hoare triple {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:51,011 INFO L290 TraceCheckUtils]: 8: Hoare triple {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:51,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {8761#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {8771#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:51,014 INFO L290 TraceCheckUtils]: 10: Hoare triple {8771#(and (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,016 INFO L290 TraceCheckUtils]: 13: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,016 INFO L290 TraceCheckUtils]: 14: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L556-3 {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,017 INFO L290 TraceCheckUtils]: 15: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,018 INFO L290 TraceCheckUtils]: 16: Hoare triple {8775#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (_ bv1 1))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, ~bvadd32(4bv32, main_~data~0#1.offset), 4bv32); srcloc: L556-4 {8794#(and (not (= |ULTIMATE.start_main_#t~mem20#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:46:51,018 INFO L290 TraceCheckUtils]: 17: Hoare triple {8794#(and (not (= |ULTIMATE.start_main_#t~mem20#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) (_ bv1 1)) (_ bv0 1)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~data~0#1.offset; {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,024 INFO L290 TraceCheckUtils]: 19: Hoare triple {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} assume ~bvult32(main_~data~0#1.base, #StackHeapBarrier); {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:46:51,025 INFO L290 TraceCheckUtils]: 20: Hoare triple {8798#(and (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~data~0#1.base || 1bv1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,025 INFO L290 TraceCheckUtils]: 21: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !!(main_~item~0#1.base != 0bv32 || main_~item~0#1.offset != 0bv32);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:51,026 INFO L290 TraceCheckUtils]: 22: Hoare triple {8748#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~item~0#1.base]); {8738#false} is VALID [2022-02-20 23:46:51,031 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:51,031 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:51,031 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:51,031 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [322997874] [2022-02-20 23:46:51,031 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [322997874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,031 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,031 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:51,031 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159871219] [2022-02-20 23:46:51,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,032 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:51,032 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,032 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,055 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,055 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:51,055 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:51,056 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:51,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:51,056 INFO L87 Difference]: Start difference. First operand 168 states and 212 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,828 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2022-02-20 23:46:52,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:52,828 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:52,828 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,829 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2022-02-20 23:46:52,830 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 177 transitions. [2022-02-20 23:46:52,831 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 177 transitions. [2022-02-20 23:46:53,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 177 edges. 177 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,015 INFO L225 Difference]: With dead ends: 220 [2022-02-20 23:46:53,016 INFO L226 Difference]: Without dead ends: 220 [2022-02-20 23:46:53,016 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 15 SyntacticMatches, 1 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=91, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:46:53,016 INFO L933 BasicCegarLoop]: 96 mSDtfsCounter, 98 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 392 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 403 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 392 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,017 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 279 Invalid, 403 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 392 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:46:53,017 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 220 states. [2022-02-20 23:46:53,020 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 220 to 171. [2022-02-20 23:46:53,020 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,020 INFO L82 GeneralOperation]: Start isEquivalent. First operand 220 states. Second operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,020 INFO L74 IsIncluded]: Start isIncluded. First operand 220 states. Second operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,021 INFO L87 Difference]: Start difference. First operand 220 states. Second operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,024 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2022-02-20 23:46:53,025 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2022-02-20 23:46:53,025 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,025 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,025 INFO L74 IsIncluded]: Start isIncluded. First operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 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 220 states. [2022-02-20 23:46:53,026 INFO L87 Difference]: Start difference. First operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 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 220 states. [2022-02-20 23:46:53,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,034 INFO L93 Difference]: Finished difference Result 220 states and 271 transitions. [2022-02-20 23:46:53,035 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 271 transitions. [2022-02-20 23:46:53,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,035 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 171 states, 131 states have (on average 1.6564885496183206) internal successors, (217), 170 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 171 states to 171 states and 217 transitions. [2022-02-20 23:46:53,038 INFO L78 Accepts]: Start accepts. Automaton has 171 states and 217 transitions. Word has length 23 [2022-02-20 23:46:53,038 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,039 INFO L470 AbstractCegarLoop]: Abstraction has 171 states and 217 transitions. [2022-02-20 23:46:53,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,039 INFO L276 IsEmpty]: Start isEmpty. Operand 171 states and 217 transitions. [2022-02-20 23:46:53,039 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:46:53,039 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,039 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] [2022-02-20 23:46:53,049 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:53,249 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:46:53,249 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 58 more)] === [2022-02-20 23:46:53,249 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,249 INFO L85 PathProgramCache]: Analyzing trace with hash 697636569, now seen corresponding path program 1 times [2022-02-20 23:46:53,250 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:53,250 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863975370] [2022-02-20 23:46:53,250 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,250 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:53,250 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:53,251 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:46:53,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:46:53,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,354 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:46:53,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,372 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:53,394 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:46:53,398 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:46:53,469 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:46:53,470 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 18 [2022-02-20 23:46:53,483 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:53,483 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:46:53,628 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:46:53,635 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:46:53,755 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:46:53,758 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:46:53,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {9652#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(12bv32, 2bv32); {9652#true} is VALID [2022-02-20 23:46:53,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {9652#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset, main_#t~nondet5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem7#1.base, main_#t~mem7#1.offset, main_#t~nondet3#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~mem15#1, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_~item2~0#1.base, main_~item2~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32;havoc main_~item~0#1.base, main_~item~0#1.offset;havoc main_~item2~0#1.base, main_~item2~0#1.offset;havoc main_~lItem~0#1.base, main_~lItem~0#1.offset; {9652#true} is VALID [2022-02-20 23:46:53,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {9652#true} assume !!(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1;call main_#t~malloc4#1.base, main_#t~malloc4#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc4#1.base, main_#t~malloc4#1.offset;havoc main_#t~malloc4#1.base, main_#t~malloc4#1.offset; {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:53,831 INFO L290 TraceCheckUtils]: 3: Hoare triple {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:53,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L538-2 {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:53,833 INFO L290 TraceCheckUtils]: 5: Hoare triple {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~intINTTYPE4(main_#t~nondet5#1, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L540 {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:53,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {9663#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1)))} havoc main_#t~nondet5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8bv32);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:53,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} assume !(main_~data~0#1.base != 0bv32 || main_~data~0#1.offset != 0bv32); {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:53,835 INFO L290 TraceCheckUtils]: 8: Hoare triple {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4bv32); srcloc: L547 {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:53,836 INFO L290 TraceCheckUtils]: 9: Hoare triple {9676#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {9686#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} is VALID [2022-02-20 23:46:53,838 INFO L290 TraceCheckUtils]: 10: Hoare triple {9686#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~lItem~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~data~0#1.offset| |ULTIMATE.start_main_~lItem~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_~lItem~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, ~bvadd32(4bv32, main_~lItem~0#1.offset), 4bv32); srcloc: L543-1 {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,839 INFO L290 TraceCheckUtils]: 11: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} main_~item~0#1.base, main_~item~0#1.offset := 0bv32, 0bv32;main_~lItem~0#1.base, main_~lItem~0#1.offset := 0bv32, 0bv32; {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,839 INFO L290 TraceCheckUtils]: 12: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} assume !(0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,840 INFO L290 TraceCheckUtils]: 13: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32); {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,841 INFO L290 TraceCheckUtils]: 14: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} SUMMARY for call main_#t~mem8#1.base, main_#t~mem8#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4bv32); srcloc: L556-3 {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,841 INFO L290 TraceCheckUtils]: 15: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} assume !(main_#t~mem8#1.base != main_~data~0#1.base || main_#t~mem8#1.offset != main_~data~0#1.offset);havoc main_#t~mem8#1.base, main_#t~mem8#1.offset; {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} is VALID [2022-02-20 23:46:53,842 INFO L290 TraceCheckUtils]: 16: Hoare triple {9690#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) |ULTIMATE.start_main_~data~0#1.base|)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)))))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~data~0#1.base, ~bvadd32(4bv32, main_~data~0#1.offset), 4bv32); srcloc: L556-4 {9709#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:46:53,843 INFO L290 TraceCheckUtils]: 17: Hoare triple {9709#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem20#1.base, main_#t~mem20#1.offset;havoc main_#t~mem20#1.base, main_#t~mem20#1.offset; {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:53,847 INFO L290 TraceCheckUtils]: 18: Hoare triple {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume 0bv32 == main_~data~0#1.offset; {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:53,848 INFO L290 TraceCheckUtils]: 19: Hoare triple {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume ~bvult32(main_~data~0#1.base, #StackHeapBarrier); {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:53,848 INFO L290 TraceCheckUtils]: 20: Hoare triple {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume 0bv32 == main_~data~0#1.base || 1bv1 == #valid[main_~data~0#1.base];call ULTIMATE.dealloc(main_~data~0#1.base, main_~data~0#1.offset); {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:53,849 INFO L290 TraceCheckUtils]: 21: Hoare triple {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !!(main_~item~0#1.base != 0bv32 || main_~item~0#1.offset != 0bv32);main_~item2~0#1.base, main_~item2~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:46:53,850 INFO L290 TraceCheckUtils]: 22: Hoare triple {9713#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~item~0#1.offset), #length[main_~item~0#1.base]) && ~bvule32(main_~item~0#1.offset, ~bvadd32(4bv32, main_~item~0#1.offset))) && ~bvule32(0bv32, main_~item~0#1.offset)); {9653#false} is VALID [2022-02-20 23:46:53,850 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:53,850 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:53,850 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:53,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863975370] [2022-02-20 23:46:53,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863975370] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,850 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:53,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1436622456] [2022-02-20 23:46:53,850 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,851 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:53,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,882 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:53,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:53,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:53,883 INFO L87 Difference]: Start difference. First operand 171 states and 217 transitions. Second operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,352 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,352 INFO L93 Difference]: Finished difference Result 192 states and 236 transitions. [2022-02-20 23:46:55,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:46:55,353 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 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 23 [2022-02-20 23:46:55,353 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:55,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-02-20 23:46:55,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.2857142857142856) internal successors, (23), 8 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,355 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 149 transitions. [2022-02-20 23:46:55,355 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 149 transitions.