./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0513_1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0513_1.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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:35,433 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:35,434 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:35,452 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:35,454 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:35,456 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:35,458 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:35,460 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:35,461 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:35,463 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:35,463 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:35,464 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:35,465 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:35,468 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:35,469 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:35,470 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:35,472 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:35,472 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:35,475 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:35,476 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:35,479 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:35,479 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:35,481 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:35,481 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:35,485 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:35,487 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:35,488 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:35,488 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:35,489 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:35,490 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:35,490 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:35,491 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:35,492 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:35,492 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:35,493 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:35,493 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:35,494 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:35,494 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:35,494 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:35,499 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:35,500 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:35,501 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:48:35,527 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:35,529 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:35,530 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:35,530 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:35,531 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:35,531 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:35,531 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:35,532 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:35,532 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:35,532 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:35,532 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:35,533 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:35,534 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:35,534 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:35,535 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:35,535 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:35,536 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:35,536 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:35,536 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:35,536 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-02-20 23:48:35,746 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:35,765 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:35,768 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:35,769 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:35,770 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:35,771 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-02-20 23:48:35,823 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdb33dda/3c2fb21160bc4376a139bd11f4494b97/FLAG69a9e1e9d [2022-02-20 23:48:36,222 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:36,223 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-02-20 23:48:36,232 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdb33dda/3c2fb21160bc4376a139bd11f4494b97/FLAG69a9e1e9d [2022-02-20 23:48:36,241 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/cfdb33dda/3c2fb21160bc4376a139bd11f4494b97 [2022-02-20 23:48:36,242 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:36,243 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:36,244 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:36,244 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:36,247 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:36,248 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,248 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12719f87 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36, skipping insertion in model container [2022-02-20 23:48:36,248 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,255 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:36,288 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:36,553 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:36,558 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:36,593 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:36,612 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:36,613 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36 WrapperNode [2022-02-20 23:48:36,613 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:36,614 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:36,614 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:36,614 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:36,620 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:48:36" (1/1) ... [2022-02-20 23:48:36,647 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:48:36" (1/1) ... [2022-02-20 23:48:36,678 INFO L137 Inliner]: procedures = 123, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 148 [2022-02-20 23:48:36,679 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:36,680 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:36,680 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:36,680 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:36,685 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,686 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,688 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,690 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,699 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,709 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,714 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,716 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:36,721 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:36,722 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:36,722 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:36,723 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (1/1) ... [2022-02-20 23:48:36,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:36,742 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:36,753 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:48:36,754 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:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:36,777 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:36,778 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:36,778 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:36,842 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:36,843 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:37,339 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:37,351 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:37,351 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:48:37,353 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:37 BoogieIcfgContainer [2022-02-20 23:48:37,353 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:37,355 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:37,355 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:37,357 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:37,357 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:36" (1/3) ... [2022-02-20 23:48:37,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1986c881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:37, skipping insertion in model container [2022-02-20 23:48:37,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:36" (2/3) ... [2022-02-20 23:48:37,358 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1986c881 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:37, skipping insertion in model container [2022-02-20 23:48:37,358 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:37" (3/3) ... [2022-02-20 23:48:37,359 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-02-20 23:48:37,362 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:37,363 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-02-20 23:48:37,398 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:37,403 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:48:37,403 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-02-20 23:48:37,421 INFO L276 IsEmpty]: Start isEmpty. Operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,425 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:48:37,426 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,426 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:48:37,426 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:37,429 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,430 INFO L85 PathProgramCache]: Analyzing trace with hash 28769460, now seen corresponding path program 1 times [2022-02-20 23:48:37,436 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,436 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [259175923] [2022-02-20 23:48:37,436 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,437 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,538 INFO L290 TraceCheckUtils]: 0: Hoare triple {154#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {154#true} is VALID [2022-02-20 23:48:37,538 INFO L290 TraceCheckUtils]: 1: Hoare triple {154#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {154#true} is VALID [2022-02-20 23:48:37,539 INFO L290 TraceCheckUtils]: 2: Hoare triple {154#true} assume !true; {155#false} is VALID [2022-02-20 23:48:37,539 INFO L290 TraceCheckUtils]: 3: Hoare triple {155#false} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {155#false} is VALID [2022-02-20 23:48:37,539 INFO L290 TraceCheckUtils]: 4: Hoare triple {155#false} assume !(#valid == main_old_#valid#1); {155#false} is VALID [2022-02-20 23:48:37,540 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:48:37,541 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,542 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [259175923] [2022-02-20 23:48:37,542 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [259175923] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,542 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:37,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1784395035] [2022-02-20 23:48:37,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,548 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:48:37,549 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,551 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:48:37,561 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:48:37,562 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:48:37,562 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,579 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:48:37,580 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:37,584 INFO L87 Difference]: Start difference. First operand has 151 states, 80 states have (on average 2.125) internal successors, (170), 150 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 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:48:37,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,690 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2022-02-20 23:48:37,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:48:37,691 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:48:37,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,692 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:48:37,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 170 transitions. [2022-02-20 23:48:37,700 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:48:37,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 170 transitions. [2022-02-20 23:48:37,703 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 170 transitions. [2022-02-20 23:48:37,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 170 edges. 170 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,840 INFO L225 Difference]: With dead ends: 151 [2022-02-20 23:48:37,840 INFO L226 Difference]: Without dead ends: 149 [2022-02-20 23:48:37,841 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:48:37,844 INFO L933 BasicCegarLoop]: 165 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, 165 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:48:37,845 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:37,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2022-02-20 23:48:37,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 149. [2022-02-20 23:48:37,876 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,881 INFO L82 GeneralOperation]: Start isEquivalent. First operand 149 states. Second operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,883 INFO L74 IsIncluded]: Start isIncluded. First operand 149 states. Second operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,884 INFO L87 Difference]: Start difference. First operand 149 states. Second operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,896 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,897 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-02-20 23:48:37,897 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-02-20 23:48:37,898 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,898 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,899 INFO L74 IsIncluded]: Start isIncluded. First operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 149 states. [2022-02-20 23:48:37,899 INFO L87 Difference]: Start difference. First operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 149 states. [2022-02-20 23:48:37,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,907 INFO L93 Difference]: Finished difference Result 149 states and 163 transitions. [2022-02-20 23:48:37,907 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-02-20 23:48:37,911 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,911 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,911 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,912 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 149 states, 79 states have (on average 2.0632911392405062) internal successors, (163), 148 states have internal predecessors, (163), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 149 states to 149 states and 163 transitions. [2022-02-20 23:48:37,917 INFO L78 Accepts]: Start accepts. Automaton has 149 states and 163 transitions. Word has length 5 [2022-02-20 23:48:37,917 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:37,917 INFO L470 AbstractCegarLoop]: Abstraction has 149 states and 163 transitions. [2022-02-20 23:48:37,918 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:48:37,918 INFO L276 IsEmpty]: Start isEmpty. Operand 149 states and 163 transitions. [2022-02-20 23:48:37,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:48:37,918 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,918 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:37,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:37,919 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:37,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,920 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849456, now seen corresponding path program 1 times [2022-02-20 23:48:37,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [524069049] [2022-02-20 23:48:37,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,921 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {756#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {756#true} is VALID [2022-02-20 23:48:37,969 INFO L290 TraceCheckUtils]: 1: Hoare triple {756#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,971 INFO L290 TraceCheckUtils]: 2: Hoare triple {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~short4#1 := main_~c1~0#1 < 5; {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,972 INFO L290 TraceCheckUtils]: 3: Hoare triple {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,972 INFO L290 TraceCheckUtils]: 4: Hoare triple {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {758#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {757#false} is VALID [2022-02-20 23:48:37,974 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:48:37,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [524069049] [2022-02-20 23:48:37,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [524069049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,978 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,979 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:37,979 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [859218928] [2022-02-20 23:48:37,979 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,980 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:37,980 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:37,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:37,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:37,986 INFO L87 Difference]: Start difference. First operand 149 states and 163 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,257 INFO L93 Difference]: Finished difference Result 196 states and 213 transitions. [2022-02-20 23:48:38,257 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:38,258 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:38,258 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,258 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-02-20 23:48:38,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,262 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 214 transitions. [2022-02-20 23:48:38,262 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 214 transitions. [2022-02-20 23:48:38,411 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 214 edges. 214 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,414 INFO L225 Difference]: With dead ends: 196 [2022-02-20 23:48:38,414 INFO L226 Difference]: Without dead ends: 195 [2022-02-20 23:48:38,415 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:48:38,416 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 43 mSDsluCounter, 92 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 91 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,416 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 234 Invalid, 91 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:38,417 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 195 states. [2022-02-20 23:48:38,421 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 195 to 153. [2022-02-20 23:48:38,421 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 195 states. Second operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,422 INFO L74 IsIncluded]: Start isIncluded. First operand 195 states. Second operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,422 INFO L87 Difference]: Start difference. First operand 195 states. Second operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,427 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2022-02-20 23:48:38,427 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2022-02-20 23:48:38,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,428 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,428 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 195 states. [2022-02-20 23:48:38,428 INFO L87 Difference]: Start difference. First operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 195 states. [2022-02-20 23:48:38,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,433 INFO L93 Difference]: Finished difference Result 195 states and 212 transitions. [2022-02-20 23:48:38,433 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 212 transitions. [2022-02-20 23:48:38,434 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,434 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,434 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,434 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 83 states have (on average 2.036144578313253) internal successors, (169), 152 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 169 transitions. [2022-02-20 23:48:38,438 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 169 transitions. Word has length 7 [2022-02-20 23:48:38,438 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,438 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 169 transitions. [2022-02-20 23:48:38,438 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,439 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 169 transitions. [2022-02-20 23:48:38,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:48:38,439 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,439 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:38,439 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:38,439 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:38,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849360, now seen corresponding path program 1 times [2022-02-20 23:48:38,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [786139149] [2022-02-20 23:48:38,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {1500#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {1500#true} is VALID [2022-02-20 23:48:38,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {1500#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:38,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} main_#t~short4#1 := main_~c1~0#1 < 5; {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:38,471 INFO L290 TraceCheckUtils]: 3: Hoare triple {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:38,472 INFO L290 TraceCheckUtils]: 4: Hoare triple {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {1502#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:38,472 INFO L290 TraceCheckUtils]: 5: Hoare triple {1502#(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); {1501#false} is VALID [2022-02-20 23:48:38,472 INFO L290 TraceCheckUtils]: 6: Hoare triple {1501#false} assume !(1 == #valid[main_~data~0#1.base]); {1501#false} is VALID [2022-02-20 23:48:38,473 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:48:38,473 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [786139149] [2022-02-20 23:48:38,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [786139149] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:38,474 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [143371377] [2022-02-20 23:48:38,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,474 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:38,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,479 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:38,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,480 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:38,480 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:38,480 INFO L87 Difference]: Start difference. First operand 153 states and 169 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,641 INFO L93 Difference]: Finished difference Result 173 states and 190 transitions. [2022-02-20 23:48:38,641 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:38,641 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:38,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 23:48:38,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 192 transitions. [2022-02-20 23:48:38,645 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 192 transitions. [2022-02-20 23:48:38,772 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 192 edges. 192 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,774 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:48:38,775 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:48:38,775 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:48:38,776 INFO L933 BasicCegarLoop]: 162 mSDtfsCounter, 27 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 279 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:48:38,776 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 279 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:38,777 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:48:38,780 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 162. [2022-02-20 23:48:38,781 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,781 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,781 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,782 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,785 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-02-20 23:48:38,785 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2022-02-20 23:48:38,785 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,785 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,786 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 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:48:38,786 INFO L87 Difference]: Start difference. First operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 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:48:38,789 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,789 INFO L93 Difference]: Finished difference Result 172 states and 189 transitions. [2022-02-20 23:48:38,790 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 189 transitions. [2022-02-20 23:48:38,790 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,790 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,790 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,790 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 92 states have (on average 2.0434782608695654) internal successors, (188), 161 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 188 transitions. [2022-02-20 23:48:38,793 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 188 transitions. Word has length 7 [2022-02-20 23:48:38,793 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,794 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 188 transitions. [2022-02-20 23:48:38,794 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,794 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 188 transitions. [2022-02-20 23:48:38,794 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:48:38,794 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,794 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:38,795 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:38,795 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:38,795 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,795 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849231, now seen corresponding path program 1 times [2022-02-20 23:48:38,795 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,796 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2121186593] [2022-02-20 23:48:38,796 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,796 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,809 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,831 INFO L290 TraceCheckUtils]: 0: Hoare triple {2184#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {2184#true} is VALID [2022-02-20 23:48:38,831 INFO L290 TraceCheckUtils]: 1: Hoare triple {2184#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {2184#true} is VALID [2022-02-20 23:48:38,831 INFO L290 TraceCheckUtils]: 2: Hoare triple {2184#true} main_#t~short4#1 := main_~c1~0#1 < 5; {2184#true} is VALID [2022-02-20 23:48:38,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {2184#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {2184#true} is VALID [2022-02-20 23:48:38,833 INFO L290 TraceCheckUtils]: 4: Hoare triple {2184#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2186#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:38,834 INFO L290 TraceCheckUtils]: 5: Hoare triple {2186#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {2186#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:38,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {2186#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {2185#false} is VALID [2022-02-20 23:48:38,834 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:48:38,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,835 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2121186593] [2022-02-20 23:48:38,835 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2121186593] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,835 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:38,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2141125137] [2022-02-20 23:48:38,836 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,836 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:38,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:38,841 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,842 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:38,842 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:38,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:38,844 INFO L87 Difference]: Start difference. First operand 162 states and 188 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,049 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-02-20 23:48:39,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:39,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:39,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-20 23:48:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2022-02-20 23:48:39,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2022-02-20 23:48:39,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,177 INFO L225 Difference]: With dead ends: 191 [2022-02-20 23:48:39,177 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 23:48:39,177 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:48:39,178 INFO L933 BasicCegarLoop]: 146 mSDtfsCounter, 84 mSDsluCounter, 50 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 196 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 196 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 106 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:39,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 23:48:39,184 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 161. [2022-02-20 23:48:39,184 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,185 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,185 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,185 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,188 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-02-20 23:48:39,189 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2022-02-20 23:48:39,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,189 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 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:48:39,189 INFO L87 Difference]: Start difference. First operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 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:48:39,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,193 INFO L93 Difference]: Finished difference Result 191 states and 217 transitions. [2022-02-20 23:48:39,193 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 217 transitions. [2022-02-20 23:48:39,193 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,193 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,193 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,193 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 96 states have (on average 1.9479166666666667) internal successors, (187), 160 states have internal predecessors, (187), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 187 transitions. [2022-02-20 23:48:39,200 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 187 transitions. Word has length 7 [2022-02-20 23:48:39,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,201 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 187 transitions. [2022-02-20 23:48:39,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,201 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 187 transitions. [2022-02-20 23:48:39,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:48:39,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,201 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:39,201 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:39,203 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:39,204 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1806849232, now seen corresponding path program 1 times [2022-02-20 23:48:39,204 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,204 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224223293] [2022-02-20 23:48:39,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,245 INFO L290 TraceCheckUtils]: 0: Hoare triple {2923#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {2923#true} is VALID [2022-02-20 23:48:39,245 INFO L290 TraceCheckUtils]: 1: Hoare triple {2923#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {2923#true} is VALID [2022-02-20 23:48:39,245 INFO L290 TraceCheckUtils]: 2: Hoare triple {2923#true} main_#t~short4#1 := main_~c1~0#1 < 5; {2923#true} is VALID [2022-02-20 23:48:39,245 INFO L290 TraceCheckUtils]: 3: Hoare triple {2923#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {2923#true} is VALID [2022-02-20 23:48:39,246 INFO L290 TraceCheckUtils]: 4: Hoare triple {2923#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {2925#(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:48:39,247 INFO L290 TraceCheckUtils]: 5: Hoare triple {2925#(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); {2925#(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:48:39,247 INFO L290 TraceCheckUtils]: 6: Hoare triple {2925#(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); {2924#false} is VALID [2022-02-20 23:48:39,247 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:48:39,248 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,248 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224223293] [2022-02-20 23:48:39,248 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224223293] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,248 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,248 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:39,248 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903460254] [2022-02-20 23:48:39,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,249 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:39,249 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,249 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,254 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:39,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:39,255 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:39,255 INFO L87 Difference]: Start difference. First operand 161 states and 187 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,422 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:48:39,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:39,423 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:48:39,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-20 23:48:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 158 transitions. [2022-02-20 23:48:39,426 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 158 transitions. [2022-02-20 23:48:39,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 158 edges. 158 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,519 INFO L225 Difference]: With dead ends: 157 [2022-02-20 23:48:39,519 INFO L226 Difference]: Without dead ends: 157 [2022-02-20 23:48:39,520 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:48:39,520 INFO L933 BasicCegarLoop]: 138 mSDtfsCounter, 29 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 78 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,521 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 202 Invalid, 78 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:39,521 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2022-02-20 23:48:39,524 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 157. [2022-02-20 23:48:39,524 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,524 INFO L82 GeneralOperation]: Start isEquivalent. First operand 157 states. Second operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,525 INFO L74 IsIncluded]: Start isIncluded. First operand 157 states. Second operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,525 INFO L87 Difference]: Start difference. First operand 157 states. Second operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,527 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,528 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:48:39,528 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-02-20 23:48:39,528 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,528 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,528 INFO L74 IsIncluded]: Start isIncluded. First operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:48:39,529 INFO L87 Difference]: Start difference. First operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 157 states. [2022-02-20 23:48:39,531 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,531 INFO L93 Difference]: Finished difference Result 157 states and 179 transitions. [2022-02-20 23:48:39,532 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-02-20 23:48:39,532 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,532 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,532 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,532 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,532 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 96 states have (on average 1.8645833333333333) internal successors, (179), 156 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 179 transitions. [2022-02-20 23:48:39,535 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 179 transitions. Word has length 7 [2022-02-20 23:48:39,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,535 INFO L470 AbstractCegarLoop]: Abstraction has 157 states and 179 transitions. [2022-02-20 23:48:39,535 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,536 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 179 transitions. [2022-02-20 23:48:39,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:48:39,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:39,536 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:39,536 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:39,537 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,537 INFO L85 PathProgramCache]: Analyzing trace with hash -1188718309, now seen corresponding path program 1 times [2022-02-20 23:48:39,537 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,537 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2070609954] [2022-02-20 23:48:39,537 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,537 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,575 INFO L290 TraceCheckUtils]: 0: Hoare triple {3556#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {3556#true} is VALID [2022-02-20 23:48:39,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {3556#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:39,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} main_#t~short4#1 := main_~c1~0#1 < 5; {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:39,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:39,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {3558#(= |ULTIMATE.start_main_~c1~0#1| 0)} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} is VALID [2022-02-20 23:48:39,577 INFO L290 TraceCheckUtils]: 5: Hoare triple {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} is VALID [2022-02-20 23:48:39,577 INFO L290 TraceCheckUtils]: 6: Hoare triple {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} is VALID [2022-02-20 23:48:39,578 INFO L290 TraceCheckUtils]: 7: Hoare triple {3559#(<= |ULTIMATE.start_main_~c1~0#1| 1)} assume !(main_~c1~0#1 < 2); {3557#false} is VALID [2022-02-20 23:48:39,578 INFO L290 TraceCheckUtils]: 8: Hoare triple {3557#false} assume !(main_~c1~0#1 < 4); {3557#false} is VALID [2022-02-20 23:48:39,578 INFO L290 TraceCheckUtils]: 9: Hoare triple {3557#false} assume !(main_~c1~0#1 < 6); {3557#false} is VALID [2022-02-20 23:48:39,578 INFO L290 TraceCheckUtils]: 10: Hoare triple {3557#false} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {3557#false} is VALID [2022-02-20 23:48:39,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {3557#false} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {3557#false} is VALID [2022-02-20 23:48:39,579 INFO L290 TraceCheckUtils]: 12: Hoare triple {3557#false} assume !(1 == #valid[main_~lItem~0#1.base]); {3557#false} is VALID [2022-02-20 23:48:39,579 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:48:39,579 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,579 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2070609954] [2022-02-20 23:48:39,579 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2070609954] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,580 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,580 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:39,580 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110121591] [2022-02-20 23:48:39,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,580 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:48:39,581 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,581 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,588 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,588 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:39,589 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,589 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:39,589 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:39,589 INFO L87 Difference]: Start difference. First operand 157 states and 179 transitions. Second operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,850 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-02-20 23:48:39,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:39,850 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 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 13 [2022-02-20 23:48:39,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2022-02-20 23:48:39,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:39,855 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 309 transitions. [2022-02-20 23:48:39,855 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 309 transitions. [2022-02-20 23:48:40,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 309 edges. 309 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,034 INFO L225 Difference]: With dead ends: 295 [2022-02-20 23:48:40,034 INFO L226 Difference]: Without dead ends: 295 [2022-02-20 23:48:40,035 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:40,035 INFO L933 BasicCegarLoop]: 158 mSDtfsCounter, 149 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 454 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:40,036 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 295 states. [2022-02-20 23:48:40,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 295 to 160. [2022-02-20 23:48:40,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,039 INFO L82 GeneralOperation]: Start isEquivalent. First operand 295 states. Second operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,039 INFO L74 IsIncluded]: Start isIncluded. First operand 295 states. Second operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,040 INFO L87 Difference]: Start difference. First operand 295 states. Second operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,045 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,045 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-02-20 23:48:40,045 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 329 transitions. [2022-02-20 23:48:40,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,046 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,046 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 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 295 states. [2022-02-20 23:48:40,046 INFO L87 Difference]: Start difference. First operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 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 295 states. [2022-02-20 23:48:40,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,052 INFO L93 Difference]: Finished difference Result 295 states and 329 transitions. [2022-02-20 23:48:40,052 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 329 transitions. [2022-02-20 23:48:40,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 99 states have (on average 1.8080808080808082) internal successors, (179), 159 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 179 transitions. [2022-02-20 23:48:40,055 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 179 transitions. Word has length 13 [2022-02-20 23:48:40,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,056 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 179 transitions. [2022-02-20 23:48:40,056 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.25) internal successors, (13), 4 states have internal predecessors, (13), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,056 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 179 transitions. [2022-02-20 23:48:40,056 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:48:40,056 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,056 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,057 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:40,057 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr14REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:40,057 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,057 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682520, now seen corresponding path program 1 times [2022-02-20 23:48:40,057 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1537562884] [2022-02-20 23:48:40,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,095 INFO L290 TraceCheckUtils]: 0: Hoare triple {4607#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {4607#true} is VALID [2022-02-20 23:48:40,095 INFO L290 TraceCheckUtils]: 1: Hoare triple {4607#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {4607#true} is VALID [2022-02-20 23:48:40,095 INFO L290 TraceCheckUtils]: 2: Hoare triple {4607#true} main_#t~short4#1 := main_~c1~0#1 < 5; {4607#true} is VALID [2022-02-20 23:48:40,095 INFO L290 TraceCheckUtils]: 3: Hoare triple {4607#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {4607#true} is VALID [2022-02-20 23:48:40,096 INFO L290 TraceCheckUtils]: 4: Hoare triple {4607#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {4607#true} is VALID [2022-02-20 23:48:40,096 INFO L290 TraceCheckUtils]: 5: Hoare triple {4607#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4607#true} is VALID [2022-02-20 23:48:40,096 INFO L290 TraceCheckUtils]: 6: Hoare triple {4607#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {4607#true} is VALID [2022-02-20 23:48:40,096 INFO L290 TraceCheckUtils]: 7: Hoare triple {4607#true} assume main_~c1~0#1 < 2; {4607#true} is VALID [2022-02-20 23:48:40,096 INFO L290 TraceCheckUtils]: 8: Hoare triple {4607#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {4607#true} is VALID [2022-02-20 23:48:40,097 INFO L290 TraceCheckUtils]: 9: Hoare triple {4607#true} assume main_~c1~0#1 < 4; {4607#true} is VALID [2022-02-20 23:48:40,097 INFO L290 TraceCheckUtils]: 10: Hoare triple {4607#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {4607#true} is VALID [2022-02-20 23:48:40,097 INFO L290 TraceCheckUtils]: 11: Hoare triple {4607#true} assume main_~c1~0#1 < 6; {4607#true} is VALID [2022-02-20 23:48:40,097 INFO L290 TraceCheckUtils]: 12: Hoare triple {4607#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {4607#true} is VALID [2022-02-20 23:48:40,098 INFO L290 TraceCheckUtils]: 13: Hoare triple {4607#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {4609#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:48:40,098 INFO L290 TraceCheckUtils]: 14: Hoare triple {4609#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {4609#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:48:40,098 INFO L290 TraceCheckUtils]: 15: Hoare triple {4609#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} assume !(1 == #valid[main_~lItem~0#1.base]); {4608#false} is VALID [2022-02-20 23:48:40,099 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:48:40,099 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,099 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1537562884] [2022-02-20 23:48:40,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1537562884] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:40,099 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1041052401] [2022-02-20 23:48:40,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,100 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:40,100 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,100 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,109 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,109 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:40,109 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,109 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:40,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:40,110 INFO L87 Difference]: Start difference. First operand 160 states and 179 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,275 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,275 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:48:40,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:40,276 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:40,276 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:48:40,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2022-02-20 23:48:40,279 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 154 transitions. [2022-02-20 23:48:40,382 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:48:40,383 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:48:40,389 INFO L226 Difference]: Without dead ends: 156 [2022-02-20 23:48:40,390 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:48:40,390 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 23 mSDsluCounter, 70 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 23 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 74 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,391 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [23 Valid, 204 Invalid, 74 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:40,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 156 states. [2022-02-20 23:48:40,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 156 to 156. [2022-02-20 23:48:40,396 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,396 INFO L82 GeneralOperation]: Start isEquivalent. First operand 156 states. Second operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,396 INFO L74 IsIncluded]: Start isIncluded. First operand 156 states. Second operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,397 INFO L87 Difference]: Start difference. First operand 156 states. Second operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,399 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:48:40,399 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:48:40,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,400 INFO L74 IsIncluded]: Start isIncluded. First operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states. [2022-02-20 23:48:40,401 INFO L87 Difference]: Start difference. First operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 156 states. [2022-02-20 23:48:40,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,409 INFO L93 Difference]: Finished difference Result 156 states and 175 transitions. [2022-02-20 23:48:40,409 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:48:40,409 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,409 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,409 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,410 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 156 states, 99 states have (on average 1.7676767676767677) internal successors, (175), 155 states have internal predecessors, (175), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,412 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 156 states to 156 states and 175 transitions. [2022-02-20 23:48:40,412 INFO L78 Accepts]: Start accepts. Automaton has 156 states and 175 transitions. Word has length 16 [2022-02-20 23:48:40,412 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,412 INFO L470 AbstractCegarLoop]: Abstraction has 156 states and 175 transitions. [2022-02-20 23:48:40,413 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,413 INFO L276 IsEmpty]: Start isEmpty. Operand 156 states and 175 transitions. [2022-02-20 23:48:40,413 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:48:40,413 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,413 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:40,413 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:40,414 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:40,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,414 INFO L85 PathProgramCache]: Analyzing trace with hash -1826682519, now seen corresponding path program 1 times [2022-02-20 23:48:40,414 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,414 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1030266635] [2022-02-20 23:48:40,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,460 INFO L290 TraceCheckUtils]: 0: Hoare triple {5236#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5236#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5236#true} main_#t~short4#1 := main_~c1~0#1 < 5; {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {5236#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {5236#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {5236#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {5236#true} is VALID [2022-02-20 23:48:40,461 INFO L290 TraceCheckUtils]: 6: Hoare triple {5236#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 7: Hoare triple {5236#true} assume main_~c1~0#1 < 2; {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 8: Hoare triple {5236#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 9: Hoare triple {5236#true} assume main_~c1~0#1 < 4; {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 10: Hoare triple {5236#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 11: Hoare triple {5236#true} assume main_~c1~0#1 < 6; {5236#true} is VALID [2022-02-20 23:48:40,462 INFO L290 TraceCheckUtils]: 12: Hoare triple {5236#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {5236#true} is VALID [2022-02-20 23:48:40,463 INFO L290 TraceCheckUtils]: 13: Hoare triple {5236#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {5238#(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:48:40,464 INFO L290 TraceCheckUtils]: 14: Hoare triple {5238#(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); {5238#(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:48:40,464 INFO L290 TraceCheckUtils]: 15: Hoare triple {5238#(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); {5237#false} is VALID [2022-02-20 23:48:40,464 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:48:40,464 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,465 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1030266635] [2022-02-20 23:48:40,465 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1030266635] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,465 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:40,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [21898716] [2022-02-20 23:48:40,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,466 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:40,466 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,475 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:40,475 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:40,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:40,476 INFO L87 Difference]: Start difference. First operand 156 states and 175 transitions. Second operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,637 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-02-20 23:48:40,637 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:40,637 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:48:40,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,638 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,638 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:48:40,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,639 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2022-02-20 23:48:40,639 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 150 transitions. [2022-02-20 23:48:40,723 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:48:40,724 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:48:40,724 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:48:40,725 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:48:40,725 INFO L933 BasicCegarLoop]: 139 mSDtfsCounter, 12 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,725 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 215 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:40,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:48:40,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 153. [2022-02-20 23:48:40,728 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,728 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,728 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,728 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,736 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-02-20 23:48:40,736 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-02-20 23:48:40,737 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,737 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,737 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 23:48:40,737 INFO L87 Difference]: Start difference. First operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 153 states. [2022-02-20 23:48:40,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,739 INFO L93 Difference]: Finished difference Result 153 states and 172 transitions. [2022-02-20 23:48:40,739 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-02-20 23:48:40,739 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,739 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,739 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,740 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7373737373737375) internal successors, (172), 152 states have internal predecessors, (172), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 172 transitions. [2022-02-20 23:48:40,741 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 172 transitions. Word has length 16 [2022-02-20 23:48:40,741 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,741 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 172 transitions. [2022-02-20 23:48:40,741 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.0) internal successors, (16), 3 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,742 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 172 transitions. [2022-02-20 23:48:40,742 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:48:40,742 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,742 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] [2022-02-20 23:48:40,742 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:48:40,742 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:40,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,742 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351565, now seen corresponding path program 1 times [2022-02-20 23:48:40,743 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2110892201] [2022-02-20 23:48:40,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,823 INFO L290 TraceCheckUtils]: 0: Hoare triple {5853#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {5853#true} is VALID [2022-02-20 23:48:40,823 INFO L290 TraceCheckUtils]: 1: Hoare triple {5853#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {5853#true} is VALID [2022-02-20 23:48:40,823 INFO L290 TraceCheckUtils]: 2: Hoare triple {5853#true} main_#t~short4#1 := main_~c1~0#1 < 5; {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 3: Hoare triple {5853#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 4: Hoare triple {5853#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 5: Hoare triple {5853#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 6: Hoare triple {5853#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {5853#true} assume main_~c1~0#1 < 2; {5853#true} is VALID [2022-02-20 23:48:40,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {5853#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {5853#true} is VALID [2022-02-20 23:48:40,826 INFO L290 TraceCheckUtils]: 9: Hoare triple {5853#true} assume main_~c1~0#1 < 4; {5853#true} is VALID [2022-02-20 23:48:40,826 INFO L290 TraceCheckUtils]: 10: Hoare triple {5853#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {5853#true} is VALID [2022-02-20 23:48:40,829 INFO L290 TraceCheckUtils]: 11: Hoare triple {5853#true} assume main_~c1~0#1 < 6; {5853#true} is VALID [2022-02-20 23:48:40,829 INFO L290 TraceCheckUtils]: 12: Hoare triple {5853#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {5853#true} is VALID [2022-02-20 23:48:40,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {5853#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {5855#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:48:40,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {5855#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {5855#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:48:40,830 INFO L290 TraceCheckUtils]: 15: Hoare triple {5855#(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: L554 {5855#(not (= |ULTIMATE.start_main_~lItem~0#1.base| 0))} is VALID [2022-02-20 23:48:40,830 INFO L290 TraceCheckUtils]: 16: Hoare triple {5855#(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; {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,831 INFO L290 TraceCheckUtils]: 17: Hoare triple {5856#(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: L550-1 {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,831 INFO L290 TraceCheckUtils]: 18: Hoare triple {5856#(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; {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,832 INFO L290 TraceCheckUtils]: 19: Hoare triple {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} main_#t~short4#1 := main_~c1~0#1 < 5; {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,832 INFO L290 TraceCheckUtils]: 20: Hoare triple {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,833 INFO L290 TraceCheckUtils]: 21: Hoare triple {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {5856#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:48:40,833 INFO L290 TraceCheckUtils]: 22: Hoare triple {5856#(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; {5854#false} is VALID [2022-02-20 23:48:40,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {5854#false} assume !(#valid == main_old_#valid#1); {5854#false} is VALID [2022-02-20 23:48:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:40,837 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2110892201] [2022-02-20 23:48:40,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2110892201] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:40,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [308914264] [2022-02-20 23:48:40,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,839 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:40,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:40,852 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,852 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:40,852 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:40,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:40,853 INFO L87 Difference]: Start difference. First operand 153 states and 172 transitions. Second operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,098 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-02-20 23:48:41,098 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:41,098 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:41,098 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:41,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 273 transitions. [2022-02-20 23:48:41,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 273 transitions. [2022-02-20 23:48:41,101 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 273 transitions. [2022-02-20 23:48:41,247 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 273 edges. 273 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,250 INFO L225 Difference]: With dead ends: 261 [2022-02-20 23:48:41,250 INFO L226 Difference]: Without dead ends: 261 [2022-02-20 23:48:41,250 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:48:41,250 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 146 mSDsluCounter, 204 mSDsCounter, 0 mSdLazyCounter, 108 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 146 SdHoareTripleChecker+Valid, 323 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:48:41,251 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [146 Valid, 323 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 108 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:41,251 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2022-02-20 23:48:41,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 153. [2022-02-20 23:48:41,253 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,253 INFO L82 GeneralOperation]: Start isEquivalent. First operand 261 states. Second operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,253 INFO L74 IsIncluded]: Start isIncluded. First operand 261 states. Second operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,254 INFO L87 Difference]: Start difference. First operand 261 states. Second operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,257 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,257 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-02-20 23:48:41,257 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 290 transitions. [2022-02-20 23:48:41,257 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,257 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,258 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 261 states. [2022-02-20 23:48:41,258 INFO L87 Difference]: Start difference. First operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 261 states. [2022-02-20 23:48:41,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,261 INFO L93 Difference]: Finished difference Result 261 states and 290 transitions. [2022-02-20 23:48:41,261 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 290 transitions. [2022-02-20 23:48:41,262 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,262 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,262 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,262 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 99 states have (on average 1.7171717171717171) internal successors, (170), 152 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 170 transitions. [2022-02-20 23:48:41,264 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 170 transitions. Word has length 24 [2022-02-20 23:48:41,264 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,264 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 170 transitions. [2022-02-20 23:48:41,264 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 6.0) internal successors, (24), 4 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,264 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 170 transitions. [2022-02-20 23:48:41,265 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:48:41,265 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,265 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] [2022-02-20 23:48:41,265 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:48:41,265 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:41,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,266 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351469, now seen corresponding path program 1 times [2022-02-20 23:48:41,266 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:41,266 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1887504980] [2022-02-20 23:48:41,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:41,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,324 INFO L290 TraceCheckUtils]: 0: Hoare triple {6797#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {6797#true} is VALID [2022-02-20 23:48:41,324 INFO L290 TraceCheckUtils]: 1: Hoare triple {6797#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {6797#true} is VALID [2022-02-20 23:48:41,324 INFO L290 TraceCheckUtils]: 2: Hoare triple {6797#true} main_#t~short4#1 := main_~c1~0#1 < 5; {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 3: Hoare triple {6797#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 4: Hoare triple {6797#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 5: Hoare triple {6797#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 6: Hoare triple {6797#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 7: Hoare triple {6797#true} assume main_~c1~0#1 < 2; {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 8: Hoare triple {6797#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {6797#true} is VALID [2022-02-20 23:48:41,325 INFO L290 TraceCheckUtils]: 9: Hoare triple {6797#true} assume main_~c1~0#1 < 4; {6797#true} is VALID [2022-02-20 23:48:41,326 INFO L290 TraceCheckUtils]: 10: Hoare triple {6797#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {6797#true} is VALID [2022-02-20 23:48:41,326 INFO L290 TraceCheckUtils]: 11: Hoare triple {6797#true} assume main_~c1~0#1 < 6; {6797#true} is VALID [2022-02-20 23:48:41,326 INFO L290 TraceCheckUtils]: 12: Hoare triple {6797#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {6797#true} is VALID [2022-02-20 23:48:41,326 INFO L290 TraceCheckUtils]: 13: Hoare triple {6797#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {6797#true} is VALID [2022-02-20 23:48:41,326 INFO L290 TraceCheckUtils]: 14: Hoare triple {6797#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {6797#true} is VALID [2022-02-20 23:48:41,327 INFO L290 TraceCheckUtils]: 15: Hoare triple {6797#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: L554 {6799#(= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,327 INFO L290 TraceCheckUtils]: 16: Hoare triple {6799#(= (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; {6800#(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:48:41,327 INFO L290 TraceCheckUtils]: 17: Hoare triple {6800#(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: L550-1 {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,328 INFO L290 TraceCheckUtils]: 18: Hoare triple {6801#(= (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; {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,328 INFO L290 TraceCheckUtils]: 19: Hoare triple {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} main_#t~short4#1 := main_~c1~0#1 < 5; {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,328 INFO L290 TraceCheckUtils]: 21: Hoare triple {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,329 INFO L290 TraceCheckUtils]: 22: Hoare triple {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:48:41,329 INFO L290 TraceCheckUtils]: 23: Hoare triple {6801#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(1 == #valid[main_~data~0#1.base]); {6798#false} is VALID [2022-02-20 23:48:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:41,329 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:41,329 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1887504980] [2022-02-20 23:48:41,330 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1887504980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:41,330 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:41,330 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:41,330 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25401174] [2022-02-20 23:48:41,330 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:41,330 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:41,331 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:41,331 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,351 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,351 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:41,352 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:41,352 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:41,352 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:41,352 INFO L87 Difference]: Start difference. First operand 153 states and 170 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,609 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-02-20 23:48:41,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:41,609 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:41,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2022-02-20 23:48:41,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 162 transitions. [2022-02-20 23:48:41,611 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 162 transitions. [2022-02-20 23:48:41,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 162 edges. 162 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,703 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:48:41,703 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:48:41,704 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:48:41,704 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 84 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 164 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:41,704 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [84 Valid, 224 Invalid, 164 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:41,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:48:41,706 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-02-20 23:48:41,706 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:41,706 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,707 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,707 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,708 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,708 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-02-20 23:48:41,709 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2022-02-20 23:48:41,709 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,709 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,709 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 147 states. [2022-02-20 23:48:41,709 INFO L87 Difference]: Start difference. First operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 147 states. [2022-02-20 23:48:41,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,711 INFO L93 Difference]: Finished difference Result 147 states and 164 transitions. [2022-02-20 23:48:41,711 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 164 transitions. [2022-02-20 23:48:41,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:41,711 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:41,711 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:41,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:41,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 100 states have (on average 1.64) internal successors, (164), 145 states have internal predecessors, (164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 164 transitions. [2022-02-20 23:48:41,713 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 164 transitions. Word has length 24 [2022-02-20 23:48:41,713 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:41,713 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 164 transitions. [2022-02-20 23:48:41,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,714 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 164 transitions. [2022-02-20 23:48:41,714 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:48:41,714 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:41,714 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] [2022-02-20 23:48:41,714 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:48:41,715 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:41,715 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:41,715 INFO L85 PathProgramCache]: Analyzing trace with hash 1446351470, now seen corresponding path program 1 times [2022-02-20 23:48:41,715 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:41,715 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [790742680] [2022-02-20 23:48:41,715 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:41,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:41,744 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:41,802 INFO L290 TraceCheckUtils]: 0: Hoare triple {7391#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {7391#true} is VALID [2022-02-20 23:48:41,803 INFO L290 TraceCheckUtils]: 1: Hoare triple {7391#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {7391#true} is VALID [2022-02-20 23:48:41,803 INFO L290 TraceCheckUtils]: 2: Hoare triple {7391#true} main_#t~short4#1 := main_~c1~0#1 < 5; {7391#true} is VALID [2022-02-20 23:48:41,803 INFO L290 TraceCheckUtils]: 3: Hoare triple {7391#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {7391#true} is VALID [2022-02-20 23:48:41,803 INFO L290 TraceCheckUtils]: 4: Hoare triple {7391#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 5: Hoare triple {7391#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 6: Hoare triple {7391#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 7: Hoare triple {7391#true} assume main_~c1~0#1 < 2; {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 8: Hoare triple {7391#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 9: Hoare triple {7391#true} assume main_~c1~0#1 < 4; {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 10: Hoare triple {7391#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {7391#true} is VALID [2022-02-20 23:48:41,804 INFO L290 TraceCheckUtils]: 11: Hoare triple {7391#true} assume main_~c1~0#1 < 6; {7391#true} is VALID [2022-02-20 23:48:41,805 INFO L290 TraceCheckUtils]: 12: Hoare triple {7391#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {7391#true} is VALID [2022-02-20 23:48:41,805 INFO L290 TraceCheckUtils]: 13: Hoare triple {7391#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {7393#(= |ULTIMATE.start_main_~lItem~0#1.offset| 0)} is VALID [2022-02-20 23:48:41,805 INFO L290 TraceCheckUtils]: 14: Hoare triple {7393#(= |ULTIMATE.start_main_~lItem~0#1.offset| 0)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {7393#(= |ULTIMATE.start_main_~lItem~0#1.offset| 0)} is VALID [2022-02-20 23:48:41,806 INFO L290 TraceCheckUtils]: 15: Hoare triple {7393#(= |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: L554 {7393#(= |ULTIMATE.start_main_~lItem~0#1.offset| 0)} is VALID [2022-02-20 23:48:41,806 INFO L290 TraceCheckUtils]: 16: Hoare triple {7393#(= |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; {7394#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (select |#length| |ULTIMATE.start_main_~lItem~0#1.base|)) 0))} is VALID [2022-02-20 23:48:41,807 INFO L290 TraceCheckUtils]: 17: Hoare triple {7394#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (+ (* (- 1) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)) (select |#length| |ULTIMATE.start_main_~lItem~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: L550-1 {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,807 INFO L290 TraceCheckUtils]: 18: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |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; {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,808 INFO L290 TraceCheckUtils]: 19: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} main_#t~short4#1 := main_~c1~0#1 < 5; {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,808 INFO L290 TraceCheckUtils]: 20: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,808 INFO L290 TraceCheckUtils]: 21: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,809 INFO L290 TraceCheckUtils]: 22: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:41,809 INFO L290 TraceCheckUtils]: 23: Hoare triple {7395#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(4 + main_~data~0#1.offset <= #length[main_~data~0#1.base] && 0 <= main_~data~0#1.offset); {7392#false} is VALID [2022-02-20 23:48:41,810 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:41,810 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:41,810 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [790742680] [2022-02-20 23:48:41,810 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [790742680] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:41,811 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:41,811 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:41,811 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [12516778] [2022-02-20 23:48:41,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:41,811 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:41,811 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:41,812 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:41,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:41,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:41,825 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:41,826 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:41,826 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:41,826 INFO L87 Difference]: Start difference. First operand 146 states and 164 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:42,269 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,269 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-02-20 23:48:42,269 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:42,269 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:48:42,269 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:42,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:42,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2022-02-20 23:48:42,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:42,272 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 258 transitions. [2022-02-20 23:48:42,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 258 transitions. [2022-02-20 23:48:42,434 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,437 INFO L225 Difference]: With dead ends: 239 [2022-02-20 23:48:42,437 INFO L226 Difference]: Without dead ends: 239 [2022-02-20 23:48:42,437 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:42,437 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 325 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 325 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:42,438 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [325 Valid, 226 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:42,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 239 states. [2022-02-20 23:48:42,440 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 239 to 185. [2022-02-20 23:48:42,440 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:42,440 INFO L82 GeneralOperation]: Start isEquivalent. First operand 239 states. Second operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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:48:42,440 INFO L74 IsIncluded]: Start isIncluded. First operand 239 states. Second operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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:48:42,440 INFO L87 Difference]: Start difference. First operand 239 states. Second operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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:48:42,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,443 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-02-20 23:48:42,443 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2022-02-20 23:48:42,444 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,444 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,444 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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 239 states. [2022-02-20 23:48:42,444 INFO L87 Difference]: Start difference. First operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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 239 states. [2022-02-20 23:48:42,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,448 INFO L93 Difference]: Finished difference Result 239 states and 267 transitions. [2022-02-20 23:48:42,448 INFO L276 IsEmpty]: Start isEmpty. Operand 239 states and 267 transitions. [2022-02-20 23:48:42,448 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,448 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,448 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:42,448 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:42,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 141 states have (on average 1.6666666666666667) internal successors, (235), 184 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:48:42,451 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 235 transitions. [2022-02-20 23:48:42,451 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 235 transitions. Word has length 24 [2022-02-20 23:48:42,451 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:42,451 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 235 transitions. [2022-02-20 23:48:42,451 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:42,451 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 235 transitions. [2022-02-20 23:48:42,452 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:48:42,452 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:42,452 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] [2022-02-20 23:48:42,452 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:48:42,452 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:42,452 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:42,453 INFO L85 PathProgramCache]: Analyzing trace with hash 611618329, now seen corresponding path program 1 times [2022-02-20 23:48:42,453 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:42,453 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418761796] [2022-02-20 23:48:42,453 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:42,453 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:42,477 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {8305#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {8305#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 2: Hoare triple {8305#true} main_#t~short4#1 := main_~c1~0#1 < 5; {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {8305#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {8305#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {8305#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {8305#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {8305#true} is VALID [2022-02-20 23:48:42,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {8305#true} assume main_~c1~0#1 < 2; {8305#true} is VALID [2022-02-20 23:48:42,510 INFO L290 TraceCheckUtils]: 8: Hoare triple {8305#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {8305#true} is VALID [2022-02-20 23:48:42,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {8305#true} assume main_~c1~0#1 < 4; {8305#true} is VALID [2022-02-20 23:48:42,510 INFO L290 TraceCheckUtils]: 10: Hoare triple {8305#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {8305#true} is VALID [2022-02-20 23:48:42,510 INFO L290 TraceCheckUtils]: 11: Hoare triple {8305#true} assume main_~c1~0#1 < 6; {8305#true} is VALID [2022-02-20 23:48:42,510 INFO L290 TraceCheckUtils]: 12: Hoare triple {8305#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {8305#true} is VALID [2022-02-20 23:48:42,511 INFO L290 TraceCheckUtils]: 13: Hoare triple {8305#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {8307#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,511 INFO L290 TraceCheckUtils]: 14: Hoare triple {8307#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {8307#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,511 INFO L290 TraceCheckUtils]: 15: Hoare triple {8307#(<= (+ |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: L554 {8307#(<= (+ |ULTIMATE.start_main_~lItem~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,512 INFO L290 TraceCheckUtils]: 16: Hoare triple {8307#(<= (+ |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; {8308#(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:48:42,512 INFO L290 TraceCheckUtils]: 17: Hoare triple {8308#(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: L550-1 {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,513 INFO L290 TraceCheckUtils]: 18: Hoare triple {8309#(<= (+ |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; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,513 INFO L290 TraceCheckUtils]: 19: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} main_#t~short4#1 := main_~c1~0#1 < 5; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,514 INFO L290 TraceCheckUtils]: 20: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,514 INFO L290 TraceCheckUtils]: 21: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,514 INFO L290 TraceCheckUtils]: 22: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,515 INFO L290 TraceCheckUtils]: 23: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,515 INFO L290 TraceCheckUtils]: 24: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,516 INFO L290 TraceCheckUtils]: 25: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,516 INFO L290 TraceCheckUtils]: 26: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~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; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,516 INFO L290 TraceCheckUtils]: 27: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~data~0#1.offset; {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:48:42,517 INFO L290 TraceCheckUtils]: 28: Hoare triple {8309#(<= (+ |ULTIMATE.start_main_~data~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~data~0#1.base < #StackHeapBarrier); {8306#false} is VALID [2022-02-20 23:48:42,517 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:42,517 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:42,517 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418761796] [2022-02-20 23:48:42,517 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418761796] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:42,517 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:42,517 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:42,518 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [97319450] [2022-02-20 23:48:42,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:42,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,518 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:42,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,535 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:48:42,535 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:42,535 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:42,536 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:42,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:42,536 INFO L87 Difference]: Start difference. First operand 185 states and 235 transitions. Second operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,859 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,859 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-02-20 23:48:42,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:42,859 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:42,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2022-02-20 23:48:42,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:42,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 248 transitions. [2022-02-20 23:48:42,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 248 transitions. [2022-02-20 23:48:43,020 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 248 edges. 248 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:43,023 INFO L225 Difference]: With dead ends: 238 [2022-02-20 23:48:43,023 INFO L226 Difference]: Without dead ends: 238 [2022-02-20 23:48:43,023 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:48:43,024 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 258 mSDsluCounter, 192 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 258 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:43,024 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [258 Valid, 352 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:43,024 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 238 states. [2022-02-20 23:48:43,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 238 to 186. [2022-02-20 23:48:43,026 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:43,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 238 states. Second operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,027 INFO L74 IsIncluded]: Start isIncluded. First operand 238 states. Second operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,027 INFO L87 Difference]: Start difference. First operand 238 states. Second operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,030 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,030 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-02-20 23:48:43,030 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2022-02-20 23:48:43,030 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,031 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 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 238 states. [2022-02-20 23:48:43,031 INFO L87 Difference]: Start difference. First operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 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 238 states. [2022-02-20 23:48:43,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,034 INFO L93 Difference]: Finished difference Result 238 states and 266 transitions. [2022-02-20 23:48:43,034 INFO L276 IsEmpty]: Start isEmpty. Operand 238 states and 266 transitions. [2022-02-20 23:48:43,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:43,035 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:43,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 142 states have (on average 1.6619718309859155) internal successors, (236), 185 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,037 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 236 transitions. [2022-02-20 23:48:43,037 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 236 transitions. Word has length 29 [2022-02-20 23:48:43,037 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:43,037 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 236 transitions. [2022-02-20 23:48:43,037 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.25) internal successors, (29), 5 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:48:43,037 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 236 transitions. [2022-02-20 23:48:43,038 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:48:43,038 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:43,038 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] [2022-02-20 23:48:43,038 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:48:43,038 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:43,039 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:43,039 INFO L85 PathProgramCache]: Analyzing trace with hash 610479294, now seen corresponding path program 1 times [2022-02-20 23:48:43,039 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:43,039 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [392194634] [2022-02-20 23:48:43,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:43,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:43,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,105 INFO L290 TraceCheckUtils]: 0: Hoare triple {9214#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 1: Hoare triple {9214#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 2: Hoare triple {9214#true} main_#t~short4#1 := main_~c1~0#1 < 5; {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {9214#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {9214#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 5: Hoare triple {9214#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 6: Hoare triple {9214#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {9214#true} is VALID [2022-02-20 23:48:43,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {9214#true} assume main_~c1~0#1 < 2; {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 8: Hoare triple {9214#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 9: Hoare triple {9214#true} assume main_~c1~0#1 < 4; {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 10: Hoare triple {9214#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {9214#true} assume main_~c1~0#1 < 6; {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 12: Hoare triple {9214#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 13: Hoare triple {9214#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {9214#true} is VALID [2022-02-20 23:48:43,107 INFO L290 TraceCheckUtils]: 14: Hoare triple {9214#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {9214#true} is VALID [2022-02-20 23:48:43,108 INFO L290 TraceCheckUtils]: 15: Hoare triple {9214#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: L554 {9216#(and (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= (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:48:43,108 INFO L290 TraceCheckUtils]: 16: Hoare triple {9216#(and (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= (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; {9217#(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|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= (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:48:43,109 INFO L290 TraceCheckUtils]: 17: Hoare triple {9217#(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|) (= (select |#valid| |ULTIMATE.start_main_~lItem~0#1.base|) 1) (= (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|))} 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: L550-1 {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,109 INFO L290 TraceCheckUtils]: 18: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 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; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,110 INFO L290 TraceCheckUtils]: 19: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} main_#t~short4#1 := main_~c1~0#1 < 5; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,110 INFO L290 TraceCheckUtils]: 20: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,110 INFO L290 TraceCheckUtils]: 21: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,111 INFO L290 TraceCheckUtils]: 22: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,111 INFO L290 TraceCheckUtils]: 23: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,111 INFO L290 TraceCheckUtils]: 24: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} assume !!(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,111 INFO L290 TraceCheckUtils]: 25: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L564 {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,119 INFO L290 TraceCheckUtils]: 26: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} is VALID [2022-02-20 23:48:43,120 INFO L290 TraceCheckUtils]: 27: Hoare triple {9218#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L565 {9219#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} is VALID [2022-02-20 23:48:43,120 INFO L290 TraceCheckUtils]: 28: Hoare triple {9219#(= (select |#valid| |ULTIMATE.start_main_#t~mem11#1.base|) 1)} assume !(1 == #valid[main_#t~mem11#1.base]); {9215#false} is VALID [2022-02-20 23:48:43,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:43,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:43,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [392194634] [2022-02-20 23:48:43,121 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [392194634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:43,121 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:43,121 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:43,121 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1084879146] [2022-02-20 23:48:43,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:43,122 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,122 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:43,122 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,137 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:48:43,138 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:43,138 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:43,138 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:43,139 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:43,139 INFO L87 Difference]: Start difference. First operand 186 states and 236 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,521 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-02-20 23:48:43,521 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:43,521 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,521 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:43,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:48:43,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 167 transitions. [2022-02-20 23:48:43,523 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 167 transitions. [2022-02-20 23:48:43,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 167 edges. 167 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:43,619 INFO L225 Difference]: With dead ends: 213 [2022-02-20 23:48:43,619 INFO L226 Difference]: Without dead ends: 213 [2022-02-20 23:48:43,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 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:48:43,620 INFO L933 BasicCegarLoop]: 122 mSDtfsCounter, 19 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 223 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 336 SdHoareTripleChecker+Invalid, 228 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 223 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:43,620 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 336 Invalid, 228 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 223 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 213 states. [2022-02-20 23:48:43,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 213 to 198. [2022-02-20 23:48:43,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:43,623 INFO L82 GeneralOperation]: Start isEquivalent. First operand 213 states. Second operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,623 INFO L74 IsIncluded]: Start isIncluded. First operand 213 states. Second operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,623 INFO L87 Difference]: Start difference. First operand 213 states. Second operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,626 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-02-20 23:48:43,626 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 266 transitions. [2022-02-20 23:48:43,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,626 INFO L74 IsIncluded]: Start isIncluded. First operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 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 213 states. [2022-02-20 23:48:43,627 INFO L87 Difference]: Start difference. First operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 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 213 states. [2022-02-20 23:48:43,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,629 INFO L93 Difference]: Finished difference Result 213 states and 266 transitions. [2022-02-20 23:48:43,629 INFO L276 IsEmpty]: Start isEmpty. Operand 213 states and 266 transitions. [2022-02-20 23:48:43,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:43,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:43,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:43,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:43,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 198 states, 154 states have (on average 1.6363636363636365) internal successors, (252), 197 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:43,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 198 states to 198 states and 252 transitions. [2022-02-20 23:48:43,633 INFO L78 Accepts]: Start accepts. Automaton has 198 states and 252 transitions. Word has length 29 [2022-02-20 23:48:43,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:43,633 INFO L470 AbstractCegarLoop]: Abstraction has 198 states and 252 transitions. [2022-02-20 23:48:43,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 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:48:43,633 INFO L276 IsEmpty]: Start isEmpty. Operand 198 states and 252 transitions. [2022-02-20 23:48:43,634 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:48:43,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:43,634 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] [2022-02-20 23:48:43,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:48:43,634 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:43,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:43,634 INFO L85 PathProgramCache]: Analyzing trace with hash 610479295, now seen corresponding path program 1 times [2022-02-20 23:48:43,635 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:43,635 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [542874671] [2022-02-20 23:48:43,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:43,635 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:43,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {10061#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 1: Hoare triple {10061#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 2: Hoare triple {10061#true} main_#t~short4#1 := main_~c1~0#1 < 5; {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 3: Hoare triple {10061#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 4: Hoare triple {10061#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 5: Hoare triple {10061#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {10061#true} is VALID [2022-02-20 23:48:43,741 INFO L290 TraceCheckUtils]: 6: Hoare triple {10061#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 7: Hoare triple {10061#true} assume main_~c1~0#1 < 2; {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 8: Hoare triple {10061#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 9: Hoare triple {10061#true} assume main_~c1~0#1 < 4; {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 10: Hoare triple {10061#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 11: Hoare triple {10061#true} assume main_~c1~0#1 < 6; {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 12: Hoare triple {10061#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 13: Hoare triple {10061#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {10061#true} is VALID [2022-02-20 23:48:43,742 INFO L290 TraceCheckUtils]: 14: Hoare triple {10061#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {10061#true} is VALID [2022-02-20 23:48:43,743 INFO L290 TraceCheckUtils]: 15: Hoare triple {10061#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: L554 {10063#(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:48:43,743 INFO L290 TraceCheckUtils]: 16: Hoare triple {10063#(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; {10064#(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:48:43,744 INFO L290 TraceCheckUtils]: 17: Hoare triple {10064#(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: L550-1 {10065#(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:48:43,744 INFO L290 TraceCheckUtils]: 18: Hoare triple {10065#(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; {10065#(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:48:43,745 INFO L290 TraceCheckUtils]: 19: Hoare triple {10065#(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_#t~short4#1 := main_~c1~0#1 < 5; {10065#(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:48:43,746 INFO L290 TraceCheckUtils]: 20: Hoare triple {10065#(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_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {10065#(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:48:43,746 INFO L290 TraceCheckUtils]: 21: Hoare triple {10065#(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_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {10065#(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:48:43,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {10065#(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); {10065#(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:48:43,747 INFO L290 TraceCheckUtils]: 23: Hoare triple {10065#(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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {10066#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|))} is VALID [2022-02-20 23:48:43,747 INFO L290 TraceCheckUtils]: 24: Hoare triple {10066#(and (= |ULTIMATE.start_main_#t~mem9#1.offset| |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_#t~mem9#1.base|))} assume !!(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {10062#false} is VALID [2022-02-20 23:48:43,747 INFO L290 TraceCheckUtils]: 25: Hoare triple {10062#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L564 {10062#false} is VALID [2022-02-20 23:48:43,747 INFO L290 TraceCheckUtils]: 26: Hoare triple {10062#false} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {10062#false} is VALID [2022-02-20 23:48:43,748 INFO L290 TraceCheckUtils]: 27: Hoare triple {10062#false} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L565 {10062#false} is VALID [2022-02-20 23:48:43,748 INFO L290 TraceCheckUtils]: 28: Hoare triple {10062#false} assume !(4 + (4 + main_#t~mem11#1.offset) <= #length[main_#t~mem11#1.base] && 0 <= 4 + main_#t~mem11#1.offset); {10062#false} is VALID [2022-02-20 23:48:43,748 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:43,748 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:43,748 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [542874671] [2022-02-20 23:48:43,748 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [542874671] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:43,748 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:43,748 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:43,748 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [777108926] [2022-02-20 23:48:43,748 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:43,749 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:43,749 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:43,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:43,764 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:48:43,764 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:43,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:43,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:43,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:43,765 INFO L87 Difference]: Start difference. First operand 198 states and 252 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:44,184 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,184 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-02-20 23:48:44,185 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:44,185 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:44,185 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:44,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:44,186 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 23:48:44,186 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:44,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 180 transitions. [2022-02-20 23:48:44,187 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 180 transitions. [2022-02-20 23:48:44,288 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:48:44,290 INFO L225 Difference]: With dead ends: 225 [2022-02-20 23:48:44,290 INFO L226 Difference]: Without dead ends: 225 [2022-02-20 23:48:44,291 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:48:44,291 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 36 mSDsluCounter, 375 mSDsCounter, 0 mSdLazyCounter, 195 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 506 SdHoareTripleChecker+Invalid, 198 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 195 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:44,291 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [36 Valid, 506 Invalid, 198 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 195 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:44,292 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 225 states. [2022-02-20 23:48:44,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 225 to 194. [2022-02-20 23:48:44,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:44,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 225 states. Second operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,294 INFO L74 IsIncluded]: Start isIncluded. First operand 225 states. Second operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,294 INFO L87 Difference]: Start difference. First operand 225 states. Second operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,301 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-02-20 23:48:44,301 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 279 transitions. [2022-02-20 23:48:44,301 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,301 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,302 INFO L74 IsIncluded]: Start isIncluded. First operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 225 states. [2022-02-20 23:48:44,302 INFO L87 Difference]: Start difference. First operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 225 states. [2022-02-20 23:48:44,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,305 INFO L93 Difference]: Finished difference Result 225 states and 279 transitions. [2022-02-20 23:48:44,305 INFO L276 IsEmpty]: Start isEmpty. Operand 225 states and 279 transitions. [2022-02-20 23:48:44,305 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,305 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,306 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:44,306 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:44,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 194 states, 150 states have (on average 1.64) internal successors, (246), 193 states have internal predecessors, (246), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 194 states to 194 states and 246 transitions. [2022-02-20 23:48:44,308 INFO L78 Accepts]: Start accepts. Automaton has 194 states and 246 transitions. Word has length 29 [2022-02-20 23:48:44,308 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:44,308 INFO L470 AbstractCegarLoop]: Abstraction has 194 states and 246 transitions. [2022-02-20 23:48:44,309 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 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:48:44,309 INFO L276 IsEmpty]: Start isEmpty. Operand 194 states and 246 transitions. [2022-02-20 23:48:44,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:44,311 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:44,311 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:48:44,311 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:48:44,311 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:44,311 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:44,311 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604246, now seen corresponding path program 1 times [2022-02-20 23:48:44,312 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:44,312 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919001582] [2022-02-20 23:48:44,312 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:44,312 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:44,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {10940#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {10940#true} is VALID [2022-02-20 23:48:44,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {10940#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {10940#true} is VALID [2022-02-20 23:48:44,484 INFO L290 TraceCheckUtils]: 2: Hoare triple {10940#true} main_#t~short4#1 := main_~c1~0#1 < 5; {10940#true} is VALID [2022-02-20 23:48:44,484 INFO L290 TraceCheckUtils]: 3: Hoare triple {10940#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {10940#true} is VALID [2022-02-20 23:48:44,485 INFO L290 TraceCheckUtils]: 4: Hoare triple {10940#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {10942#(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:48:44,485 INFO L290 TraceCheckUtils]: 5: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {10942#(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:48:44,490 INFO L290 TraceCheckUtils]: 6: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {10942#(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:48:44,490 INFO L290 TraceCheckUtils]: 7: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 2; {10942#(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:48:44,491 INFO L290 TraceCheckUtils]: 8: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {10942#(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:48:44,492 INFO L290 TraceCheckUtils]: 9: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 4; {10942#(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:48:44,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {10942#(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:48:44,493 INFO L290 TraceCheckUtils]: 11: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 6; {10942#(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:48:44,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {10942#(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:48:44,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {10942#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {10943#(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:48:44,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {10943#(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); {10943#(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:48:44,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {10943#(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: L554 {10943#(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:48:44,497 INFO L290 TraceCheckUtils]: 16: Hoare triple {10943#(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; {10944#(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) (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:48:44,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {10944#(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) (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))} 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: L550-1 {10945#(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:48:44,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {10945#(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; {10945#(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:48:44,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {10945#(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_#t~short4#1 := main_~c1~0#1 < 5; {10945#(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:48:44,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {10945#(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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {10945#(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:48:44,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {10945#(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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {10945#(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:48:44,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {10945#(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); {10945#(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:48:44,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {10945#(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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {10945#(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:48:44,501 INFO L290 TraceCheckUtils]: 24: Hoare triple {10945#(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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {10945#(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:48:44,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {10945#(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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {10946#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_#t~mem21#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:48:44,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {10946#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#valid| |ULTIMATE.start_main_#t~mem21#1.base|) 1) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~data~0#1.base|)))} 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; {10947#(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:48:44,502 INFO L290 TraceCheckUtils]: 27: Hoare triple {10947#(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; {10948#(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:48:44,503 INFO L290 TraceCheckUtils]: 28: Hoare triple {10948#(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; {10948#(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:48:44,503 INFO L290 TraceCheckUtils]: 29: Hoare triple {10948#(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); {10949#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:44,504 INFO L290 TraceCheckUtils]: 30: Hoare triple {10949#(= (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; {10949#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:48:44,504 INFO L290 TraceCheckUtils]: 31: Hoare triple {10949#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {10941#false} is VALID [2022-02-20 23:48:44,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:44,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:44,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919001582] [2022-02-20 23:48:44,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919001582] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:44,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:44,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:48:44,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650522581] [2022-02-20 23:48:44,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:44,505 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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:48:44,505 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:44,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:44,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:44,528 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:48:44,528 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:44,529 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:48:44,529 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:44,529 INFO L87 Difference]: Start difference. First operand 194 states and 246 transitions. Second operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,615 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,615 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-02-20 23:48:45,615 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:48:45,615 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 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:48:45,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:45,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,616 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2022-02-20 23:48:45,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 260 transitions. [2022-02-20 23:48:45,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 260 transitions. [2022-02-20 23:48:45,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:45,798 INFO L225 Difference]: With dead ends: 307 [2022-02-20 23:48:45,798 INFO L226 Difference]: Without dead ends: 307 [2022-02-20 23:48:45,799 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=89, Invalid=217, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:48:45,799 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 168 mSDsluCounter, 355 mSDsCounter, 0 mSdLazyCounter, 602 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 631 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 602 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:45,799 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 462 Invalid, 631 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 602 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:45,799 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 307 states. [2022-02-20 23:48:45,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 307 to 220. [2022-02-20 23:48:45,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:45,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 307 states. Second operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,802 INFO L74 IsIncluded]: Start isIncluded. First operand 307 states. Second operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,803 INFO L87 Difference]: Start difference. First operand 307 states. Second operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,807 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-02-20 23:48:45,807 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 374 transitions. [2022-02-20 23:48:45,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,807 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,807 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 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 307 states. [2022-02-20 23:48:45,808 INFO L87 Difference]: Start difference. First operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 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 307 states. [2022-02-20 23:48:45,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,815 INFO L93 Difference]: Finished difference Result 307 states and 374 transitions. [2022-02-20 23:48:45,815 INFO L276 IsEmpty]: Start isEmpty. Operand 307 states and 374 transitions. [2022-02-20 23:48:45,815 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,815 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,815 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:45,815 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:45,816 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5909090909090908) internal successors, (280), 219 states have internal predecessors, (280), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 280 transitions. [2022-02-20 23:48:45,818 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 280 transitions. Word has length 32 [2022-02-20 23:48:45,818 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:45,818 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 280 transitions. [2022-02-20 23:48:45,818 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 3.5555555555555554) internal successors, (32), 10 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:45,818 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 280 transitions. [2022-02-20 23:48:45,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:45,819 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:45,819 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:48:45,819 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:48:45,819 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:45,819 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:45,819 INFO L85 PathProgramCache]: Analyzing trace with hash 1470604247, now seen corresponding path program 1 times [2022-02-20 23:48:45,819 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:45,819 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1013300506] [2022-02-20 23:48:45,819 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:45,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:45,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:45,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {12109#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {12109#true} is VALID [2022-02-20 23:48:45,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {12109#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {12109#true} is VALID [2022-02-20 23:48:45,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {12109#true} main_#t~short4#1 := main_~c1~0#1 < 5; {12109#true} is VALID [2022-02-20 23:48:45,999 INFO L290 TraceCheckUtils]: 3: Hoare triple {12109#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {12109#true} is VALID [2022-02-20 23:48:45,999 INFO L290 TraceCheckUtils]: 4: Hoare triple {12109#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {12111#(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:48:46,000 INFO L290 TraceCheckUtils]: 5: Hoare triple {12111#(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); {12111#(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:48:46,000 INFO L290 TraceCheckUtils]: 6: Hoare triple {12111#(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: L540-2 {12112#(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:48:46,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {12112#(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 main_~c1~0#1 < 2; {12112#(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:48:46,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {12112#(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(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {12112#(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:48:46,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {12112#(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 main_~c1~0#1 < 4; {12112#(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:48:46,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {12112#(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(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {12112#(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:48:46,003 INFO L290 TraceCheckUtils]: 11: Hoare triple {12112#(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 main_~c1~0#1 < 6; {12112#(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:48:46,003 INFO L290 TraceCheckUtils]: 12: Hoare triple {12112#(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(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {12112#(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:48:46,004 INFO L290 TraceCheckUtils]: 13: Hoare triple {12112#(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))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {12113#(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:48:46,004 INFO L290 TraceCheckUtils]: 14: Hoare triple {12113#(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); {12113#(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:48:46,005 INFO L290 TraceCheckUtils]: 15: Hoare triple {12113#(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: L554 {12113#(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:48:46,005 INFO L290 TraceCheckUtils]: 16: Hoare triple {12113#(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; {12114#(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:48:46,006 INFO L290 TraceCheckUtils]: 17: Hoare triple {12114#(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: L550-1 {12115#(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:48:46,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {12115#(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; {12115#(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:48:46,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {12115#(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_#t~short4#1 := main_~c1~0#1 < 5; {12115#(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:48:46,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {12115#(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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {12115#(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:48:46,008 INFO L290 TraceCheckUtils]: 21: Hoare triple {12115#(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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {12115#(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:48:46,009 INFO L290 TraceCheckUtils]: 22: Hoare triple {12115#(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); {12115#(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:48:46,009 INFO L290 TraceCheckUtils]: 23: Hoare triple {12115#(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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {12115#(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:48:46,010 INFO L290 TraceCheckUtils]: 24: Hoare triple {12115#(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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {12115#(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:48:46,010 INFO L290 TraceCheckUtils]: 25: Hoare triple {12115#(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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {12116#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|)) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} is VALID [2022-02-20 23:48:46,011 INFO L290 TraceCheckUtils]: 26: Hoare triple {12116#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|)) (= |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; {12117#(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:48:46,011 INFO L290 TraceCheckUtils]: 27: Hoare triple {12117#(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; {12111#(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:48:46,011 INFO L290 TraceCheckUtils]: 28: Hoare triple {12111#(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; {12111#(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:48:46,012 INFO L290 TraceCheckUtils]: 29: Hoare triple {12111#(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); {12111#(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:48:46,012 INFO L290 TraceCheckUtils]: 30: Hoare triple {12111#(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; {12111#(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:48:46,013 INFO L290 TraceCheckUtils]: 31: Hoare triple {12111#(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); {12110#false} is VALID [2022-02-20 23:48:46,013 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:46,013 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:46,013 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1013300506] [2022-02-20 23:48:46,013 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1013300506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:46,013 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:46,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:48:46,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [519541423] [2022-02-20 23:48:46,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:46,014 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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:48:46,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:46,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:46,041 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:46,041 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:48:46,041 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:46,041 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:48:46,041 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:46,041 INFO L87 Difference]: Start difference. First operand 220 states and 280 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:46,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:46,923 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-02-20 23:48:46,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:48:46,923 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 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:48:46,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:46,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:46,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2022-02-20 23:48:46,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:46,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 266 transitions. [2022-02-20 23:48:46,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 266 transitions. [2022-02-20 23:48:47,112 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 266 edges. 266 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:47,115 INFO L225 Difference]: With dead ends: 309 [2022-02-20 23:48:47,115 INFO L226 Difference]: Without dead ends: 309 [2022-02-20 23:48:47,115 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=93, Invalid=213, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:48:47,116 INFO L933 BasicCegarLoop]: 89 mSDtfsCounter, 199 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 345 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 311 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 345 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:47,116 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 311 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 345 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:47,116 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 309 states. [2022-02-20 23:48:47,118 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 309 to 220. [2022-02-20 23:48:47,118 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:47,119 INFO L82 GeneralOperation]: Start isEquivalent. First operand 309 states. Second operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,119 INFO L74 IsIncluded]: Start isIncluded. First operand 309 states. Second operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,120 INFO L87 Difference]: Start difference. First operand 309 states. Second operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,124 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-02-20 23:48:47,124 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-02-20 23:48:47,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:47,125 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:47,125 INFO L74 IsIncluded]: Start isIncluded. First operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 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 309 states. [2022-02-20 23:48:47,125 INFO L87 Difference]: Start difference. First operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 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 309 states. [2022-02-20 23:48:47,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,131 INFO L93 Difference]: Finished difference Result 309 states and 374 transitions. [2022-02-20 23:48:47,131 INFO L276 IsEmpty]: Start isEmpty. Operand 309 states and 374 transitions. [2022-02-20 23:48:47,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:47,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:47,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:47,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:47,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 220 states, 176 states have (on average 1.5852272727272727) internal successors, (279), 219 states have internal predecessors, (279), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 220 states to 220 states and 279 transitions. [2022-02-20 23:48:47,134 INFO L78 Accepts]: Start accepts. Automaton has 220 states and 279 transitions. Word has length 32 [2022-02-20 23:48:47,134 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:47,134 INFO L470 AbstractCegarLoop]: Abstraction has 220 states and 279 transitions. [2022-02-20 23:48:47,134 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,134 INFO L276 IsEmpty]: Start isEmpty. Operand 220 states and 279 transitions. [2022-02-20 23:48:47,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:48:47,135 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:47,135 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, 1] [2022-02-20 23:48:47,135 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:48:47,135 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:47,135 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:47,135 INFO L85 PathProgramCache]: Analyzing trace with hash -1655909309, now seen corresponding path program 1 times [2022-02-20 23:48:47,136 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:47,136 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [325967685] [2022-02-20 23:48:47,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:47,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:47,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:47,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {13285#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {13285#true} is VALID [2022-02-20 23:48:47,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {13285#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {13285#true} is VALID [2022-02-20 23:48:47,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {13285#true} main_#t~short4#1 := main_~c1~0#1 < 5; {13285#true} is VALID [2022-02-20 23:48:47,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {13285#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {13285#true} is VALID [2022-02-20 23:48:47,244 INFO L290 TraceCheckUtils]: 4: Hoare triple {13285#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,244 INFO L290 TraceCheckUtils]: 5: Hoare triple {13287#(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); {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,244 INFO L290 TraceCheckUtils]: 6: Hoare triple {13287#(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: L540-2 {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,245 INFO L290 TraceCheckUtils]: 7: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume main_~c1~0#1 < 2; {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,245 INFO L290 TraceCheckUtils]: 8: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,245 INFO L290 TraceCheckUtils]: 9: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume main_~c1~0#1 < 4; {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,247 INFO L290 TraceCheckUtils]: 11: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} assume main_~c1~0#1 < 6; {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,247 INFO L290 TraceCheckUtils]: 12: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} is VALID [2022-02-20 23:48:47,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {13287#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (not (= |ULTIMATE.start_main_~item~0#1.base| 0)))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {13288#(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:48:47,248 INFO L290 TraceCheckUtils]: 14: Hoare triple {13288#(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); {13288#(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:48:47,249 INFO L290 TraceCheckUtils]: 15: Hoare triple {13288#(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: L554 {13288#(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:48:47,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {13288#(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; {13289#(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:48:47,250 INFO L290 TraceCheckUtils]: 17: Hoare triple {13289#(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: L550-1 {13290#(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:48:47,250 INFO L290 TraceCheckUtils]: 18: Hoare triple {13290#(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; {13290#(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:48:47,250 INFO L290 TraceCheckUtils]: 19: Hoare triple {13290#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0))} main_#t~short4#1 := main_~c1~0#1 < 5; {13290#(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:48:47,251 INFO L290 TraceCheckUtils]: 20: Hoare triple {13290#(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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {13290#(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:48:47,251 INFO L290 TraceCheckUtils]: 21: Hoare triple {13290#(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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {13290#(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:48:47,251 INFO L290 TraceCheckUtils]: 22: Hoare triple {13290#(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); {13290#(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:48:47,252 INFO L290 TraceCheckUtils]: 23: Hoare triple {13290#(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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {13290#(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:48:47,252 INFO L290 TraceCheckUtils]: 24: Hoare triple {13290#(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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {13290#(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:48:47,252 INFO L290 TraceCheckUtils]: 25: Hoare triple {13290#(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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {13291#(not (= |ULTIMATE.start_main_#t~mem21#1.base| 0))} is VALID [2022-02-20 23:48:47,253 INFO L290 TraceCheckUtils]: 26: Hoare triple {13291#(not (= |ULTIMATE.start_main_#t~mem21#1.base| 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; {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:47,253 INFO L290 TraceCheckUtils]: 27: Hoare triple {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume 0 == main_~data~0#1.offset; {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:47,253 INFO L290 TraceCheckUtils]: 28: Hoare triple {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume main_~data~0#1.base < #StackHeapBarrier; {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:47,253 INFO L290 TraceCheckUtils]: 29: Hoare triple {13292#(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); {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:47,254 INFO L290 TraceCheckUtils]: 30: Hoare triple {13292#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0); {13286#false} is VALID [2022-02-20 23:48:47,254 INFO L290 TraceCheckUtils]: 31: Hoare triple {13286#false} main_#res#1 := 0; {13286#false} is VALID [2022-02-20 23:48:47,254 INFO L290 TraceCheckUtils]: 32: Hoare triple {13286#false} assume !(#valid == main_old_#valid#1); {13286#false} is VALID [2022-02-20 23:48:47,254 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:47,255 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:47,255 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [325967685] [2022-02-20 23:48:47,255 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [325967685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:47,255 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:47,255 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:48:47,255 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459596568] [2022-02-20 23:48:47,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:47,255 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 23:48:47,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:47,256 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,274 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:47,274 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:47,274 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:47,274 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:47,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:47,274 INFO L87 Difference]: Start difference. First operand 220 states and 279 transitions. Second operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,695 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,695 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-02-20 23:48:47,696 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:47,696 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 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 33 [2022-02-20 23:48:47,696 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:47,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2022-02-20 23:48:47,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 183 transitions. [2022-02-20 23:48:47,698 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 183 transitions. [2022-02-20 23:48:47,808 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 183 edges. 183 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:47,810 INFO L225 Difference]: With dead ends: 254 [2022-02-20 23:48:47,810 INFO L226 Difference]: Without dead ends: 254 [2022-02-20 23:48:47,810 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:48:47,811 INFO L933 BasicCegarLoop]: 120 mSDtfsCounter, 67 mSDsluCounter, 384 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:47,811 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 504 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:47,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 254 states. [2022-02-20 23:48:47,813 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 254 to 226. [2022-02-20 23:48:47,813 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:47,814 INFO L82 GeneralOperation]: Start isEquivalent. First operand 254 states. Second operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,814 INFO L74 IsIncluded]: Start isIncluded. First operand 254 states. Second operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,814 INFO L87 Difference]: Start difference. First operand 254 states. Second operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,817 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-02-20 23:48:47,817 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 315 transitions. [2022-02-20 23:48:47,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:47,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:47,817 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 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 254 states. [2022-02-20 23:48:47,818 INFO L87 Difference]: Start difference. First operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 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 254 states. [2022-02-20 23:48:47,820 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:47,821 INFO L93 Difference]: Finished difference Result 254 states and 315 transitions. [2022-02-20 23:48:47,821 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 315 transitions. [2022-02-20 23:48:47,821 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:47,821 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:47,821 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:47,821 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:47,822 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 182 states have (on average 1.565934065934066) internal successors, (285), 225 states have internal predecessors, (285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 285 transitions. [2022-02-20 23:48:47,824 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 285 transitions. Word has length 33 [2022-02-20 23:48:47,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:47,824 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 285 transitions. [2022-02-20 23:48:47,824 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 4.125) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,825 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 285 transitions. [2022-02-20 23:48:47,825 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:48:47,825 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:47,825 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, 1, 1] [2022-02-20 23:48:47,825 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:48:47,825 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr62REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:47,826 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:47,826 INFO L85 PathProgramCache]: Analyzing trace with hash 206446071, now seen corresponding path program 1 times [2022-02-20 23:48:47,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:47,826 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757380734] [2022-02-20 23:48:47,826 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:47,826 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:47,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:47,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {14291#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {14291#true} is VALID [2022-02-20 23:48:47,875 INFO L290 TraceCheckUtils]: 1: Hoare triple {14291#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 2: Hoare triple {14291#true} main_#t~short4#1 := main_~c1~0#1 < 5; {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 3: Hoare triple {14291#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 4: Hoare triple {14291#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 5: Hoare triple {14291#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 6: Hoare triple {14291#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 7: Hoare triple {14291#true} assume main_~c1~0#1 < 2; {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 8: Hoare triple {14291#true} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {14291#true} is VALID [2022-02-20 23:48:47,876 INFO L290 TraceCheckUtils]: 9: Hoare triple {14291#true} assume main_~c1~0#1 < 4; {14291#true} is VALID [2022-02-20 23:48:47,877 INFO L290 TraceCheckUtils]: 10: Hoare triple {14291#true} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {14291#true} is VALID [2022-02-20 23:48:47,877 INFO L290 TraceCheckUtils]: 11: Hoare triple {14291#true} assume main_~c1~0#1 < 6; {14291#true} is VALID [2022-02-20 23:48:47,877 INFO L290 TraceCheckUtils]: 12: Hoare triple {14291#true} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {14291#true} is VALID [2022-02-20 23:48:47,877 INFO L290 TraceCheckUtils]: 13: Hoare triple {14291#true} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {14291#true} is VALID [2022-02-20 23:48:47,877 INFO L290 TraceCheckUtils]: 14: Hoare triple {14291#true} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {14291#true} is VALID [2022-02-20 23:48:47,881 INFO L290 TraceCheckUtils]: 15: Hoare triple {14291#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: L554 {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 16: Hoare triple {14291#true} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 17: Hoare triple {14291#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: L550-1 {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 18: Hoare triple {14291#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; {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 19: Hoare triple {14291#true} main_#t~short4#1 := main_~c1~0#1 < 5; {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 20: Hoare triple {14291#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {14291#true} is VALID [2022-02-20 23:48:47,882 INFO L290 TraceCheckUtils]: 21: Hoare triple {14291#true} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 22: Hoare triple {14291#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 23: Hoare triple {14291#true} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 24: Hoare triple {14291#true} assume !(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 25: Hoare triple {14291#true} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 26: Hoare triple {14291#true} 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; {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 27: Hoare triple {14291#true} assume 0 == main_~data~0#1.offset; {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 28: Hoare triple {14291#true} assume main_~data~0#1.base < #StackHeapBarrier; {14291#true} is VALID [2022-02-20 23:48:47,883 INFO L290 TraceCheckUtils]: 29: Hoare triple {14291#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); {14291#true} is VALID [2022-02-20 23:48:47,884 INFO L290 TraceCheckUtils]: 30: Hoare triple {14291#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; {14293#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|))} is VALID [2022-02-20 23:48:47,884 INFO L290 TraceCheckUtils]: 31: Hoare triple {14293#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {14294#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:48:47,885 INFO L290 TraceCheckUtils]: 32: Hoare triple {14294#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {14294#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} is VALID [2022-02-20 23:48:47,885 INFO L290 TraceCheckUtils]: 33: Hoare triple {14294#(= (select |#valid| |ULTIMATE.start_main_~item2~0#1.base|) 1)} assume !(1 == #valid[main_~item2~0#1.base]); {14292#false} is VALID [2022-02-20 23:48:47,885 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:48:47,885 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:47,885 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757380734] [2022-02-20 23:48:47,886 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757380734] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:47,886 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:47,886 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:47,886 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [994100467] [2022-02-20 23:48:47,886 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:47,886 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 [2022-02-20 23:48:47,887 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:47,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:47,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:47,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:47,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:47,903 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:47,903 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:47,903 INFO L87 Difference]: Start difference. First operand 226 states and 285 transitions. Second operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,224 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-02-20 23:48:48,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:48,225 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 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 34 [2022-02-20 23:48:48,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:48,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2022-02-20 23:48:48,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 205 transitions. [2022-02-20 23:48:48,227 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 205 transitions. [2022-02-20 23:48:48,348 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,351 INFO L225 Difference]: With dead ends: 299 [2022-02-20 23:48:48,351 INFO L226 Difference]: Without dead ends: 299 [2022-02-20 23:48:48,352 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:48:48,352 INFO L933 BasicCegarLoop]: 142 mSDtfsCounter, 92 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 205 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 265 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:48,352 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [92 Valid, 265 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 205 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:48,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 299 states. [2022-02-20 23:48:48,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 299 to 228. [2022-02-20 23:48:48,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:48,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 299 states. Second operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,356 INFO L74 IsIncluded]: Start isIncluded. First operand 299 states. Second operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,357 INFO L87 Difference]: Start difference. First operand 299 states. Second operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,360 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-02-20 23:48:48,360 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 378 transitions. [2022-02-20 23:48:48,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,361 INFO L74 IsIncluded]: Start isIncluded. First operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 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 299 states. [2022-02-20 23:48:48,361 INFO L87 Difference]: Start difference. First operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 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 299 states. [2022-02-20 23:48:48,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,365 INFO L93 Difference]: Finished difference Result 299 states and 378 transitions. [2022-02-20 23:48:48,365 INFO L276 IsEmpty]: Start isEmpty. Operand 299 states and 378 transitions. [2022-02-20 23:48:48,365 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,365 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:48,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:48,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 228 states, 188 states have (on average 1.5638297872340425) internal successors, (294), 227 states have internal predecessors, (294), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 228 states to 228 states and 294 transitions. [2022-02-20 23:48:48,368 INFO L78 Accepts]: Start accepts. Automaton has 228 states and 294 transitions. Word has length 34 [2022-02-20 23:48:48,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:48,368 INFO L470 AbstractCegarLoop]: Abstraction has 228 states and 294 transitions. [2022-02-20 23:48:48,368 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 10.666666666666666) internal successors, (32), 4 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,368 INFO L276 IsEmpty]: Start isEmpty. Operand 228 states and 294 transitions. [2022-02-20 23:48:48,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:48:48,369 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:48,369 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, 1, 1] [2022-02-20 23:48:48,369 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:48:48,370 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr63REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:48,370 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:48,370 INFO L85 PathProgramCache]: Analyzing trace with hash 206446072, now seen corresponding path program 1 times [2022-02-20 23:48:48,370 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:48,370 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012578909] [2022-02-20 23:48:48,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:48,370 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:48,405 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:48,583 INFO L290 TraceCheckUtils]: 0: Hoare triple {15424#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {15424#true} is VALID [2022-02-20 23:48:48,583 INFO L290 TraceCheckUtils]: 1: Hoare triple {15424#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {15424#true} is VALID [2022-02-20 23:48:48,584 INFO L290 TraceCheckUtils]: 2: Hoare triple {15424#true} main_#t~short4#1 := main_~c1~0#1 < 5; {15424#true} is VALID [2022-02-20 23:48:48,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {15424#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {15424#true} is VALID [2022-02-20 23:48:48,585 INFO L290 TraceCheckUtils]: 4: Hoare triple {15424#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {15426#(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:48:48,585 INFO L290 TraceCheckUtils]: 5: Hoare triple {15426#(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); {15426#(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:48:48,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {15426#(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: L540-2 {15427#(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:48:48,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {15427#(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 main_~c1~0#1 < 2; {15427#(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:48:48,589 INFO L290 TraceCheckUtils]: 8: Hoare triple {15427#(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(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {15427#(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:48:48,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {15427#(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 main_~c1~0#1 < 4; {15427#(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:48:48,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {15427#(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(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {15427#(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:48:48,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {15427#(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 main_~c1~0#1 < 6; {15427#(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:48:48,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {15427#(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(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {15427#(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:48:48,592 INFO L290 TraceCheckUtils]: 13: Hoare triple {15427#(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))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {15428#(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:48:48,592 INFO L290 TraceCheckUtils]: 14: Hoare triple {15428#(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); {15428#(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:48:48,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {15428#(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: L554 {15428#(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:48:48,593 INFO L290 TraceCheckUtils]: 16: Hoare triple {15428#(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; {15429#(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:48:48,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {15429#(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: L550-1 {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,595 INFO L290 TraceCheckUtils]: 18: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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; {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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_#t~short4#1 := main_~c1~0#1 < 5; {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,596 INFO L290 TraceCheckUtils]: 20: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,596 INFO L290 TraceCheckUtils]: 21: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,597 INFO L290 TraceCheckUtils]: 22: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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); {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,597 INFO L290 TraceCheckUtils]: 23: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,598 INFO L290 TraceCheckUtils]: 24: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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:48:48,598 INFO L290 TraceCheckUtils]: 25: Hoare triple {15430#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 8) (= 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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {15431#(and (= (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|) 8) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} is VALID [2022-02-20 23:48:48,599 INFO L290 TraceCheckUtils]: 26: Hoare triple {15431#(and (= (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|) 8) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |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; {15432#(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:48:48,599 INFO L290 TraceCheckUtils]: 27: Hoare triple {15432#(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; {15426#(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:48:48,599 INFO L290 TraceCheckUtils]: 28: Hoare triple {15426#(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; {15426#(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:48:48,600 INFO L290 TraceCheckUtils]: 29: Hoare triple {15426#(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); {15426#(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:48:48,600 INFO L290 TraceCheckUtils]: 30: Hoare triple {15426#(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; {15433#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (* |ULTIMATE.start_main_~item2~0#1.offset| (- 1)) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8))} is VALID [2022-02-20 23:48:48,601 INFO L290 TraceCheckUtils]: 31: Hoare triple {15433#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (* |ULTIMATE.start_main_~item2~0#1.offset| (- 1)) |ULTIMATE.start_main_~item~0#1.offset|) 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {15434#(and (<= |ULTIMATE.start_main_~item2~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|))} is VALID [2022-02-20 23:48:48,601 INFO L290 TraceCheckUtils]: 32: Hoare triple {15434#(and (<= |ULTIMATE.start_main_~item2~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {15434#(and (<= |ULTIMATE.start_main_~item2~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|))} is VALID [2022-02-20 23:48:48,602 INFO L290 TraceCheckUtils]: 33: Hoare triple {15434#(and (<= |ULTIMATE.start_main_~item2~0#1.offset| 0) (= (select |#length| |ULTIMATE.start_main_~item2~0#1.base|) 8) (<= 0 |ULTIMATE.start_main_~item2~0#1.offset|))} assume !(4 + (4 + main_~item2~0#1.offset) <= #length[main_~item2~0#1.base] && 0 <= 4 + main_~item2~0#1.offset); {15425#false} is VALID [2022-02-20 23:48:48,602 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:48,602 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:48,602 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012578909] [2022-02-20 23:48:48,602 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012578909] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:48,602 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:48,603 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:48:48,603 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903114835] [2022-02-20 23:48:48,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:48,604 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 23:48:48,604 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:48,604 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:48,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:48:48,628 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:48,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:48:48,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:48,630 INFO L87 Difference]: Start difference. First operand 228 states and 294 transitions. Second operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:49,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:49,791 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2022-02-20 23:48:49,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:48:49,792 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 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 34 [2022-02-20 23:48:49,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:49,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:49,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 277 transitions. [2022-02-20 23:48:49,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:49,794 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 277 transitions. [2022-02-20 23:48:49,794 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 277 transitions. [2022-02-20 23:48:49,992 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:49,995 INFO L225 Difference]: With dead ends: 328 [2022-02-20 23:48:49,995 INFO L226 Difference]: Without dead ends: 328 [2022-02-20 23:48:49,995 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=132, Invalid=420, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:48:49,996 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 226 mSDsluCounter, 305 mSDsCounter, 0 mSdLazyCounter, 526 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 567 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 526 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:49,996 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [226 Valid, 390 Invalid, 567 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 526 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:49,996 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 328 states. [2022-02-20 23:48:49,998 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 328 to 236. [2022-02-20 23:48:49,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:49,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 328 states. Second operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:49,999 INFO L74 IsIncluded]: Start isIncluded. First operand 328 states. Second operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:49,999 INFO L87 Difference]: Start difference. First operand 328 states. Second operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:50,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,003 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2022-02-20 23:48:50,003 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 402 transitions. [2022-02-20 23:48:50,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,004 INFO L74 IsIncluded]: Start isIncluded. First operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 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 328 states. [2022-02-20 23:48:50,004 INFO L87 Difference]: Start difference. First operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 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 328 states. [2022-02-20 23:48:50,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,010 INFO L93 Difference]: Finished difference Result 328 states and 402 transitions. [2022-02-20 23:48:50,010 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 402 transitions. [2022-02-20 23:48:50,010 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,010 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,010 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:50,011 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:50,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 236 states, 196 states have (on average 1.5510204081632653) internal successors, (304), 235 states have internal predecessors, (304), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:50,013 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 236 states to 236 states and 304 transitions. [2022-02-20 23:48:50,013 INFO L78 Accepts]: Start accepts. Automaton has 236 states and 304 transitions. Word has length 34 [2022-02-20 23:48:50,014 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:50,014 INFO L470 AbstractCegarLoop]: Abstraction has 236 states and 304 transitions. [2022-02-20 23:48:50,014 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.4) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:50,014 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 304 transitions. [2022-02-20 23:48:50,014 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2022-02-20 23:48:50,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:50,015 INFO L514 BasicCegarLoop]: trace histogram [2, 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, 1, 1, 1, 1, 1] [2022-02-20 23:48:50,015 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:48:50,015 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:48:50,015 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:50,015 INFO L85 PathProgramCache]: Analyzing trace with hash -1585985001, now seen corresponding path program 1 times [2022-02-20 23:48:50,015 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:50,015 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033322646] [2022-02-20 23:48:50,016 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:50,016 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:50,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,294 INFO L290 TraceCheckUtils]: 0: Hoare triple {16683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {16683#true} is VALID [2022-02-20 23:48:50,294 INFO L290 TraceCheckUtils]: 1: Hoare triple {16683#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:50,294 INFO L290 TraceCheckUtils]: 2: Hoare triple {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} main_#t~short4#1 := main_~c1~0#1 < 5; {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:50,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} is VALID [2022-02-20 23:48:50,295 INFO L290 TraceCheckUtils]: 4: Hoare triple {16685#(= |ULTIMATE.start_main_~c1~0#1| 0)} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16686#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|))} is VALID [2022-02-20 23:48:50,295 INFO L290 TraceCheckUtils]: 5: Hoare triple {16686#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {16686#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|))} is VALID [2022-02-20 23:48:50,296 INFO L290 TraceCheckUtils]: 6: Hoare triple {16686#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|))} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,296 INFO L290 TraceCheckUtils]: 7: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 2; {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,297 INFO L290 TraceCheckUtils]: 8: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,297 INFO L290 TraceCheckUtils]: 9: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 4; {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,298 INFO L290 TraceCheckUtils]: 10: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,298 INFO L290 TraceCheckUtils]: 11: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 6; {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,299 INFO L290 TraceCheckUtils]: 12: Hoare triple {16687#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 1 |ULTIMATE.start_main_~c1~0#1|) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {16688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:48:50,299 INFO L290 TraceCheckUtils]: 13: Hoare triple {16688#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|))) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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:48:50,300 INFO L290 TraceCheckUtils]: 14: Hoare triple {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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:48:50,300 INFO L290 TraceCheckUtils]: 15: Hoare triple {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L554 {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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:48:50,301 INFO L290 TraceCheckUtils]: 16: Hoare triple {16689#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~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))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {16690#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|))) (= 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:48:50,302 INFO L290 TraceCheckUtils]: 17: Hoare triple {16690#(and (= |ULTIMATE.start_main_~data~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|))) (= 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: L550-1 {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,302 INFO L290 TraceCheckUtils]: 18: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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; {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,303 INFO L290 TraceCheckUtils]: 19: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} main_#t~short4#1 := main_~c1~0#1 < 5; {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,303 INFO L290 TraceCheckUtils]: 20: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,304 INFO L290 TraceCheckUtils]: 21: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,304 INFO L290 TraceCheckUtils]: 22: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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); {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,305 INFO L290 TraceCheckUtils]: 23: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,305 INFO L290 TraceCheckUtils]: 24: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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:48:50,306 INFO L290 TraceCheckUtils]: 25: Hoare triple {16691#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {16692#(and (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_#t~mem21#1.base|) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} is VALID [2022-02-20 23:48:50,306 INFO L290 TraceCheckUtils]: 26: Hoare triple {16692#(and (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_#t~mem21#1.base|) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |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; {16693#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} is VALID [2022-02-20 23:48:50,307 INFO L290 TraceCheckUtils]: 27: Hoare triple {16693#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} assume 0 == main_~data~0#1.offset; {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} is VALID [2022-02-20 23:48:50,307 INFO L290 TraceCheckUtils]: 28: Hoare triple {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} assume main_~data~0#1.base < #StackHeapBarrier; {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} is VALID [2022-02-20 23:48:50,307 INFO L290 TraceCheckUtils]: 29: Hoare triple {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~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); {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} is VALID [2022-02-20 23:48:50,308 INFO L290 TraceCheckUtils]: 30: Hoare triple {16694#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4)))} 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; {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} is VALID [2022-02-20 23:48:50,308 INFO L290 TraceCheckUtils]: 31: Hoare triple {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} is VALID [2022-02-20 23:48:50,308 INFO L290 TraceCheckUtils]: 32: Hoare triple {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} is VALID [2022-02-20 23:48:50,309 INFO L290 TraceCheckUtils]: 33: Hoare triple {16695#(<= 6 (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)))} SUMMARY for call main_#t~mem23#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595 {16696#(<= 6 |ULTIMATE.start_main_#t~mem23#1|)} is VALID [2022-02-20 23:48:50,309 INFO L290 TraceCheckUtils]: 34: Hoare triple {16696#(<= 6 |ULTIMATE.start_main_#t~mem23#1|)} main_#t~short25#1 := main_#t~mem23#1 > 1; {16697#|ULTIMATE.start_main_#t~short25#1|} is VALID [2022-02-20 23:48:50,310 INFO L290 TraceCheckUtils]: 35: Hoare triple {16697#|ULTIMATE.start_main_#t~short25#1|} assume !main_#t~short25#1; {16684#false} is VALID [2022-02-20 23:48:50,310 INFO L290 TraceCheckUtils]: 36: Hoare triple {16684#false} assume !main_#t~short25#1;havoc main_#t~mem23#1;havoc main_#t~mem24#1;havoc main_#t~short25#1; {16684#false} is VALID [2022-02-20 23:48:50,310 INFO L290 TraceCheckUtils]: 37: Hoare triple {16684#false} 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; {16684#false} is VALID [2022-02-20 23:48:50,310 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#false} assume !(1 == #valid[main_~item~0#1.base]); {16684#false} is VALID [2022-02-20 23:48:50,311 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:50,311 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:50,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033322646] [2022-02-20 23:48:50,311 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033322646] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:48:50,311 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1428577453] [2022-02-20 23:48:50,311 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:50,312 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:48:50,312 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:50,313 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:48:50,318 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:48:50,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,415 INFO L263 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 60 conjunts are in the unsatisfiable core [2022-02-20 23:48:50,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,439 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:48:50,530 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:48:50,537 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:48:50,624 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,626 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,673 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,679 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,680 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,724 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,725 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:50,732 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:48:50,795 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:50,795 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:48:50,803 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:48:50,817 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 23:48:50,818 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:48:50,826 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 23:48:50,917 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:48:50,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 30 [2022-02-20 23:48:51,483 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:48:52,685 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:48:52,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:52,687 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:48:52,691 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:48:52,691 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 88 treesize of output 49 [2022-02-20 23:48:52,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:48:52,733 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:48:52,736 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:48:52,736 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 4 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 20 [2022-02-20 23:48:52,764 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:48:52,764 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:48:52,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {16683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {16683#true} is VALID [2022-02-20 23:48:52,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {16683#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {16683#true} is VALID [2022-02-20 23:48:52,853 INFO L290 TraceCheckUtils]: 2: Hoare triple {16683#true} main_#t~short4#1 := main_~c1~0#1 < 5; {16683#true} is VALID [2022-02-20 23:48:52,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {16683#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16683#true} is VALID [2022-02-20 23:48:52,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {16683#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16713#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:48:52,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {16713#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {16713#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:48:52,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {16713#(= |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: L540-2 {16720#(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:48:52,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {16720#(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 main_~c1~0#1 < 2; {16720#(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:48:52,855 INFO L290 TraceCheckUtils]: 8: Hoare triple {16720#(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(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {16720#(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:48:52,856 INFO L290 TraceCheckUtils]: 9: Hoare triple {16720#(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 main_~c1~0#1 < 4; {16720#(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:48:52,856 INFO L290 TraceCheckUtils]: 10: Hoare triple {16720#(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(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {16720#(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:48:52,857 INFO L290 TraceCheckUtils]: 11: Hoare triple {16720#(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 main_~c1~0#1 < 6; {16720#(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:48:52,858 INFO L290 TraceCheckUtils]: 12: Hoare triple {16720#(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(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {16720#(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:48:52,858 INFO L290 TraceCheckUtils]: 13: Hoare triple {16720#(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))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {16742#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~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:48:52,859 INFO L290 TraceCheckUtils]: 14: Hoare triple {16742#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~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 !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {16742#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~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:48:52,860 INFO L290 TraceCheckUtils]: 15: Hoare triple {16742#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~lItem~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~$Pointer$(main_~lItem~0#1.base, main_~lItem~0#1.offset, main_~lItem~0#1.base, main_~lItem~0#1.offset, 4); srcloc: L554 {16749#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.offset| 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|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:48:52,860 INFO L290 TraceCheckUtils]: 16: Hoare triple {16749#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |ULTIMATE.start_main_~item~0#1.offset| 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|) |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; {16753#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |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|) (= (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:48:52,861 INFO L290 TraceCheckUtils]: 17: Hoare triple {16753#(and (or (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0)) (= |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|) (= (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_~item~0#1.base, main_~item~0#1.offset, main_~lItem~0#1.base, 4 + main_~lItem~0#1.offset, 4); srcloc: L550-1 {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,862 INFO L290 TraceCheckUtils]: 18: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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; {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,862 INFO L290 TraceCheckUtils]: 19: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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_#t~short4#1 := main_~c1~0#1 < 5; {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,863 INFO L290 TraceCheckUtils]: 20: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,864 INFO L290 TraceCheckUtils]: 21: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,864 INFO L290 TraceCheckUtils]: 22: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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); {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,868 INFO L290 TraceCheckUtils]: 23: Hoare triple {16757#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {16776#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 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:48:52,869 INFO L290 TraceCheckUtils]: 24: Hoare triple {16776#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {16776#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 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:48:52,870 INFO L290 TraceCheckUtils]: 25: Hoare triple {16776#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {16783#(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_#t~mem21#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |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:48:52,870 INFO L290 TraceCheckUtils]: 26: Hoare triple {16783#(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_#t~mem21#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (<= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |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~mem21#1.base, main_#t~mem21#1.offset;havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {16787#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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:48:52,871 INFO L290 TraceCheckUtils]: 27: Hoare triple {16787#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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; {16791#(and (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|))) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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 (= |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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {16791#(and (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|))) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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 (= |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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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; {16791#(and (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|))) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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 (= |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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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:48:52,873 INFO L290 TraceCheckUtils]: 29: Hoare triple {16791#(and (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|))) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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 (= |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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (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); {16798#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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:48:52,875 INFO L290 TraceCheckUtils]: 30: Hoare triple {16798#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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; {16798#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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:48:52,876 INFO L290 TraceCheckUtils]: 31: Hoare triple {16798#(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 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= |ULTIMATE.start_main_~item~0#1.offset| (select (select |#memory_$Pointer$.offset| |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~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {16805#(and (= |ULTIMATE.start_main_#t~mem22#1.base| 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} is VALID [2022-02-20 23:48:52,876 INFO L290 TraceCheckUtils]: 32: Hoare triple {16805#(and (= |ULTIMATE.start_main_#t~mem22#1.base| 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:52,878 INFO L290 TraceCheckUtils]: 33: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call main_#t~mem23#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595 {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:52,878 INFO L290 TraceCheckUtils]: 34: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} main_#t~short25#1 := main_#t~mem23#1 > 1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:52,878 INFO L290 TraceCheckUtils]: 35: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !main_#t~short25#1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:52,879 INFO L290 TraceCheckUtils]: 36: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !main_#t~short25#1;havoc main_#t~mem23#1;havoc main_#t~mem24#1;havoc main_#t~short25#1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:48:52,879 INFO L290 TraceCheckUtils]: 37: Hoare triple {16809#(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; {16684#false} is VALID [2022-02-20 23:48:52,879 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#false} assume !(1 == #valid[main_~item~0#1.base]); {16684#false} is VALID [2022-02-20 23:48:52,879 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:52,879 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:48:52,961 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:49:02,871 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse5 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse3 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select .cse3 .cse4))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= .cse0 |c_ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse1 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse5 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse2 (select .cse1 .cse4))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse1) .cse0) .cse2) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse3) .cse0) .cse2) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0))))))) is different from false [2022-02-20 23:49:02,989 INFO L356 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2022-02-20 23:49:02,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, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 141 treesize of output 145 [2022-02-20 23:49:03,064 INFO L356 Elim1Store]: treesize reduction 20, result has 52.4 percent of original size [2022-02-20 23:49:03,064 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 253 treesize of output 234 [2022-02-20 23:49:05,431 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:05,431 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 34 treesize of output 34 [2022-02-20 23:49:05,612 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:05,613 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 27 treesize of output 31 [2022-02-20 23:49:05,785 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:05,785 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 34 treesize of output 34 [2022-02-20 23:49:05,957 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:05,958 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 27 treesize of output 31 [2022-02-20 23:49:06,272 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:06,272 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 34 treesize of output 34 [2022-02-20 23:49:06,716 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:06,717 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 27 treesize of output 31 [2022-02-20 23:49:07,483 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (or (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) (select v_arrayElimArr_1 .cse2)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse3 (select v_arrayElimArr_2 .cse4))) (or (= .cse3 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) (select v_arrayElimArr_1 .cse4)))))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) is different from false [2022-02-20 23:49:07,623 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:07,624 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 34 treesize of output 34 [2022-02-20 23:49:07,808 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:07,808 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 27 treesize of output 31 [2022-02-20 23:49:08,099 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:08,099 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 34 treesize of output 34 [2022-02-20 23:49:08,540 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:49:08,541 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 27 treesize of output 31 [2022-02-20 23:49:09,497 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:09,498 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-02-20 23:49:09,609 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:09,609 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-02-20 23:49:09,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:09,810 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 19 [2022-02-20 23:49:09,981 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:09,982 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 22 [2022-02-20 23:49:10,106 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)))))))))) is different from false [2022-02-20 23:49:10,427 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:10,428 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:10,520 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:10,521 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:11,033 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:11,034 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:11,160 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:11,161 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:11,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:11,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:11,919 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:11,920 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:12,176 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) is different from false [2022-02-20 23:49:12,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:12,416 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:12,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:12,529 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:12,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:12,942 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:13,106 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:13,106 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:13,654 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:13,654 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:13,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:13,745 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:14,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:14,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:14,323 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:14,324 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:14,840 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:14,841 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:14,933 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:14,934 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:15,365 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:15,366 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:15,564 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:15,566 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:16,048 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:16,048 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:16,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:16,146 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:16,605 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:16,606 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:16,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:16,765 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:17,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:17,223 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:17,352 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:17,353 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:17,803 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:17,803 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 42 treesize of output 32 [2022-02-20 23:49:17,965 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:49:17,965 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 29 [2022-02-20 23:49:18,409 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:49:18,425 INFO L356 Elim1Store]: treesize reduction 22, result has 4.3 percent of original size [2022-02-20 23:49:18,426 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 87 treesize of output 1 [2022-02-20 23:49:18,434 INFO L290 TraceCheckUtils]: 38: Hoare triple {16684#false} assume !(1 == #valid[main_~item~0#1.base]); {16684#false} is VALID [2022-02-20 23:49:18,435 INFO L290 TraceCheckUtils]: 37: Hoare triple {16809#(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; {16684#false} is VALID [2022-02-20 23:49:18,437 INFO L290 TraceCheckUtils]: 36: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !main_#t~short25#1;havoc main_#t~mem23#1;havoc main_#t~mem24#1;havoc main_#t~short25#1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:49:18,437 INFO L290 TraceCheckUtils]: 35: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !main_#t~short25#1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:49:18,437 INFO L290 TraceCheckUtils]: 34: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} main_#t~short25#1 := main_#t~mem23#1 > 1; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:49:18,438 INFO L290 TraceCheckUtils]: 33: Hoare triple {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call main_#t~mem23#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595 {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:49:18,438 INFO L290 TraceCheckUtils]: 32: Hoare triple {16805#(and (= |ULTIMATE.start_main_#t~mem22#1.base| 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {16809#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:49:18,439 INFO L290 TraceCheckUtils]: 31: Hoare triple {16849#(or (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)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {16805#(and (= |ULTIMATE.start_main_#t~mem22#1.base| 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} is VALID [2022-02-20 23:49:18,439 INFO L290 TraceCheckUtils]: 30: Hoare triple {16849#(or (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)))} 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; {16849#(or (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)))} is VALID [2022-02-20 23:49:18,440 INFO L290 TraceCheckUtils]: 29: Hoare triple {16856#(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)) (= |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); {16849#(or (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)))} is VALID [2022-02-20 23:49:18,440 INFO L290 TraceCheckUtils]: 28: Hoare triple {16856#(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)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} assume main_~data~0#1.base < #StackHeapBarrier; {16856#(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)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:49:18,441 INFO L290 TraceCheckUtils]: 27: Hoare triple {16863#(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)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} assume 0 == main_~data~0#1.offset; {16856#(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)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:49:18,441 INFO L290 TraceCheckUtils]: 26: Hoare triple {16867#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem21#1.base|) |ULTIMATE.start_main_#t~mem21#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem21#1.base|) |ULTIMATE.start_main_#t~mem21#1.offset|) 0)) (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~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; {16863#(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)) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:49:18,442 INFO L290 TraceCheckUtils]: 25: Hoare triple {16871#(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|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |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_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {16867#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem21#1.base|) |ULTIMATE.start_main_#t~mem21#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem21#1.base|) |ULTIMATE.start_main_#t~mem21#1.offset|) 0)) (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~data~0#1.base|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)))} is VALID [2022-02-20 23:49:18,442 INFO L290 TraceCheckUtils]: 24: Hoare triple {16871#(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|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))} assume !(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {16871#(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|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))} is VALID [2022-02-20 23:49:18,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {16871#(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|) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))} is VALID [2022-02-20 23:49:18,444 INFO L290 TraceCheckUtils]: 22: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |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); {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,446 INFO L290 TraceCheckUtils]: 20: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,447 INFO L290 TraceCheckUtils]: 19: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} main_#t~short4#1 := main_~c1~0#1 < 5; {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,449 INFO L290 TraceCheckUtils]: 18: Hoare triple {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |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; {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,450 INFO L290 TraceCheckUtils]: 17: Hoare triple {16897#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (= (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~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: L550-1 {16878#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 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|))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,452 INFO L290 TraceCheckUtils]: 16: Hoare triple {16901#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= |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 |ULTIMATE.start_main_~data~0#1.offset|))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (= (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {16897#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (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|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (= (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is VALID [2022-02-20 23:49:18,457 WARN L290 TraceCheckUtils]: 15: Hoare triple {16905#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)) |ULTIMATE.start_main_~item~0#1.offset|))))} 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: L554 {16901#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= |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 |ULTIMATE.start_main_~data~0#1.offset|))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (= (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|)) (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 |ULTIMATE.start_main_~data~0#1.offset|))) (select (store (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base|) (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4) |ULTIMATE.start_main_~item~0#1.offset|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0))))} is UNKNOWN [2022-02-20 23:49:18,460 WARN L290 TraceCheckUtils]: 14: Hoare triple {16905#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)) |ULTIMATE.start_main_~item~0#1.offset|))))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {16905#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,462 WARN L290 TraceCheckUtils]: 13: Hoare triple {16912#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {16905#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 (+ |ULTIMATE.start_main_~lItem~0#1.offset| 4)) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,468 WARN L290 TraceCheckUtils]: 12: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {16912#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (or (= (select (select (store |#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|)))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,471 WARN L290 TraceCheckUtils]: 11: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} assume main_~c1~0#1 < 6; {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,475 WARN L290 TraceCheckUtils]: 10: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,478 WARN L290 TraceCheckUtils]: 9: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} assume main_~c1~0#1 < 4; {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,482 WARN L290 TraceCheckUtils]: 8: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,485 WARN L290 TraceCheckUtils]: 7: Hoare triple {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} assume main_~c1~0#1 < 2; {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is UNKNOWN [2022-02-20 23:49:18,486 INFO L290 TraceCheckUtils]: 6: Hoare triple {16683#true} SUMMARY for call write~$Pointer$(0, 0, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L540-2 {16916#(forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (= |ULTIMATE.start_main_~item~0#1.base| (select v_arrayElimArr_2 4))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0) (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (or (= (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) |ULTIMATE.start_main_~lItem~0#1.base|) (= (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) (select v_arrayElimArr_2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (select v_arrayElimArr_1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= (select v_arrayElimArr_1 4) |ULTIMATE.start_main_~item~0#1.offset|))))} is VALID [2022-02-20 23:49:18,486 INFO L290 TraceCheckUtils]: 5: Hoare triple {16683#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {16683#true} is VALID [2022-02-20 23:49:18,486 INFO L290 TraceCheckUtils]: 4: Hoare triple {16683#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {16683#true} is VALID [2022-02-20 23:49:18,486 INFO L290 TraceCheckUtils]: 3: Hoare triple {16683#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {16683#true} is VALID [2022-02-20 23:49:18,486 INFO L290 TraceCheckUtils]: 2: Hoare triple {16683#true} main_#t~short4#1 := main_~c1~0#1 < 5; {16683#true} is VALID [2022-02-20 23:49:18,487 INFO L290 TraceCheckUtils]: 1: Hoare triple {16683#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {16683#true} is VALID [2022-02-20 23:49:18,487 INFO L290 TraceCheckUtils]: 0: Hoare triple {16683#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {16683#true} is VALID [2022-02-20 23:49:18,487 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:18,487 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1428577453] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:18,487 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:18,487 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 39 [2022-02-20 23:49:18,487 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [637048219] [2022-02-20 23:49:18,488 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:18,488 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 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 39 [2022-02-20 23:49:18,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:18,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:18,612 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 95 inductive. 0 not inductive. 9 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:18,612 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-02-20 23:49:18,612 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:18,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-02-20 23:49:18,613 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1071, Unknown=7, NotChecked=276, Total=1482 [2022-02-20 23:49:18,613 INFO L87 Difference]: Start difference. First operand 236 states and 304 transitions. Second operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:18,768 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) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))) (<= 1 |c_ULTIMATE.start_main_~c1~0#1|)) is different from false [2022-02-20 23:49:18,774 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) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (= (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) (= (select |c_#valid| |c_ULTIMATE.start_main_~item~0#1.base|) 1) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3))))))))))) is different from false [2022-02-20 23:49:18,780 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|)) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (or (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) (select v_arrayElimArr_1 .cse2)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse3 (select v_arrayElimArr_2 .cse4))) (or (= .cse3 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) (select v_arrayElimArr_1 .cse4)))))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (= (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:49:20,116 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_main_~lItem~0#1.base| |c_ULTIMATE.start_main_~item~0#1.base|))) (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (not .cse0) (<= 6 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~item~0#1.base|) (+ |c_ULTIMATE.start_main_~item~0#1.offset| 4))) (or (= (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) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int)) (let ((.cse6 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (let ((.cse4 (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.base|)) (.cse5 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select .cse4 .cse5))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (= .cse1 |c_ULTIMATE.start_main_~lItem~0#1.base|) (let ((.cse2 (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base|) .cse6 |c_ULTIMATE.start_main_~item~0#1.offset|))) (let ((.cse3 (select .cse2 .cse5))) (and (= (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse2) .cse1) .cse3) 0) (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~lItem~0#1.base| .cse4) .cse1) .cse3) 0)))) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0))))))) (or (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) .cse0))) is different from false [2022-02-20 23:49:20,710 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse3 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~data~0#1.base|))) (let ((.cse1 (select .cse3 4))) (let ((.cse2 (= .cse1 |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~data~0#1.base|)) (.cse4 (+ |c_ULTIMATE.start_main_~data~0#1.offset| 4))) (and (= (select .cse0 4) 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (or (= (select (select |c_#memory_$Pointer$.base| .cse1) 0) 0) .cse2) (= |c_ULTIMATE.start_main_~data~0#1.offset| 0) (<= 0 |c_ULTIMATE.start_main_~data~0#1.offset|) (<= 6 (select (select |c_#memory_int| (select .cse3 .cse4)) 4)) (= (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) (or (= (select (select |c_#memory_$Pointer$.offset| .cse1) 0) 0) .cse2) (= (select .cse0 .cse4) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse6 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse5 (select v_arrayElimArr_2 .cse6))) (or (= .cse5 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse5) (select v_arrayElimArr_1 .cse6))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse8 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse7 (select v_arrayElimArr_2 .cse8))) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse7) (select v_arrayElimArr_1 .cse8)) 0) (= .cse7 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))))))))) is different from false [2022-02-20 23:49:20,741 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 ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_611 Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (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_611)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1))))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int) (v_ArrVal_613 Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= (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_613)) |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3)) 0) (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|)))))) (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4)))))) is different from false [2022-02-20 23:49:25,232 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 ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 4) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 4))) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse1 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse0 (select v_arrayElimArr_2 .cse1))) (or (= .cse0 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse0) (select v_arrayElimArr_1 .cse1)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse3 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse2 (select v_arrayElimArr_2 .cse3))) (or (= .cse2 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse2) (select v_arrayElimArr_1 .cse3))))))))))) is different from false [2022-02-20 23:49:25,276 WARN L838 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~item~0#1.base|) |c_ULTIMATE.start_main_~item~0#1.offset|) 0) (forall ((|ULTIMATE.start_main_~data~0#1.offset| Int) (v_arrayElimArr_2 (Array Int Int)) (v_arrayElimArr_1 (Array Int Int))) (let ((.cse0 (+ 4 |c_ULTIMATE.start_main_~lItem~0#1.offset|))) (or (not (<= 0 |ULTIMATE.start_main_~data~0#1.offset|)) (not (= (select v_arrayElimArr_2 .cse0) |c_ULTIMATE.start_main_~item~0#1.base|)) (not (<= |ULTIMATE.start_main_~data~0#1.offset| 0)) (and (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse2 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse1 (select v_arrayElimArr_2 .cse2))) (or (= .cse1 |ULTIMATE.start_main_~lItem~0#1.base|) (= (select (select (store |c_#memory_$Pointer$.base| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_2) .cse1) (select v_arrayElimArr_1 .cse2)) 0))))) (forall ((|ULTIMATE.start_main_~lItem~0#1.base| Int)) (let ((.cse4 (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) (let ((.cse3 (select v_arrayElimArr_2 .cse4))) (or (= .cse3 |ULTIMATE.start_main_~lItem~0#1.base|) (= 0 (select (select (store |c_#memory_$Pointer$.offset| |ULTIMATE.start_main_~lItem~0#1.base| v_arrayElimArr_1) .cse3) (select v_arrayElimArr_1 .cse4)))))))) (not (= |c_ULTIMATE.start_main_~item~0#1.offset| (select v_arrayElimArr_1 .cse0)))))) (= (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:49:26,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:26,923 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-02-20 23:49:26,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 23:49:26,923 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 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 39 [2022-02-20 23:49:26,923 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:26,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:26,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 196 transitions. [2022-02-20 23:49:26,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:26,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 196 transitions. [2022-02-20 23:49:26,925 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 196 transitions. [2022-02-20 23:49:27,081 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:49:27,083 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:49:27,083 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:49:27,084 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 58 SyntacticMatches, 3 SemanticMatches, 58 ConstructedPredicates, 12 IntricatePredicates, 0 DeprecatedPredicates, 443 ImplicationChecksByTransitivity, 15.4s TimeCoverageRelationStatistics Valid=291, Invalid=1998, Unknown=15, NotChecked=1236, Total=3540 [2022-02-20 23:49:27,084 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 155 mSDsluCounter, 1833 mSDsCounter, 0 mSdLazyCounter, 957 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 1932 SdHoareTripleChecker+Invalid, 1605 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 957 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 618 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:27,084 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 1932 Invalid, 1605 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 957 Invalid, 0 Unknown, 618 Unchecked, 0.7s Time] [2022-02-20 23:49:27,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:49:27,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 248. [2022-02-20 23:49:27,087 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:27,087 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,088 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,088 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:27,091 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-02-20 23:49:27,091 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2022-02-20 23:49:27,091 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:27,091 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:27,091 INFO L74 IsIncluded]: Start isIncluded. First operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-20 23:49:27,092 INFO L87 Difference]: Start difference. First operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 258 states. [2022-02-20 23:49:27,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:27,094 INFO L93 Difference]: Finished difference Result 258 states and 327 transitions. [2022-02-20 23:49:27,094 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 327 transitions. [2022-02-20 23:49:27,095 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:27,095 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:27,095 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:27,095 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:27,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 248 states, 208 states have (on average 1.5288461538461537) internal successors, (318), 247 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 248 states to 248 states and 318 transitions. [2022-02-20 23:49:27,098 INFO L78 Accepts]: Start accepts. Automaton has 248 states and 318 transitions. Word has length 39 [2022-02-20 23:49:27,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:27,098 INFO L470 AbstractCegarLoop]: Abstraction has 248 states and 318 transitions. [2022-02-20 23:49:27,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 2.6666666666666665) internal successors, (104), 39 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,098 INFO L276 IsEmpty]: Start isEmpty. Operand 248 states and 318 transitions. [2022-02-20 23:49:27,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2022-02-20 23:49:27,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:27,099 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, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:27,118 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:49:27,315 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:27,315 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr67ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:49:27,316 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:27,316 INFO L85 PathProgramCache]: Analyzing trace with hash 394802097, now seen corresponding path program 1 times [2022-02-20 23:49:27,316 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:27,316 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1930248391] [2022-02-20 23:49:27,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:27,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:27,339 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:27,438 INFO L290 TraceCheckUtils]: 0: Hoare triple {18022#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {18022#true} is VALID [2022-02-20 23:49:27,438 INFO L290 TraceCheckUtils]: 1: Hoare triple {18022#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {18022#true} is VALID [2022-02-20 23:49:27,438 INFO L290 TraceCheckUtils]: 2: Hoare triple {18022#true} main_#t~short4#1 := main_~c1~0#1 < 5; {18022#true} is VALID [2022-02-20 23:49:27,438 INFO L290 TraceCheckUtils]: 3: Hoare triple {18022#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {18022#true} is VALID [2022-02-20 23:49:27,439 INFO L290 TraceCheckUtils]: 4: Hoare triple {18022#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,439 INFO L290 TraceCheckUtils]: 5: Hoare triple {18024#(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); {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {18024#(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: L540-2 {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} assume main_~c1~0#1 < 2; {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,441 INFO L290 TraceCheckUtils]: 8: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,441 INFO L290 TraceCheckUtils]: 9: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} assume main_~c1~0#1 < 4; {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,442 INFO L290 TraceCheckUtils]: 10: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,442 INFO L290 TraceCheckUtils]: 11: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} assume main_~c1~0#1 < 6; {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,443 INFO L290 TraceCheckUtils]: 12: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,443 INFO L290 TraceCheckUtils]: 13: Hoare triple {18024#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~item~0#1.offset| 0))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {18025#(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:49:27,444 INFO L290 TraceCheckUtils]: 14: Hoare triple {18025#(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); {18025#(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:49:27,444 INFO L290 TraceCheckUtils]: 15: Hoare triple {18025#(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: L554 {18025#(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:49:27,445 INFO L290 TraceCheckUtils]: 16: Hoare triple {18025#(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; {18026#(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) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0))} is VALID [2022-02-20 23:49:27,445 INFO L290 TraceCheckUtils]: 17: Hoare triple {18026#(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) (= 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: L550-1 {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,446 INFO L290 TraceCheckUtils]: 18: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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; {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,446 INFO L290 TraceCheckUtils]: 19: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 1) |#StackHeapBarrier|))} main_#t~short4#1 := main_~c1~0#1 < 5; {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,447 INFO L290 TraceCheckUtils]: 20: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,447 INFO L290 TraceCheckUtils]: 21: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,448 INFO L290 TraceCheckUtils]: 22: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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); {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,448 INFO L290 TraceCheckUtils]: 23: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,448 INFO L290 TraceCheckUtils]: 24: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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:49:27,449 INFO L290 TraceCheckUtils]: 25: Hoare triple {18027#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= (+ (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~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {18028#(and (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 1) |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:49:27,449 INFO L290 TraceCheckUtils]: 26: Hoare triple {18028#(and (<= (+ |ULTIMATE.start_main_#t~mem21#1.base| 1) |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~data~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; {18029#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:49:27,450 INFO L290 TraceCheckUtils]: 27: Hoare triple {18029#(and (<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume 0 == main_~data~0#1.offset; {18030#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,450 INFO L290 TraceCheckUtils]: 28: Hoare triple {18030#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} assume main_~data~0#1.base < #StackHeapBarrier; {18030#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,450 INFO L290 TraceCheckUtils]: 29: Hoare triple {18030#(<= (+ |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); {18030#(<= (+ |ULTIMATE.start_main_~item~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,451 INFO L290 TraceCheckUtils]: 30: Hoare triple {18030#(<= (+ |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; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,451 INFO L290 TraceCheckUtils]: 31: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,451 INFO L290 TraceCheckUtils]: 32: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,452 INFO L290 TraceCheckUtils]: 33: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem23#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595 {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,452 INFO L290 TraceCheckUtils]: 34: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} main_#t~short25#1 := main_#t~mem23#1 > 1; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,452 INFO L290 TraceCheckUtils]: 35: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume main_#t~short25#1; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,452 INFO L290 TraceCheckUtils]: 36: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem24#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595-3 {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,453 INFO L290 TraceCheckUtils]: 37: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} main_#t~short25#1 := main_#t~mem24#1 < 15; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,453 INFO L290 TraceCheckUtils]: 38: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume main_#t~short25#1;havoc main_#t~mem23#1;havoc main_#t~mem24#1;havoc main_#t~short25#1; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,453 INFO L290 TraceCheckUtils]: 39: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~item2~0#1.offset; {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:49:27,454 INFO L290 TraceCheckUtils]: 40: Hoare triple {18031#(<= (+ |ULTIMATE.start_main_~item2~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~item2~0#1.base < #StackHeapBarrier); {18023#false} is VALID [2022-02-20 23:49:27,454 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:27,454 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:27,455 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1930248391] [2022-02-20 23:49:27,455 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1930248391] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:27,455 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:27,455 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:49:27,455 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432408226] [2022-02-20 23:49:27,455 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:27,457 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 23:49:27,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:27,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:27,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:27,485 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:49:27,485 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:27,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:49:27,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:27,486 INFO L87 Difference]: Start difference. First operand 248 states and 318 transitions. Second operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:28,596 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2022-02-20 23:49:28,597 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:49:28,597 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 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 41 [2022-02-20 23:49:28,597 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:28,597 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,598 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 277 transitions. [2022-02-20 23:49:28,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 277 transitions. [2022-02-20 23:49:28,599 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 277 transitions. [2022-02-20 23:49:28,788 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 277 edges. 277 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:28,792 INFO L225 Difference]: With dead ends: 342 [2022-02-20 23:49:28,792 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 23:49:28,792 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=92, Invalid=250, Unknown=0, NotChecked=0, Total=342 [2022-02-20 23:49:28,792 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 198 mSDsluCounter, 524 mSDsCounter, 0 mSdLazyCounter, 548 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 198 SdHoareTripleChecker+Valid, 627 SdHoareTripleChecker+Invalid, 576 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 548 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:28,793 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [198 Valid, 627 Invalid, 576 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 548 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:49:28,793 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 23:49:28,795 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 249. [2022-02-20 23:49:28,795 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:28,796 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,796 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,796 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:28,800 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2022-02-20 23:49:28,800 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 417 transitions. [2022-02-20 23:49:28,801 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:28,801 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:28,801 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 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 342 states. [2022-02-20 23:49:28,801 INFO L87 Difference]: Start difference. First operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 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 342 states. [2022-02-20 23:49:28,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:28,805 INFO L93 Difference]: Finished difference Result 342 states and 417 transitions. [2022-02-20 23:49:28,805 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 417 transitions. [2022-02-20 23:49:28,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:28,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:28,806 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:28,806 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:28,806 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5215311004784688) internal successors, (318), 248 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 318 transitions. [2022-02-20 23:49:28,809 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 318 transitions. Word has length 41 [2022-02-20 23:49:28,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:28,809 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 318 transitions. [2022-02-20 23:49:28,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 4.555555555555555) internal successors, (41), 10 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:28,809 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 318 transitions. [2022-02-20 23:49:28,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2022-02-20 23:49:28,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:28,810 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:28,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:49:28,810 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:49:28,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:28,811 INFO L85 PathProgramCache]: Analyzing trace with hash -645822017, now seen corresponding path program 1 times [2022-02-20 23:49:28,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:28,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1474590364] [2022-02-20 23:49:28,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:28,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:28,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:29,097 INFO L290 TraceCheckUtils]: 0: Hoare triple {19327#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(14, 2); {19327#true} is VALID [2022-02-20 23:49:29,097 INFO L290 TraceCheckUtils]: 1: Hoare triple {19327#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post5#1, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem8#1.base, main_#t~mem8#1.offset, main_#t~nondet3#1, main_#t~short4#1, 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.base, main_#t~mem14#1.offset, main_#t~mem15#1, main_#t~mem16#1, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_~dst~0#1.base, main_~dst~0#1.offset, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1, main_#t~mem24#1, main_#t~short25#1, 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_~c1~0#1;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;main_~c1~0#1 := 0; {19327#true} is VALID [2022-02-20 23:49:29,097 INFO L290 TraceCheckUtils]: 2: Hoare triple {19327#true} main_#t~short4#1 := main_~c1~0#1 < 5; {19327#true} is VALID [2022-02-20 23:49:29,097 INFO L290 TraceCheckUtils]: 3: Hoare triple {19327#true} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {19327#true} is VALID [2022-02-20 23:49:29,097 INFO L290 TraceCheckUtils]: 4: Hoare triple {19327#true} assume !!main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1;main_#t~post5#1 := main_~c1~0#1;main_~c1~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset; {19329#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:49:29,098 INFO L290 TraceCheckUtils]: 5: Hoare triple {19329#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {19329#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:49:29,098 INFO L290 TraceCheckUtils]: 6: Hoare triple {19329#(= |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: L540-2 {19330#(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:49:29,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {19330#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 2; {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,099 INFO L290 TraceCheckUtils]: 8: Hoare triple {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L544 {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,100 INFO L290 TraceCheckUtils]: 9: Hoare triple {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 4; {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,100 INFO L290 TraceCheckUtils]: 10: Hoare triple {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(2 + main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L546 {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,101 INFO L290 TraceCheckUtils]: 11: Hoare triple {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} assume main_~c1~0#1 < 6; {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,101 INFO L290 TraceCheckUtils]: 12: Hoare triple {19331#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} SUMMARY for call write~int(4 + 2 * main_~c1~0#1, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L548 {19332#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} is VALID [2022-02-20 23:49:29,102 INFO L290 TraceCheckUtils]: 13: Hoare triple {19332#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)) (= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1))} call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8);main_~lItem~0#1.base, main_~lItem~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset; {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} is VALID [2022-02-20 23:49:29,102 INFO L290 TraceCheckUtils]: 14: Hoare triple {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} assume !(main_~data~0#1.base != 0 || main_~data~0#1.offset != 0); {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} is VALID [2022-02-20 23:49:29,103 INFO L290 TraceCheckUtils]: 15: Hoare triple {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 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: L554 {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} is VALID [2022-02-20 23:49:29,104 INFO L290 TraceCheckUtils]: 16: Hoare triple {19333#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} main_~data~0#1.base, main_~data~0#1.offset := main_~lItem~0#1.base, main_~lItem~0#1.offset; {19334#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} is VALID [2022-02-20 23:49:29,105 INFO L290 TraceCheckUtils]: 17: Hoare triple {19334#(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_~c1~0#1| 1) (= |ULTIMATE.start_main_~lItem~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) (+ 4 |ULTIMATE.start_main_~item~0#1.offset|)) (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4)))} 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: L550-1 {19335#(and (= (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= 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:49:29,105 INFO L290 TraceCheckUtils]: 18: Hoare triple {19335#(and (= (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= 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; {19335#(and (= (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= 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:49:29,106 INFO L290 TraceCheckUtils]: 19: Hoare triple {19335#(and (= (+ (* |ULTIMATE.start_main_~c1~0#1| 2) 4) (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4)) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (<= |ULTIMATE.start_main_~c1~0#1| 1) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} main_#t~short4#1 := main_~c1~0#1 < 5; {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,106 INFO L290 TraceCheckUtils]: 20: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} assume main_#t~short4#1;assume -2147483648 <= main_#t~nondet3#1 && main_#t~nondet3#1 <= 2147483647;main_#t~short4#1 := 0 != main_#t~nondet3#1; {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,107 INFO L290 TraceCheckUtils]: 21: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} assume !main_#t~short4#1;havoc main_#t~nondet3#1;havoc main_#t~short4#1; {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,107 INFO L290 TraceCheckUtils]: 22: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0); {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,108 INFO L290 TraceCheckUtils]: 23: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} SUMMARY for call main_#t~mem9#1.base, main_#t~mem9#1.offset := read~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, 4); srcloc: L563-3 {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,109 INFO L290 TraceCheckUtils]: 24: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} assume !(main_#t~mem9#1.base != main_~data~0#1.base || main_#t~mem9#1.offset != main_~data~0#1.offset);havoc main_#t~mem9#1.base, main_#t~mem9#1.offset; {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} is VALID [2022-02-20 23:49:29,109 INFO L290 TraceCheckUtils]: 25: Hoare triple {19336#(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|))) (<= (select (select |#memory_int| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))) 4) 6))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~data~0#1.base, 4 + main_~data~0#1.offset, 4); srcloc: L563-4 {19337#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem21#1.base|) 4) 6))} is VALID [2022-02-20 23:49:29,109 INFO L290 TraceCheckUtils]: 26: Hoare triple {19337#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_#t~mem21#1.base|) 4) 6))} 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; {19338#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} is VALID [2022-02-20 23:49:29,110 INFO L290 TraceCheckUtils]: 27: Hoare triple {19338#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6) (= 0 |ULTIMATE.start_main_~data~0#1.offset|))} assume 0 == main_~data~0#1.offset; {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} is VALID [2022-02-20 23:49:29,110 INFO L290 TraceCheckUtils]: 28: Hoare triple {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} assume main_~data~0#1.base < #StackHeapBarrier; {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} is VALID [2022-02-20 23:49:29,111 INFO L290 TraceCheckUtils]: 29: Hoare triple {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} 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); {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} is VALID [2022-02-20 23:49:29,111 INFO L290 TraceCheckUtils]: 30: Hoare triple {19339#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_main_~item~0#1.base|) 4) 6))} 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; {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} is VALID [2022-02-20 23:49:29,111 INFO L290 TraceCheckUtils]: 31: Hoare triple {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L594 {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} is VALID [2022-02-20 23:49:29,112 INFO L290 TraceCheckUtils]: 32: Hoare triple {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} main_~item~0#1.base, main_~item~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} is VALID [2022-02-20 23:49:29,112 INFO L290 TraceCheckUtils]: 33: Hoare triple {19340#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 6)} SUMMARY for call main_#t~mem23#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595 {19341#(and (<= |ULTIMATE.start_main_#t~mem23#1| 14) (= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem23#1|))} is VALID [2022-02-20 23:49:29,113 INFO L290 TraceCheckUtils]: 34: Hoare triple {19341#(and (<= |ULTIMATE.start_main_#t~mem23#1| 14) (= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) |ULTIMATE.start_main_#t~mem23#1|))} main_#t~short25#1 := main_#t~mem23#1 > 1; {19342#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 14)} is VALID [2022-02-20 23:49:29,113 INFO L290 TraceCheckUtils]: 35: Hoare triple {19342#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 14)} assume main_#t~short25#1; {19342#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 14)} is VALID [2022-02-20 23:49:29,113 INFO L290 TraceCheckUtils]: 36: Hoare triple {19342#(<= (select (select |#memory_int| |ULTIMATE.start_main_~item2~0#1.base|) (+ |ULTIMATE.start_main_~item2~0#1.offset| 4)) 14)} SUMMARY for call main_#t~mem24#1 := read~int(main_~item2~0#1.base, 4 + main_~item2~0#1.offset, 4); srcloc: L595-3 {19343#(<= |ULTIMATE.start_main_#t~mem24#1| 14)} is VALID [2022-02-20 23:49:29,114 INFO L290 TraceCheckUtils]: 37: Hoare triple {19343#(<= |ULTIMATE.start_main_#t~mem24#1| 14)} main_#t~short25#1 := main_#t~mem24#1 < 15; {19344#|ULTIMATE.start_main_#t~short25#1|} is VALID [2022-02-20 23:49:29,114 INFO L290 TraceCheckUtils]: 38: Hoare triple {19344#|ULTIMATE.start_main_#t~short25#1|} assume !main_#t~short25#1;havoc main_#t~mem23#1;havoc main_#t~mem24#1;havoc main_#t~short25#1; {19328#false} is VALID [2022-02-20 23:49:29,114 INFO L290 TraceCheckUtils]: 39: Hoare triple {19328#false} assume !(main_~item~0#1.base != 0 || main_~item~0#1.offset != 0); {19328#false} is VALID [2022-02-20 23:49:29,114 INFO L290 TraceCheckUtils]: 40: Hoare triple {19328#false} main_#res#1 := 0; {19328#false} is VALID [2022-02-20 23:49:29,114 INFO L290 TraceCheckUtils]: 41: Hoare triple {19328#false} assume !(#valid == main_old_#valid#1); {19328#false} is VALID [2022-02-20 23:49:29,114 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:29,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:29,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1474590364] [2022-02-20 23:49:29,115 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1474590364] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:29,115 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:29,115 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [18] imperfect sequences [] total 18 [2022-02-20 23:49:29,115 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1857349225] [2022-02-20 23:49:29,115 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:29,115 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 23:49:29,115 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:29,115 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:29,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:29,144 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:49:29,144 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:29,145 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:49:29,145 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=254, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:49:29,145 INFO L87 Difference]: Start difference. First operand 249 states and 318 transitions. Second operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,181 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2022-02-20 23:49:31,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 23:49:31,181 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 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 42 [2022-02-20 23:49:31,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:31,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 206 transitions. [2022-02-20 23:49:31,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 206 transitions. [2022-02-20 23:49:31,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 206 transitions. [2022-02-20 23:49:31,318 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 206 edges. 206 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:31,321 INFO L225 Difference]: With dead ends: 285 [2022-02-20 23:49:31,321 INFO L226 Difference]: Without dead ends: 285 [2022-02-20 23:49:31,321 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 275 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=246, Invalid=1086, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 23:49:31,322 INFO L933 BasicCegarLoop]: 105 mSDtfsCounter, 149 mSDsluCounter, 886 mSDsCounter, 0 mSdLazyCounter, 900 mSolverCounterSat, 63 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 149 SdHoareTripleChecker+Valid, 991 SdHoareTripleChecker+Invalid, 963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 63 IncrementalHoareTripleChecker+Valid, 900 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:31,322 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [149 Valid, 991 Invalid, 963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [63 Valid, 900 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:49:31,322 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 285 states. [2022-02-20 23:49:31,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 285 to 249. [2022-02-20 23:49:31,324 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:31,325 INFO L82 GeneralOperation]: Start isEquivalent. First operand 285 states. Second operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,325 INFO L74 IsIncluded]: Start isIncluded. First operand 285 states. Second operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,325 INFO L87 Difference]: Start difference. First operand 285 states. Second operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,328 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,328 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2022-02-20 23:49:31,328 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 355 transitions. [2022-02-20 23:49:31,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,329 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,329 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 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 285 states. [2022-02-20 23:49:31,329 INFO L87 Difference]: Start difference. First operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 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 285 states. [2022-02-20 23:49:31,332 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,333 INFO L93 Difference]: Finished difference Result 285 states and 355 transitions. [2022-02-20 23:49:31,333 INFO L276 IsEmpty]: Start isEmpty. Operand 285 states and 355 transitions. [2022-02-20 23:49:31,333 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:31,333 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:31,333 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:31,333 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:31,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 209 states have (on average 1.5167464114832536) internal successors, (317), 248 states have internal predecessors, (317), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 317 transitions. [2022-02-20 23:49:31,336 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 317 transitions. Word has length 42 [2022-02-20 23:49:31,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:31,336 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 317 transitions. [2022-02-20 23:49:31,337 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.3333333333333335) internal successors, (42), 18 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:31,337 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 317 transitions. [2022-02-20 23:49:31,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:49:31,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:31,337 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:31,337 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:49:31,338 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:49:31,338 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:31,338 INFO L85 PathProgramCache]: Analyzing trace with hash -327922889, now seen corresponding path program 1 times [2022-02-20 23:49:31,338 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:31,338 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315653396] [2022-02-20 23:49:31,338 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:31,338 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:31,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:31,368 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:49:31,368 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:49:31,371 INFO L158 Benchmark]: Toolchain (without parser) took 55127.94ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 70.8MB in the beginning and 73.3MB in the end (delta: -2.5MB). Peak memory consumption was 76.9MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,371 INFO L158 Benchmark]: CDTParser took 0.32ms. Allocated memory is still 75.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:49:31,372 INFO L158 Benchmark]: CACSL2BoogieTranslator took 369.54ms. Allocated memory is still 92.3MB. Free memory was 70.6MB in the beginning and 61.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,372 INFO L158 Benchmark]: Boogie Procedure Inliner took 64.89ms. Allocated memory is still 92.3MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,372 INFO L158 Benchmark]: Boogie Preprocessor took 41.09ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 56.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,372 INFO L158 Benchmark]: RCFGBuilder took 631.84ms. Allocated memory is still 92.3MB. Free memory was 56.4MB in the beginning and 58.6MB in the end (delta: -2.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,372 INFO L158 Benchmark]: TraceAbstraction took 54016.03ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 58.2MB in the beginning and 73.3MB in the end (delta: -15.2MB). Peak memory consumption was 63.2MB. Max. memory is 16.1GB. [2022-02-20 23:49:31,373 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.32ms. Allocated memory is still 75.5MB. Free memory is still 48.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 369.54ms. Allocated memory is still 92.3MB. Free memory was 70.6MB in the beginning and 61.7MB in the end (delta: 8.9MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 64.89ms. Allocated memory is still 92.3MB. Free memory was 61.7MB in the beginning and 58.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 41.09ms. Allocated memory is still 92.3MB. Free memory was 58.9MB in the beginning and 56.6MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 631.84ms. Allocated memory is still 92.3MB. Free memory was 56.4MB in the beginning and 58.6MB in the end (delta: -2.2MB). Peak memory consumption was 28.1MB. Max. memory is 16.1GB. * TraceAbstraction took 54016.03ms. Allocated memory was 92.3MB in the beginning and 172.0MB in the end (delta: 79.7MB). Free memory was 58.2MB in the beginning and 73.3MB in the end (delta: -15.2MB). Peak memory consumption was 63.2MB. 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:49:31,473 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext-properties/test-0513_1.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 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:49:32,978 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:49:32,981 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:49:33,014 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:49:33,015 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:49:33,018 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:49:33,020 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:49:33,024 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:49:33,025 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:49:33,029 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:49:33,029 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:49:33,031 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:49:33,031 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:49:33,033 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:49:33,034 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:49:33,038 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:49:33,039 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:49:33,040 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:49:33,043 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:49:33,047 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:49:33,048 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:49:33,049 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:49:33,049 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:49:33,051 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:49:33,054 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:49:33,057 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:49:33,057 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:49:33,058 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:49:33,059 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:49:33,059 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:49:33,060 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:49:33,061 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:49:33,062 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:49:33,062 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:49:33,063 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:49:33,063 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:49:33,064 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:49:33,064 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:49:33,064 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:49:33,065 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:49:33,066 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:49:33,066 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:49:33,091 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:49:33,091 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:49:33,092 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:49:33,092 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:49:33,093 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:49:33,093 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:49:33,094 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:49:33,094 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:49:33,094 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:49:33,094 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:49:33,095 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:49:33,095 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:49:33,095 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:49:33,095 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:49:33,095 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:49:33,096 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:49:33,097 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:49:33,097 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:49:33,097 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:49:33,115 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:49:33,115 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:33,115 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:49:33,115 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:49:33,116 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:49:33,116 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:49:33,116 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:49:33,116 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 -> 2cd9310cc22b48510db29915dc2047c5968d5424a204e513aea9283dac5ac7bf [2022-02-20 23:49:33,366 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:49:33,390 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:49:33,392 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:49:33,392 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:49:33,393 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:49:33,394 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-02-20 23:49:33,444 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1a1546e/cef043cae5ee4b9d977af15a8333b649/FLAGe094e46f6 [2022-02-20 23:49:33,847 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:49:33,847 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0513_1.i [2022-02-20 23:49:33,854 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1a1546e/cef043cae5ee4b9d977af15a8333b649/FLAGe094e46f6 [2022-02-20 23:49:33,863 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3e1a1546e/cef043cae5ee4b9d977af15a8333b649 [2022-02-20 23:49:33,865 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:49:33,866 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:49:33,868 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:33,868 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:49:33,872 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:49:33,873 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:33" (1/1) ... [2022-02-20 23:49:33,877 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@d034fa4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:33, skipping insertion in model container [2022-02-20 23:49:33,877 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:49:33" (1/1) ... [2022-02-20 23:49:33,882 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:49:33,925 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:49:34,216 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:34,235 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:49:34,273 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:49:34,299 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:49:34,299 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34 WrapperNode [2022-02-20 23:49:34,301 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:49:34,302 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:34,302 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:49:34,302 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:49:34,308 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:49:34" (1/1) ... [2022-02-20 23:49:34,335 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:49:34" (1/1) ... [2022-02-20 23:49:34,364 INFO L137 Inliner]: procedures = 126, calls = 41, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 143 [2022-02-20 23:49:34,364 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:49:34,365 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:49:34,365 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:49:34,365 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:49:34,371 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,371 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,377 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,378 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,384 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,392 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,397 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,409 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:49:34,410 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:49:34,410 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:49:34,410 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:49:34,410 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (1/1) ... [2022-02-20 23:49:34,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:49:34,426 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:34,436 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:49:34,444 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:49:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:49:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:49:34,465 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:49:34,466 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:49:34,466 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:49:34,558 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:49:34,559 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:49:35,170 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:49:35,175 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:49:35,176 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 23:49:35,177 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:35 BoogieIcfgContainer [2022-02-20 23:49:35,178 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:49:35,179 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:49:35,179 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:49:35,183 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:49:35,183 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:49:33" (1/3) ... [2022-02-20 23:49:35,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:35, skipping insertion in model container [2022-02-20 23:49:35,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:49:34" (2/3) ... [2022-02-20 23:49:35,184 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5510e55a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:49:35, skipping insertion in model container [2022-02-20 23:49:35,184 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:49:35" (3/3) ... [2022-02-20 23:49:35,185 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0513_1.i [2022-02-20 23:49:35,188 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:49:35,188 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 70 error locations. [2022-02-20 23:49:35,219 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:49:35,223 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:49:35,223 INFO L340 AbstractCegarLoop]: Starting to check reachability of 70 error locations. [2022-02-20 23:49:35,242 INFO L276 IsEmpty]: Start isEmpty. Operand has 149 states, 78 states have (on average 2.141025641025641) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:35,245 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:49:35,245 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:35,246 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:49:35,246 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:49:35,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:35,249 INFO L85 PathProgramCache]: Analyzing trace with hash 28699948, now seen corresponding path program 1 times [2022-02-20 23:49:35,256 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:35,256 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1405785733] [2022-02-20 23:49:35,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:35,257 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:35,257 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:35,259 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:49:35,262 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:49:35,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:35,325 INFO L263 TraceCheckSpWp]: Trace formula consists of 20 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:49:35,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:35,337 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:35,416 INFO L290 TraceCheckUtils]: 0: Hoare triple {152#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {152#true} is VALID [2022-02-20 23:49:35,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {152#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, 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_#t~mem22#1, main_#t~mem23#1, main_#t~short24#1, 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_~c1~0#1;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;main_~c1~0#1 := 0bv32; {160#(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:49:35,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {160#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(~bvslt32(main_~c1~0#1, 5bv32) && 0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {160#(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:49:35,418 INFO L290 TraceCheckUtils]: 3: Hoare triple {160#(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); {153#false} is VALID [2022-02-20 23:49:35,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {153#false} assume !(1bv1 == #valid[main_~data~0#1.base]); {153#false} is VALID [2022-02-20 23:49:35,419 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:49:35,420 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:35,420 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:35,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1405785733] [2022-02-20 23:49:35,421 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1405785733] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:35,421 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:35,422 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:49:35,423 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [75282659] [2022-02-20 23:49:35,423 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:35,426 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:49:35,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:35,429 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:49:35,435 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:49:35,435 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:35,440 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:35,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:35,462 INFO L87 Difference]: Start difference. First operand has 149 states, 78 states have (on average 2.141025641025641) internal successors, (167), 148 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 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:49:35,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:35,961 INFO L93 Difference]: Finished difference Result 173 states and 189 transitions. [2022-02-20 23:49:35,961 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:49:35,961 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:49:35,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:35,962 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:49:35,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 23:49:35,969 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:49:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 23:49:35,971 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2022-02-20 23:49:36,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:36,212 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:49:36,212 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:49:36,213 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:49:36,216 INFO L933 BasicCegarLoop]: 160 mSDtfsCounter, 29 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 42 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 42 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:36,217 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 276 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 42 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:36,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:49:36,247 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 159. [2022-02-20 23:49:36,248 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:36,255 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,256 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,256 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,268 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:36,271 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-02-20 23:49:36,271 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2022-02-20 23:49:36,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:36,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:36,274 INFO L74 IsIncluded]: Start isIncluded. First operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:49:36,275 INFO L87 Difference]: Start difference. First operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:49:36,282 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:36,287 INFO L93 Difference]: Finished difference Result 169 states and 185 transitions. [2022-02-20 23:49:36,287 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 185 transitions. [2022-02-20 23:49:36,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:36,288 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:36,288 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:36,288 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:36,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 89 states have (on average 2.067415730337079) internal successors, (184), 158 states have internal predecessors, (184), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:49:36,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 184 transitions. [2022-02-20 23:49:36,293 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 184 transitions. Word has length 5 [2022-02-20 23:49:36,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:36,293 INFO L470 AbstractCegarLoop]: Abstraction has 159 states and 184 transitions. [2022-02-20 23:49:36,294 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:49:36,294 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 184 transitions. [2022-02-20 23:49:36,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:49:36,294 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:36,294 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:49:36,303 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:49:36,501 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:49:36,501 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr69ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 66 more)] === [2022-02-20 23:49:36,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:36,502 INFO L85 PathProgramCache]: Analyzing trace with hash 28700044, now seen corresponding path program 1 times [2022-02-20 23:49:36,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:49:36,502 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [459662271] [2022-02-20 23:49:36,502 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:36,502 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:49:36,502 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:49:36,503 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:49:36,505 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:49:36,537 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,538 INFO L263 TraceCheckSpWp]: Trace formula consists of 22 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:49:36,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:36,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:36,573 INFO L290 TraceCheckUtils]: 0: Hoare triple {839#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(14bv32, 2bv32); {839#true} is VALID [2022-02-20 23:49:36,575 INFO L290 TraceCheckUtils]: 1: Hoare triple {839#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~post4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, 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_#t~mem22#1, main_#t~mem23#1, main_#t~short24#1, 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_~c1~0#1;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;main_~c1~0#1 := 0bv32; {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:36,576 INFO L290 TraceCheckUtils]: 2: Hoare triple {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(~bvslt32(main_~c1~0#1, 5bv32) && 0bv32 != main_#t~nondet3#1);havoc main_#t~nondet3#1; {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:36,576 INFO L290 TraceCheckUtils]: 3: Hoare triple {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:49:36,577 INFO L290 TraceCheckUtils]: 4: Hoare triple {847#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {840#false} is VALID [2022-02-20 23:49:36,577 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:49:36,577 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:49:36,577 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:49:36,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [459662271] [2022-02-20 23:49:36,590 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [459662271] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:36,590 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:36,590 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:49:36,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1719981551] [2022-02-20 23:49:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:36,591 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:49:36,591 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:36,591 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:49:36,596 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:49:36,596 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:49:36,596 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:49:36,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:49:36,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:49:36,597 INFO L87 Difference]: Start difference. First operand 159 states and 184 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)