./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety-ext/tree_stack.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:46:48,078 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:46:48,080 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:46:48,113 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:46:48,114 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:46:48,117 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:46:48,118 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:46:48,120 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:46:48,121 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:46:48,124 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:46:48,125 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:46:48,126 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:46:48,126 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:46:48,128 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:46:48,129 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:46:48,131 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:46:48,132 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:46:48,133 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:46:48,134 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:46:48,138 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:46:48,139 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:46:48,140 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:46:48,141 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:46:48,142 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:46:48,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:46:48,147 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:46:48,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:46:48,148 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:46:48,148 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:46:48,149 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:46:48,149 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:46:48,150 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:46:48,151 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:46:48,152 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:46:48,153 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:46:48,153 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:46:48,154 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:46:48,154 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:46:48,155 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:46:48,155 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:46:48,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:46:48,156 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:46:48,180 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:46:48,181 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:46:48,181 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:46:48,181 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:46:48,182 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:46:48,182 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:46:48,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:46:48,183 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:46:48,183 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:46:48,183 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:46:48,184 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:46:48,185 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:46:48,185 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:46:48,186 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:46:48,186 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:46:48,186 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:48,186 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:46:48,186 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:46:48,186 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:46:48,187 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:46:48,187 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2022-02-20 23:46:48,397 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:46:48,416 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:46:48,419 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:46:48,420 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:46:48,420 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:46:48,422 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-02-20 23:46:48,476 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c444d2e22/5e2c713c93df4df6b92e2a141a98d3b3/FLAG892148ad2 [2022-02-20 23:46:48,796 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:46:48,796 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-02-20 23:46:48,806 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c444d2e22/5e2c713c93df4df6b92e2a141a98d3b3/FLAG892148ad2 [2022-02-20 23:46:49,199 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c444d2e22/5e2c713c93df4df6b92e2a141a98d3b3 [2022-02-20 23:46:49,201 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:46:49,202 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:46:49,204 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:49,205 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:46:49,207 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:46:49,208 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,209 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@301c736a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49, skipping insertion in model container [2022-02-20 23:46:49,209 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,216 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:46:49,254 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:46:49,547 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:49,554 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:46:49,583 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:46:49,602 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:46:49,602 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49 WrapperNode [2022-02-20 23:46:49,602 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:46:49,603 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:49,603 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:46:49,603 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:46:49,611 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,620 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,638 INFO L137 Inliner]: procedures = 123, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 142 [2022-02-20 23:46:49,638 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:46:49,639 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:46:49,639 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:46:49,639 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:46:49,645 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,645 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,647 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,648 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,661 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,663 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,664 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,666 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:46:49,667 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:46:49,667 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:46:49,667 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:46:49,668 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (1/1) ... [2022-02-20 23:46:49,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:46:49,680 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:46:49,708 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:46:49,717 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:46:49,741 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:46:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:46:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:46:49,742 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:46:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:46:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:46:49,743 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:46:49,743 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:46:49,840 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:46:49,841 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:46:50,362 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:46:50,369 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:46:50,370 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:46:50,372 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:50 BoogieIcfgContainer [2022-02-20 23:46:50,372 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:46:50,373 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:46:50,373 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:46:50,376 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:46:50,376 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:46:49" (1/3) ... [2022-02-20 23:46:50,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a3b2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:50, skipping insertion in model container [2022-02-20 23:46:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:46:49" (2/3) ... [2022-02-20 23:46:50,377 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@24a3b2ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:46:50, skipping insertion in model container [2022-02-20 23:46:50,377 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:46:50" (3/3) ... [2022-02-20 23:46:50,378 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2022-02-20 23:46:50,382 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:46:50,382 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-02-20 23:46:50,409 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:46:50,414 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:46:50,414 INFO L340 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-02-20 23:46:50,428 INFO L276 IsEmpty]: Start isEmpty. Operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:50,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:50,431 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:50,431 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:50,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:50,434 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:46:50,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:50,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123965156] [2022-02-20 23:46:50,441 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:50,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:50,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:50,535 INFO L290 TraceCheckUtils]: 0: Hoare triple {141#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(13, 2); {141#true} is VALID [2022-02-20 23:46:50,537 INFO L290 TraceCheckUtils]: 1: Hoare triple {141#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {143#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:50,537 INFO L290 TraceCheckUtils]: 2: Hoare triple {143#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !(1 == #valid[main_~root~0#1.base]); {142#false} is VALID [2022-02-20 23:46:50,538 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:50,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:50,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123965156] [2022-02-20 23:46:50,539 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123965156] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:50,539 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:50,539 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:50,540 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [26386638] [2022-02-20 23:46:50,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:50,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:46:50,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:50,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,550 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:50,550 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:50,551 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:50,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:50,566 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:50,569 INFO L87 Difference]: Start difference. First operand has 138 states, 70 states have (on average 2.157142857142857) internal successors, (151), 137 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:50,830 INFO L93 Difference]: Finished difference Result 156 states and 166 transitions. [2022-02-20 23:46:50,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:50,830 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:46:50,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:50,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,837 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-20 23:46:50,837 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:50,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 172 transitions. [2022-02-20 23:46:50,840 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 172 transitions. [2022-02-20 23:46:50,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:50,975 INFO L225 Difference]: With dead ends: 156 [2022-02-20 23:46:50,975 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:46:50,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:50,979 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 104 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:50,979 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [104 Valid, 122 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:50,991 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:46:51,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 134. [2022-02-20 23:46:51,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,002 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,003 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,008 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,008 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2022-02-20 23:46:51,008 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2022-02-20 23:46:51,009 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,009 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,010 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:51,010 INFO L87 Difference]: Start difference. First operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:51,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,015 INFO L93 Difference]: Finished difference Result 152 states and 162 transitions. [2022-02-20 23:46:51,015 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 162 transitions. [2022-02-20 23:46:51,016 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,016 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,016 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,016 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,017 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 69 states have (on average 2.0869565217391304) internal successors, (144), 133 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 144 transitions. [2022-02-20 23:46:51,020 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 144 transitions. Word has length 3 [2022-02-20 23:46:51,020 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,021 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 144 transitions. [2022-02-20 23:46:51,021 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,021 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 144 transitions. [2022-02-20 23:46:51,021 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:46:51,021 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,021 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:46:51,022 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:46:51,022 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:51,022 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,023 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:46:51,023 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,023 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1375810548] [2022-02-20 23:46:51,023 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,023 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {740#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(13, 2); {740#true} is VALID [2022-02-20 23:46:51,058 INFO L290 TraceCheckUtils]: 1: Hoare triple {740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {742#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,058 INFO L290 TraceCheckUtils]: 2: Hoare triple {742#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} assume !(4 + main_~root~0#1.offset <= #length[main_~root~0#1.base] && 0 <= main_~root~0#1.offset); {741#false} is VALID [2022-02-20 23:46:51,058 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:51,059 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1375810548] [2022-02-20 23:46:51,061 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1375810548] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,061 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,062 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:51,062 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386673357] [2022-02-20 23:46:51,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,063 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:46:51,063 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,063 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,069 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:51,069 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:51,070 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:51,070 INFO L87 Difference]: Start difference. First operand 134 states and 144 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,265 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:46:51,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:51,265 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:46:51,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:46:51,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,269 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2022-02-20 23:46:51,269 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 144 transitions. [2022-02-20 23:46:51,386 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 144 edges. 144 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:51,388 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:46:51,389 INFO L226 Difference]: Without dead ends: 132 [2022-02-20 23:46:51,389 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:51,390 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 135 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 135 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:51,390 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [135 Valid, 78 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:51,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2022-02-20 23:46:51,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2022-02-20 23:46:51,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,394 INFO L82 GeneralOperation]: Start isEquivalent. First operand 132 states. Second operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,394 INFO L74 IsIncluded]: Start isIncluded. First operand 132 states. Second operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,395 INFO L87 Difference]: Start difference. First operand 132 states. Second operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,397 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:46:51,397 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:46:51,398 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,398 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,399 INFO L74 IsIncluded]: Start isIncluded. First operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 132 states. [2022-02-20 23:46:51,399 INFO L87 Difference]: Start difference. First operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 132 states. [2022-02-20 23:46:51,402 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,402 INFO L93 Difference]: Finished difference Result 132 states and 142 transitions. [2022-02-20 23:46:51,402 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:46:51,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,403 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,403 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,403 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,403 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 69 states have (on average 2.0579710144927534) internal successors, (142), 131 states have internal predecessors, (142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 142 transitions. [2022-02-20 23:46:51,406 INFO L78 Accepts]: Start accepts. Automaton has 132 states and 142 transitions. Word has length 3 [2022-02-20 23:46:51,406 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,406 INFO L470 AbstractCegarLoop]: Abstraction has 132 states and 142 transitions. [2022-02-20 23:46:51,406 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,406 INFO L276 IsEmpty]: Start isEmpty. Operand 132 states and 142 transitions. [2022-02-20 23:46:51,406 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:46:51,406 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,406 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:51,407 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:46:51,407 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:51,407 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031021, now seen corresponding path program 1 times [2022-02-20 23:46:51,407 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,407 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [78640787] [2022-02-20 23:46:51,407 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,408 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,423 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,466 INFO L290 TraceCheckUtils]: 0: Hoare triple {1273#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(13, 2); {1273#true} is VALID [2022-02-20 23:46:51,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {1273#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1273#true} is VALID [2022-02-20 23:46:51,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {1273#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {1275#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1)} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1276#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:51,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {1276#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !(1 == #valid[main_~n~0#1.base]); {1274#false} is VALID [2022-02-20 23:46:51,470 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:51,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [78640787] [2022-02-20 23:46:51,471 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [78640787] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,471 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,471 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:51,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1802605240] [2022-02-20 23:46:51,472 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,473 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,473 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,478 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:46:51,478 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:51,478 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:51,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:51,479 INFO L87 Difference]: Start difference. First operand 132 states and 142 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,736 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-02-20 23:46:51,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:51,736 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:51,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2022-02-20 23:46:51,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 167 transitions. [2022-02-20 23:46:51,740 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 167 transitions. [2022-02-20 23:46:51,848 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:46:51,849 INFO L225 Difference]: With dead ends: 140 [2022-02-20 23:46:51,850 INFO L226 Difference]: Without dead ends: 140 [2022-02-20 23:46:51,850 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:51,851 INFO L933 BasicCegarLoop]: 60 mSDtfsCounter, 174 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 96 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:51,851 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 96 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:51,852 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2022-02-20 23:46:51,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 118. [2022-02-20 23:46:51,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:51,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 140 states. Second operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,861 INFO L74 IsIncluded]: Start isIncluded. First operand 140 states. Second operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,861 INFO L87 Difference]: Start difference. First operand 140 states. Second operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,863 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-02-20 23:46:51,863 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-02-20 23:46:51,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,864 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,865 INFO L74 IsIncluded]: Start isIncluded. First operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 140 states. [2022-02-20 23:46:51,865 INFO L87 Difference]: Start difference. First operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 140 states. [2022-02-20 23:46:51,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:51,868 INFO L93 Difference]: Finished difference Result 140 states and 151 transitions. [2022-02-20 23:46:51,868 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 151 transitions. [2022-02-20 23:46:51,868 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:51,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:51,871 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:51,871 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:51,872 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 118 states, 70 states have (on average 1.8428571428571427) internal successors, (129), 117 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:51,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 118 states to 118 states and 129 transitions. [2022-02-20 23:46:51,874 INFO L78 Accepts]: Start accepts. Automaton has 118 states and 129 transitions. Word has length 7 [2022-02-20 23:46:51,874 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:51,874 INFO L470 AbstractCegarLoop]: Abstraction has 118 states and 129 transitions. [2022-02-20 23:46:51,874 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,874 INFO L276 IsEmpty]: Start isEmpty. Operand 118 states and 129 transitions. [2022-02-20 23:46:51,875 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:46:51,875 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:51,876 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:51,876 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:46:51,876 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:51,877 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:51,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1803031022, now seen corresponding path program 1 times [2022-02-20 23:46:51,877 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:51,877 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [973675818] [2022-02-20 23:46:51,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:51,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:51,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:51,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {1819#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(13, 2); {1819#true} is VALID [2022-02-20 23:46:51,957 INFO L290 TraceCheckUtils]: 1: Hoare triple {1819#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,958 INFO L290 TraceCheckUtils]: 2: Hoare triple {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,958 INFO L290 TraceCheckUtils]: 3: Hoare triple {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,959 INFO L290 TraceCheckUtils]: 4: Hoare triple {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,959 INFO L290 TraceCheckUtils]: 5: Hoare triple {1821#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1822#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:51,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {1822#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume !(4 + main_~n~0#1.offset <= #length[main_~n~0#1.base] && 0 <= main_~n~0#1.offset); {1820#false} is VALID [2022-02-20 23:46:51,960 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:51,960 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:51,960 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [973675818] [2022-02-20 23:46:51,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [973675818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:51,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:51,961 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:51,961 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588392597] [2022-02-20 23:46:51,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:51,961 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,962 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:51,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:51,967 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:46:51,967 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:51,967 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:51,967 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:51,967 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:51,968 INFO L87 Difference]: Start difference. First operand 118 states and 129 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:52,305 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,305 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2022-02-20 23:46:52,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:46:52,305 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:52,306 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,306 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:52,307 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-02-20 23:46:52,307 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:52,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2022-02-20 23:46:52,308 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 193 transitions. [2022-02-20 23:46:52,446 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 193 edges. 193 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,447 INFO L225 Difference]: With dead ends: 163 [2022-02-20 23:46:52,447 INFO L226 Difference]: Without dead ends: 163 [2022-02-20 23:46:52,448 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:52,448 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 213 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 116 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:52,449 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 116 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:52,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2022-02-20 23:46:52,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 148. [2022-02-20 23:46:52,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:52,453 INFO L82 GeneralOperation]: Start isEquivalent. First operand 163 states. Second operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,453 INFO L74 IsIncluded]: Start isIncluded. First operand 163 states. Second operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,453 INFO L87 Difference]: Start difference. First operand 163 states. Second operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,455 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2022-02-20 23:46:52,456 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-02-20 23:46:52,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,456 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:46:52,456 INFO L87 Difference]: Start difference. First operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 163 states. [2022-02-20 23:46:52,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,459 INFO L93 Difference]: Finished difference Result 163 states and 181 transitions. [2022-02-20 23:46:52,459 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 181 transitions. [2022-02-20 23:46:52,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,460 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:52,460 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:52,460 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 100 states have (on average 1.71) internal successors, (171), 147 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 171 transitions. [2022-02-20 23:46:52,463 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 171 transitions. Word has length 7 [2022-02-20 23:46:52,463 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:52,463 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 171 transitions. [2022-02-20 23:46:52,463 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 4 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:46:52,463 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 171 transitions. [2022-02-20 23:46:52,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:46:52,464 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:52,464 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:52,464 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:46:52,464 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:52,464 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:52,465 INFO L85 PathProgramCache]: Analyzing trace with hash 59388299, now seen corresponding path program 1 times [2022-02-20 23:46:52,465 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:52,465 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [880046869] [2022-02-20 23:46:52,465 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:52,465 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:52,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:52,502 INFO L290 TraceCheckUtils]: 0: Hoare triple {2464#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(13, 2); {2464#true} is VALID [2022-02-20 23:46:52,503 INFO L290 TraceCheckUtils]: 1: Hoare triple {2464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2464#true} is VALID [2022-02-20 23:46:52,503 INFO L290 TraceCheckUtils]: 2: Hoare triple {2464#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {2464#true} is VALID [2022-02-20 23:46:52,503 INFO L290 TraceCheckUtils]: 3: Hoare triple {2464#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {2464#true} is VALID [2022-02-20 23:46:52,503 INFO L290 TraceCheckUtils]: 4: Hoare triple {2464#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {2464#true} is VALID [2022-02-20 23:46:52,503 INFO L290 TraceCheckUtils]: 5: Hoare triple {2464#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2464#true} is VALID [2022-02-20 23:46:52,504 INFO L290 TraceCheckUtils]: 6: Hoare triple {2464#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {2466#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:52,505 INFO L290 TraceCheckUtils]: 7: Hoare triple {2466#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !(1 == #valid[main_~s~0#1.base]); {2465#false} is VALID [2022-02-20 23:46:52,505 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:52,505 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:52,505 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [880046869] [2022-02-20 23:46:52,505 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [880046869] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:52,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:52,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:52,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272678440] [2022-02-20 23:46:52,506 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:52,506 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:52,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:52,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,511 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:52,512 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:52,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:52,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:52,512 INFO L87 Difference]: Start difference. First operand 148 states and 171 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,644 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,644 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2022-02-20 23:46:52,644 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:52,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:52,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 23:46:52,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-20 23:46:52,646 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-20 23:46:52,713 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,714 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:46:52,714 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:46:52,714 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:52,715 INFO L933 BasicCegarLoop]: 116 mSDtfsCounter, 10 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 180 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:52,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 180 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:52,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:46:52,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 148. [2022-02-20 23:46:52,718 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:52,718 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,718 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,719 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,721 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2022-02-20 23:46:52,721 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-02-20 23:46:52,721 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,721 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,722 INFO L74 IsIncluded]: Start isIncluded. First operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:52,722 INFO L87 Difference]: Start difference. First operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:52,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,724 INFO L93 Difference]: Finished difference Result 152 states and 175 transitions. [2022-02-20 23:46:52,724 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 175 transitions. [2022-02-20 23:46:52,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:52,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:52,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:52,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:52,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 102 states have (on average 1.696078431372549) internal successors, (173), 147 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 173 transitions. [2022-02-20 23:46:52,739 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 173 transitions. Word has length 8 [2022-02-20 23:46:52,739 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:52,739 INFO L470 AbstractCegarLoop]: Abstraction has 148 states and 173 transitions. [2022-02-20 23:46:52,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,740 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 173 transitions. [2022-02-20 23:46:52,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:46:52,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:52,740 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:52,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:46:52,741 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:52,742 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:52,742 INFO L85 PathProgramCache]: Analyzing trace with hash 59388300, now seen corresponding path program 1 times [2022-02-20 23:46:52,742 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:52,743 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1406643288] [2022-02-20 23:46:52,743 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:52,743 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:52,772 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:52,788 INFO L290 TraceCheckUtils]: 0: Hoare triple {3073#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(13, 2); {3073#true} is VALID [2022-02-20 23:46:52,789 INFO L290 TraceCheckUtils]: 1: Hoare triple {3073#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {3073#true} is VALID [2022-02-20 23:46:52,789 INFO L290 TraceCheckUtils]: 2: Hoare triple {3073#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {3073#true} is VALID [2022-02-20 23:46:52,789 INFO L290 TraceCheckUtils]: 3: Hoare triple {3073#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {3073#true} is VALID [2022-02-20 23:46:52,789 INFO L290 TraceCheckUtils]: 4: Hoare triple {3073#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {3073#true} is VALID [2022-02-20 23:46:52,790 INFO L290 TraceCheckUtils]: 5: Hoare triple {3073#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3073#true} is VALID [2022-02-20 23:46:52,790 INFO L290 TraceCheckUtils]: 6: Hoare triple {3073#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3075#(and (= (+ (select |#length| |ULTIMATE.start_main_~s~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:52,791 INFO L290 TraceCheckUtils]: 7: Hoare triple {3075#(and (= (+ (select |#length| |ULTIMATE.start_main_~s~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(4 + main_~s~0#1.offset <= #length[main_~s~0#1.base] && 0 <= main_~s~0#1.offset); {3074#false} is VALID [2022-02-20 23:46:52,791 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:52,791 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:52,791 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1406643288] [2022-02-20 23:46:52,792 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1406643288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:52,792 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:52,792 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:46:52,792 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [555439147] [2022-02-20 23:46:52,792 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:52,792 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:52,792 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:52,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,798 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:52,798 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:52,798 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:52,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:52,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:52,799 INFO L87 Difference]: Start difference. First operand 148 states and 173 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,985 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:52,985 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-02-20 23:46:52,985 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:52,986 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:46:52,986 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:52,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:46:52,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:52,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 132 transitions. [2022-02-20 23:46:52,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 132 transitions. [2022-02-20 23:46:53,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,068 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:46:53,069 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:46:53,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:53,069 INFO L933 BasicCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 54 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 172 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,069 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 172 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:53,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:46:53,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 146. [2022-02-20 23:46:53,072 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,073 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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:46:53,073 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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:46:53,073 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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:46:53,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,075 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-02-20 23:46:53,076 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2022-02-20 23:46:53,076 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,076 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,076 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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 150 states. [2022-02-20 23:46:53,077 INFO L87 Difference]: Start difference. First operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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 150 states. [2022-02-20 23:46:53,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,079 INFO L93 Difference]: Finished difference Result 150 states and 173 transitions. [2022-02-20 23:46:53,079 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 173 transitions. [2022-02-20 23:46:53,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6666666666666667) internal successors, (170), 145 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:46:53,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 170 transitions. [2022-02-20 23:46:53,082 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 170 transitions. Word has length 8 [2022-02-20 23:46:53,082 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,082 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 170 transitions. [2022-02-20 23:46:53,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,083 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 170 transitions. [2022-02-20 23:46:53,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:46:53,083 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,083 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:46:53,088 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:53,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,089 INFO L85 PathProgramCache]: Analyzing trace with hash -387876619, now seen corresponding path program 1 times [2022-02-20 23:46:53,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1088671970] [2022-02-20 23:46:53,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:53,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,146 INFO L290 TraceCheckUtils]: 0: Hoare triple {3674#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(13, 2); {3674#true} is VALID [2022-02-20 23:46:53,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {3674#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {3674#true} is VALID [2022-02-20 23:46:53,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {3674#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {3674#true} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 3: Hoare triple {3674#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {3674#true} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 4: Hoare triple {3674#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {3674#true} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 5: Hoare triple {3674#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3674#true} is VALID [2022-02-20 23:46:53,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {3674#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:53,148 INFO L290 TraceCheckUtils]: 7: Hoare triple {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:53,148 INFO L290 TraceCheckUtils]: 8: Hoare triple {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} is VALID [2022-02-20 23:46:53,148 INFO L290 TraceCheckUtils]: 9: Hoare triple {3676#(not (= |ULTIMATE.start_main_~s~0#1.base| 0))} assume !(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0); {3675#false} is VALID [2022-02-20 23:46:53,149 INFO L290 TraceCheckUtils]: 10: Hoare triple {3675#false} main_#res#1 := 0; {3675#false} is VALID [2022-02-20 23:46:53,149 INFO L290 TraceCheckUtils]: 11: Hoare triple {3675#false} assume !(#valid == main_old_#valid#1); {3675#false} is VALID [2022-02-20 23:46:53,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:53,149 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:53,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1088671970] [2022-02-20 23:46:53,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1088671970] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,150 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:53,150 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1720130495] [2022-02-20 23:46:53,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,150 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:46:53,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,158 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:53,158 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:53,158 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:53,158 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:53,159 INFO L87 Difference]: Start difference. First operand 146 states and 170 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,252 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-02-20 23:46:53,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:53,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:46:53,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:53,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:46:53,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:46:53,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 23:46:53,329 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,330 INFO L225 Difference]: With dead ends: 147 [2022-02-20 23:46:53,330 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:46:53,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:53,331 INFO L933 BasicCegarLoop]: 119 mSDtfsCounter, 2 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,331 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 228 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:53,332 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:46:53,333 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 146. [2022-02-20 23:46:53,333 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,333 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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:46:53,333 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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:46:53,334 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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:46:53,336 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,336 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-02-20 23:46:53,336 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2022-02-20 23:46:53,336 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,336 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,336 INFO L74 IsIncluded]: Start isIncluded. First operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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 147 states. [2022-02-20 23:46:53,337 INFO L87 Difference]: Start difference. First operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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 147 states. [2022-02-20 23:46:53,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,339 INFO L93 Difference]: Finished difference Result 147 states and 170 transitions. [2022-02-20 23:46:53,339 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 170 transitions. [2022-02-20 23:46:53,339 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,340 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 102 states have (on average 1.6568627450980393) internal successors, (169), 145 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:46:53,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 169 transitions. [2022-02-20 23:46:53,342 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 169 transitions. Word has length 12 [2022-02-20 23:46:53,342 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,342 INFO L470 AbstractCegarLoop]: Abstraction has 146 states and 169 transitions. [2022-02-20 23:46:53,342 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:53,343 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 169 transitions. [2022-02-20 23:46:53,343 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:46:53,343 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,343 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,343 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:46:53,343 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:53,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,344 INFO L85 PathProgramCache]: Analyzing trace with hash 860725951, now seen corresponding path program 1 times [2022-02-20 23:46:53,344 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,344 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267795821] [2022-02-20 23:46:53,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:53,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {4266#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(13, 2); {4266#true} is VALID [2022-02-20 23:46:53,387 INFO L290 TraceCheckUtils]: 1: Hoare triple {4266#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4266#true} is VALID [2022-02-20 23:46:53,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {4266#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {4266#true} is VALID [2022-02-20 23:46:53,387 INFO L290 TraceCheckUtils]: 3: Hoare triple {4266#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {4266#true} is VALID [2022-02-20 23:46:53,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {4266#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {4266#true} is VALID [2022-02-20 23:46:53,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {4266#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4266#true} is VALID [2022-02-20 23:46:53,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {4266#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4266#true} is VALID [2022-02-20 23:46:53,388 INFO L290 TraceCheckUtils]: 7: Hoare triple {4266#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {4268#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:53,388 INFO L290 TraceCheckUtils]: 8: Hoare triple {4268#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {4268#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} is VALID [2022-02-20 23:46:53,389 INFO L290 TraceCheckUtils]: 9: Hoare triple {4268#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) 1)} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4269#(and (= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (select |#valid| |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:53,389 INFO L290 TraceCheckUtils]: 10: Hoare triple {4269#(and (= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1) (= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (select |#valid| |ULTIMATE.start_main_~st~0#1.base|)))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {4270#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} is VALID [2022-02-20 23:46:53,390 INFO L290 TraceCheckUtils]: 11: Hoare triple {4270#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {4270#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} is VALID [2022-02-20 23:46:53,390 INFO L290 TraceCheckUtils]: 12: Hoare triple {4270#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) 1)} assume !(1 == #valid[main_~st~0#1.base]); {4267#false} is VALID [2022-02-20 23:46:53,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:53,390 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:53,390 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267795821] [2022-02-20 23:46:53,390 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267795821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,391 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,391 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:53,391 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322952053] [2022-02-20 23:46:53,395 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,395 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,395 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,403 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:46:53,403 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:53,403 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:53,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:53,404 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:53,404 INFO L87 Difference]: Start difference. First operand 146 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,666 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-02-20 23:46:53,666 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:53,666 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:53,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2022-02-20 23:46:53,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,668 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 147 transitions. [2022-02-20 23:46:53,668 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 147 transitions. [2022-02-20 23:46:53,761 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:53,763 INFO L225 Difference]: With dead ends: 159 [2022-02-20 23:46:53,763 INFO L226 Difference]: Without dead ends: 159 [2022-02-20 23:46:53,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:53,763 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 48 mSDsluCounter, 112 mSDsCounter, 0 mSdLazyCounter, 132 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 132 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:53,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 216 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 132 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:53,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 159 states. [2022-02-20 23:46:53,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 159 to 143. [2022-02-20 23:46:53,765 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:53,766 INFO L82 GeneralOperation]: Start isEquivalent. First operand 159 states. Second operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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:46:53,766 INFO L74 IsIncluded]: Start isIncluded. First operand 159 states. Second operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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:46:53,766 INFO L87 Difference]: Start difference. First operand 159 states. Second operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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:46:53,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,768 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-02-20 23:46:53,769 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2022-02-20 23:46:53,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,769 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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 159 states. [2022-02-20 23:46:53,769 INFO L87 Difference]: Start difference. First operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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 159 states. [2022-02-20 23:46:53,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:53,771 INFO L93 Difference]: Finished difference Result 159 states and 183 transitions. [2022-02-20 23:46:53,772 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 183 transitions. [2022-02-20 23:46:53,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:53,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:53,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:53,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:53,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 104 states have (on average 1.6057692307692308) internal successors, (167), 142 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:46:53,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 167 transitions. [2022-02-20 23:46:53,774 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 167 transitions. Word has length 13 [2022-02-20 23:46:53,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:53,775 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 167 transitions. [2022-02-20 23:46:53,775 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.25) internal successors, (13), 5 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:46:53,775 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 167 transitions. [2022-02-20 23:46:53,775 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:46:53,775 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:53,775 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:53,775 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:46:53,775 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:53,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:53,776 INFO L85 PathProgramCache]: Analyzing trace with hash 860725952, now seen corresponding path program 1 times [2022-02-20 23:46:53,776 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:53,776 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [942180068] [2022-02-20 23:46:53,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:53,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:53,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:53,815 INFO L290 TraceCheckUtils]: 0: Hoare triple {4893#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(13, 2); {4893#true} is VALID [2022-02-20 23:46:53,815 INFO L290 TraceCheckUtils]: 1: Hoare triple {4893#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4893#true} is VALID [2022-02-20 23:46:53,815 INFO L290 TraceCheckUtils]: 2: Hoare triple {4893#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {4893#true} is VALID [2022-02-20 23:46:53,815 INFO L290 TraceCheckUtils]: 3: Hoare triple {4893#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {4893#true} is VALID [2022-02-20 23:46:53,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {4893#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {4893#true} is VALID [2022-02-20 23:46:53,816 INFO L290 TraceCheckUtils]: 5: Hoare triple {4893#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4893#true} is VALID [2022-02-20 23:46:53,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {4893#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,817 INFO L290 TraceCheckUtils]: 7: Hoare triple {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,818 INFO L290 TraceCheckUtils]: 9: Hoare triple {4895#(and (= 8 (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:46:53,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {4896#(and (= (+ (select |#length| |ULTIMATE.start_main_~st~0#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} assume !(4 + (4 + main_~st~0#1.offset) <= #length[main_~st~0#1.base] && 0 <= 4 + main_~st~0#1.offset); {4894#false} is VALID [2022-02-20 23:46:53,819 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:53,819 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:53,819 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [942180068] [2022-02-20 23:46:53,819 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [942180068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:53,819 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:53,820 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:53,820 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [961253798] [2022-02-20 23:46:53,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:53,820 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:46:53,820 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:53,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) 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:46:53,828 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:46:53,828 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:46:53,828 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:53,829 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:46:53,829 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:46:53,829 INFO L87 Difference]: Start difference. First operand 143 states and 167 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) 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:46:54,132 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,132 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2022-02-20 23:46:54,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:54,132 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:46:54,132 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) 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:46:54,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2022-02-20 23:46:54,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) 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:46:54,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 170 transitions. [2022-02-20 23:46:54,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 170 transitions. [2022-02-20 23:46:54,247 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:46:54,249 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:46:54,249 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:46:54,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:54,250 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 51 mSDsluCounter, 91 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,250 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 189 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:54,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:46:54,252 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 150. [2022-02-20 23:46:54,252 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,252 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,252 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,253 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,255 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,255 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2022-02-20 23:46:54,255 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2022-02-20 23:46:54,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,256 INFO L74 IsIncluded]: Start isIncluded. First operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 23:46:54,256 INFO L87 Difference]: Start difference. First operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 182 states. [2022-02-20 23:46:54,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,258 INFO L93 Difference]: Finished difference Result 182 states and 208 transitions. [2022-02-20 23:46:54,258 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 208 transitions. [2022-02-20 23:46:54,258 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,258 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,259 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,259 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,259 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 115 states have (on average 1.565217391304348) internal successors, (180), 149 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 180 transitions. [2022-02-20 23:46:54,260 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 180 transitions. Word has length 13 [2022-02-20 23:46:54,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,261 INFO L470 AbstractCegarLoop]: Abstraction has 150 states and 180 transitions. [2022-02-20 23:46:54,261 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) 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:46:54,261 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 180 transitions. [2022-02-20 23:46:54,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:46:54,261 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,261 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:54,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:46:54,262 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:54,262 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1836248265, now seen corresponding path program 1 times [2022-02-20 23:46:54,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1254200589] [2022-02-20 23:46:54,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,263 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,288 INFO L290 TraceCheckUtils]: 0: Hoare triple {5597#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(13, 2); {5597#true} is VALID [2022-02-20 23:46:54,288 INFO L290 TraceCheckUtils]: 1: Hoare triple {5597#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {5597#true} is VALID [2022-02-20 23:46:54,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {5597#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {5597#true} is VALID [2022-02-20 23:46:54,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {5597#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {5597#true} is VALID [2022-02-20 23:46:54,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {5597#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {5597#true} is VALID [2022-02-20 23:46:54,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {5597#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {5597#true} is VALID [2022-02-20 23:46:54,289 INFO L290 TraceCheckUtils]: 6: Hoare triple {5597#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {5597#true} is VALID [2022-02-20 23:46:54,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {5597#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {5597#true} is VALID [2022-02-20 23:46:54,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {5597#true} assume !main_#t~short7#1; {5599#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:46:54,290 INFO L290 TraceCheckUtils]: 9: Hoare triple {5599#(not |ULTIMATE.start_main_#t~short7#1|)} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {5598#false} is VALID [2022-02-20 23:46:54,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {5598#false} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {5598#false} is VALID [2022-02-20 23:46:54,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {5598#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L542 {5598#false} is VALID [2022-02-20 23:46:54,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {5598#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {5598#false} is VALID [2022-02-20 23:46:54,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {5598#false} assume !(1 == #valid[main_~n~0#1.base]); {5598#false} is VALID [2022-02-20 23:46:54,291 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:54,291 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,291 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1254200589] [2022-02-20 23:46:54,291 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1254200589] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,291 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,292 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:46:54,292 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1388941727] [2022-02-20 23:46:54,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,292 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:46:54,292 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,293 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,301 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:46:54,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:46:54,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,301 INFO L87 Difference]: Start difference. First operand 150 states and 180 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,383 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2022-02-20 23:46:54,383 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:46:54,383 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 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 14 [2022-02-20 23:46:54,383 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,383 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 23:46:54,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 116 transitions. [2022-02-20 23:46:54,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 116 transitions. [2022-02-20 23:46:54,457 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,459 INFO L225 Difference]: With dead ends: 152 [2022-02-20 23:46:54,459 INFO L226 Difference]: Without dead ends: 152 [2022-02-20 23:46:54,459 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:46:54,460 INFO L933 BasicCegarLoop]: 113 mSDtfsCounter, 0 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 220 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 220 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:46:54,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 152 states. [2022-02-20 23:46:54,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 152 to 152. [2022-02-20 23:46:54,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 152 states. Second operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,463 INFO L74 IsIncluded]: Start isIncluded. First operand 152 states. Second operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,463 INFO L87 Difference]: Start difference. First operand 152 states. Second operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,465 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2022-02-20 23:46:54,465 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2022-02-20 23:46:54,465 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,466 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,466 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:54,466 INFO L87 Difference]: Start difference. First operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 152 states. [2022-02-20 23:46:54,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,468 INFO L93 Difference]: Finished difference Result 152 states and 182 transitions. [2022-02-20 23:46:54,468 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2022-02-20 23:46:54,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,469 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 117 states have (on average 1.5555555555555556) internal successors, (182), 151 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 182 transitions. [2022-02-20 23:46:54,471 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 182 transitions. Word has length 14 [2022-02-20 23:46:54,471 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,472 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 182 transitions. [2022-02-20 23:46:54,472 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,472 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 182 transitions. [2022-02-20 23:46:54,472 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:46:54,472 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,472 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:46:54,472 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:46:54,473 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:54,473 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,473 INFO L85 PathProgramCache]: Analyzing trace with hash 932171324, now seen corresponding path program 1 times [2022-02-20 23:46:54,473 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1520706483] [2022-02-20 23:46:54,474 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,474 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,521 INFO L290 TraceCheckUtils]: 0: Hoare triple {6210#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(13, 2); {6210#true} is VALID [2022-02-20 23:46:54,522 INFO L290 TraceCheckUtils]: 1: Hoare triple {6210#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6210#true} is VALID [2022-02-20 23:46:54,522 INFO L290 TraceCheckUtils]: 2: Hoare triple {6210#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {6210#true} is VALID [2022-02-20 23:46:54,522 INFO L290 TraceCheckUtils]: 3: Hoare triple {6210#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {6210#true} is VALID [2022-02-20 23:46:54,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {6210#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {6210#true} is VALID [2022-02-20 23:46:54,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {6210#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {6210#true} is VALID [2022-02-20 23:46:54,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {6210#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,523 INFO L290 TraceCheckUtils]: 7: Hoare triple {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,524 INFO L290 TraceCheckUtils]: 9: Hoare triple {6212#(<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|)} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {6213#(and (= (+ (* (- 1) |ULTIMATE.start_main_~st~0#1.base|) |ULTIMATE.start_main_~s~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:54,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {6213#(and (= (+ (* (- 1) |ULTIMATE.start_main_~st~0#1.base|) |ULTIMATE.start_main_~s~0#1.base|) 0) (<= (+ |ULTIMATE.start_main_~s~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,525 INFO L290 TraceCheckUtils]: 11: Hoare triple {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,525 INFO L290 TraceCheckUtils]: 12: Hoare triple {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,526 INFO L290 TraceCheckUtils]: 13: Hoare triple {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,526 INFO L290 TraceCheckUtils]: 14: Hoare triple {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~st~0#1.offset; {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:54,526 INFO L290 TraceCheckUtils]: 15: Hoare triple {6214#(<= (+ |ULTIMATE.start_main_~st~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~st~0#1.base < #StackHeapBarrier); {6211#false} is VALID [2022-02-20 23:46:54,527 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:54,527 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,527 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1520706483] [2022-02-20 23:46:54,527 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1520706483] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,527 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,527 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:54,527 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1754158757] [2022-02-20 23:46:54,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,528 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,528 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,528 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,538 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:46:54,539 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:54,539 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,539 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:54,539 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:54,539 INFO L87 Difference]: Start difference. First operand 152 states and 182 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,759 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2022-02-20 23:46:54,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:54,759 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,759 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:54,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,760 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-02-20 23:46:54,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 142 transitions. [2022-02-20 23:46:54,761 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 142 transitions. [2022-02-20 23:46:54,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 142 edges. 142 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:54,852 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:46:54,852 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:46:54,852 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:54,853 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 47 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:54,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 288 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:54,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:46:54,854 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 153. [2022-02-20 23:46:54,855 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:54,855 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,855 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,855 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,857 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2022-02-20 23:46:54,857 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2022-02-20 23:46:54,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:46:54,858 INFO L87 Difference]: Start difference. First operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:46:54,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:54,860 INFO L93 Difference]: Finished difference Result 166 states and 190 transitions. [2022-02-20 23:46:54,860 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 190 transitions. [2022-02-20 23:46:54,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:54,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:54,860 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:54,860 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:54,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 153 states, 118 states have (on average 1.5508474576271187) internal successors, (183), 152 states have internal predecessors, (183), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 153 states to 153 states and 183 transitions. [2022-02-20 23:46:54,862 INFO L78 Accepts]: Start accepts. Automaton has 153 states and 183 transitions. Word has length 16 [2022-02-20 23:46:54,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:54,862 INFO L470 AbstractCegarLoop]: Abstraction has 153 states and 183 transitions. [2022-02-20 23:46:54,862 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 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:46:54,863 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 183 transitions. [2022-02-20 23:46:54,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:46:54,863 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:54,863 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:46:54,863 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:46:54,863 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:54,864 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:54,864 INFO L85 PathProgramCache]: Analyzing trace with hash 1356387674, now seen corresponding path program 1 times [2022-02-20 23:46:54,864 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:54,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899537171] [2022-02-20 23:46:54,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:54,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:54,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:54,941 INFO L290 TraceCheckUtils]: 0: Hoare triple {6870#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(13, 2); {6870#true} is VALID [2022-02-20 23:46:54,942 INFO L290 TraceCheckUtils]: 1: Hoare triple {6870#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6870#true} is VALID [2022-02-20 23:46:54,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {6870#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,945 INFO L290 TraceCheckUtils]: 3: Hoare triple {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,945 INFO L290 TraceCheckUtils]: 4: Hoare triple {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,946 INFO L290 TraceCheckUtils]: 5: Hoare triple {6872#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) |ULTIMATE.start_main_~root~0#1.offset|) 0))} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {6873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:54,946 INFO L290 TraceCheckUtils]: 6: Hoare triple {6873#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {6874#(and (= |ULTIMATE.start_main_#t~mem5#1.base| 0) (= |ULTIMATE.start_main_#t~mem5#1.offset| 0))} is VALID [2022-02-20 23:46:54,946 INFO L290 TraceCheckUtils]: 7: Hoare triple {6874#(and (= |ULTIMATE.start_main_#t~mem5#1.base| 0) (= |ULTIMATE.start_main_#t~mem5#1.offset| 0))} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {6875#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:46:54,947 INFO L290 TraceCheckUtils]: 8: Hoare triple {6875#(not |ULTIMATE.start_main_#t~short7#1|)} assume main_#t~short7#1; {6871#false} is VALID [2022-02-20 23:46:54,947 INFO L290 TraceCheckUtils]: 9: Hoare triple {6871#false} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L538-3 {6871#false} is VALID [2022-02-20 23:46:54,947 INFO L290 TraceCheckUtils]: 10: Hoare triple {6871#false} main_#t~short7#1 := main_#t~mem6#1.base != 0 || main_#t~mem6#1.offset != 0; {6871#false} is VALID [2022-02-20 23:46:54,947 INFO L290 TraceCheckUtils]: 11: Hoare triple {6871#false} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647; {6871#false} is VALID [2022-02-20 23:46:54,947 INFO L290 TraceCheckUtils]: 12: Hoare triple {6871#false} assume !(0 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {6871#false} is VALID [2022-02-20 23:46:54,948 INFO L290 TraceCheckUtils]: 13: Hoare triple {6871#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L542 {6871#false} is VALID [2022-02-20 23:46:54,948 INFO L290 TraceCheckUtils]: 14: Hoare triple {6871#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {6871#false} is VALID [2022-02-20 23:46:54,948 INFO L290 TraceCheckUtils]: 15: Hoare triple {6871#false} assume !(1 == #valid[main_~n~0#1.base]); {6871#false} is VALID [2022-02-20 23:46:54,949 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:54,949 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:54,949 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899537171] [2022-02-20 23:46:54,949 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899537171] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:54,949 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:54,949 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:46:54,949 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1789913725] [2022-02-20 23:46:54,949 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:54,950 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:46:54,950 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:54,950 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:54,959 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:46:54,959 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:54,959 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:54,959 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:54,959 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:54,960 INFO L87 Difference]: Start difference. First operand 153 states and 183 transitions. Second operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,348 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2022-02-20 23:46:55,348 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:46:55,348 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:46:55,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:55,348 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:46:55,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 159 transitions. [2022-02-20 23:46:55,350 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 159 transitions. [2022-02-20 23:46:55,454 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,456 INFO L225 Difference]: With dead ends: 189 [2022-02-20 23:46:55,456 INFO L226 Difference]: Without dead ends: 189 [2022-02-20 23:46:55,456 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:55,457 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 49 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 149 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 149 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:55,457 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 436 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 149 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:55,457 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2022-02-20 23:46:55,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 167. [2022-02-20 23:46:55,458 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:55,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 189 states. Second operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,459 INFO L74 IsIncluded]: Start isIncluded. First operand 189 states. Second operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,459 INFO L87 Difference]: Start difference. First operand 189 states. Second operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,461 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2022-02-20 23:46:55,461 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2022-02-20 23:46:55,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,462 INFO L74 IsIncluded]: Start isIncluded. First operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:46:55,462 INFO L87 Difference]: Start difference. First operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 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 189 states. [2022-02-20 23:46:55,466 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:55,466 INFO L93 Difference]: Finished difference Result 189 states and 226 transitions. [2022-02-20 23:46:55,466 INFO L276 IsEmpty]: Start isEmpty. Operand 189 states and 226 transitions. [2022-02-20 23:46:55,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:55,467 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:55,467 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:55,467 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:55,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 132 states have (on average 1.5303030303030303) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2022-02-20 23:46:55,468 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 16 [2022-02-20 23:46:55,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:55,469 INFO L470 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2022-02-20 23:46:55,469 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 6 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,469 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2022-02-20 23:46:55,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:55,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:55,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:55,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:46:55,469 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:55,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:55,470 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516449, now seen corresponding path program 1 times [2022-02-20 23:46:55,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:55,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496843863] [2022-02-20 23:46:55,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:55,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:55,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:55,645 INFO L290 TraceCheckUtils]: 0: Hoare triple {7618#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(13, 2); {7618#true} is VALID [2022-02-20 23:46:55,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {7618#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,654 INFO L290 TraceCheckUtils]: 4: Hoare triple {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,654 INFO L290 TraceCheckUtils]: 5: Hoare triple {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,655 INFO L290 TraceCheckUtils]: 6: Hoare triple {7620#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {7621#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {7621#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {7621#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {7621#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {7622#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {7622#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) |ULTIMATE.start_main_~s~0#1.base|)) (= 1 (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {7623#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {7623#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {7624#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:55,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {7624#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {7624#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} is VALID [2022-02-20 23:46:55,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {7624#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4))) 1) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) |ULTIMATE.start_main_~st~0#1.base|)))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {7625#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem25#1.base|) 1) (not (= |ULTIMATE.start_main_~st~0#1.base| |ULTIMATE.start_main_#t~mem25#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} is VALID [2022-02-20 23:46:55,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {7625#(and (= (select |#valid| |ULTIMATE.start_main_#t~mem25#1.base|) 1) (not (= |ULTIMATE.start_main_~st~0#1.base| |ULTIMATE.start_main_#t~mem25#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {7626#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {7626#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume 0 == main_~st~0#1.offset; {7627#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,669 INFO L290 TraceCheckUtils]: 15: Hoare triple {7627#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume main_~st~0#1.base < #StackHeapBarrier; {7627#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} is VALID [2022-02-20 23:46:55,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {7627#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {7628#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:55,670 INFO L290 TraceCheckUtils]: 17: Hoare triple {7628#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !(1 == #valid[main_~n~0#1.base]); {7619#false} is VALID [2022-02-20 23:46:55,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:55,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:55,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496843863] [2022-02-20 23:46:55,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496843863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:55,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:55,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:46:55,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2045599679] [2022-02-20 23:46:55,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:55,671 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:55,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:55,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:55,687 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:55,687 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:46:55,687 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:55,687 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:46:55,687 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:46:55,688 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,773 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2022-02-20 23:46:56,773 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:46:56,773 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:56,774 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:56,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2022-02-20 23:46:56,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 150 transitions. [2022-02-20 23:46:56,775 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 150 transitions. [2022-02-20 23:46:56,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 150 edges. 150 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:56,885 INFO L225 Difference]: With dead ends: 188 [2022-02-20 23:46:56,885 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 23:46:56,886 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=238, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:56,886 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 212 mSDsluCounter, 270 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 590 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:56,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [212 Valid, 320 Invalid, 590 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 565 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:46:56,887 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 23:46:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 172. [2022-02-20 23:46:56,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:56,888 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,889 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,889 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,891 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2022-02-20 23:46:56,891 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2022-02-20 23:46:56,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 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 188 states. [2022-02-20 23:46:56,891 INFO L87 Difference]: Start difference. First operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 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 188 states. [2022-02-20 23:46:56,893 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:56,893 INFO L93 Difference]: Finished difference Result 188 states and 223 transitions. [2022-02-20 23:46:56,893 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 223 transitions. [2022-02-20 23:46:56,894 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:56,894 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:56,894 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:56,894 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:56,894 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 137 states have (on average 1.5182481751824817) internal successors, (208), 171 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 208 transitions. [2022-02-20 23:46:56,895 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 208 transitions. Word has length 18 [2022-02-20 23:46:56,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:56,896 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 208 transitions. [2022-02-20 23:46:56,896 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:56,896 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 208 transitions. [2022-02-20 23:46:56,896 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:56,896 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:56,896 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:56,896 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:46:56,899 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:56,899 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:56,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1831516448, now seen corresponding path program 1 times [2022-02-20 23:46:56,899 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:56,899 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1725317288] [2022-02-20 23:46:56,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:56,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:56,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:57,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {8381#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(13, 2); {8381#true} is VALID [2022-02-20 23:46:57,120 INFO L290 TraceCheckUtils]: 1: Hoare triple {8381#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {8383#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,120 INFO L290 TraceCheckUtils]: 2: Hoare triple {8383#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,121 INFO L290 TraceCheckUtils]: 3: Hoare triple {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} is VALID [2022-02-20 23:46:57,123 INFO L290 TraceCheckUtils]: 6: Hoare triple {8384#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) 1))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {8385#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,123 INFO L290 TraceCheckUtils]: 7: Hoare triple {8385#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {8385#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,124 INFO L290 TraceCheckUtils]: 8: Hoare triple {8385#(and (<= 8 (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| 0) (not (= |ULTIMATE.start_main_~s~0#1.base| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {8386#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,124 INFO L290 TraceCheckUtils]: 9: Hoare triple {8386#(and (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4))) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {8387#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {8387#(and (= |ULTIMATE.start_main_~st~0#1.offset| |ULTIMATE.start_main_~s~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {8388#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} is VALID [2022-02-20 23:46:57,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {8388#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {8388#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} is VALID [2022-02-20 23:46:57,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {8388#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 0) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)))))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {8389#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem25#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem25#1.offset| 0))} is VALID [2022-02-20 23:46:57,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {8389#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem25#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_#t~mem25#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {8390#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,127 INFO L290 TraceCheckUtils]: 14: Hoare triple {8390#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~st~0#1.offset| 0) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} is VALID [2022-02-20 23:46:57,128 INFO L290 TraceCheckUtils]: 17: Hoare triple {8391#(and (<= 8 (select |#length| |ULTIMATE.start_main_~n~0#1.base|)) (= |ULTIMATE.start_main_~n~0#1.offset| 0))} assume !(4 + main_~n~0#1.offset <= #length[main_~n~0#1.base] && 0 <= main_~n~0#1.offset); {8382#false} is VALID [2022-02-20 23:46:57,128 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:57,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:57,128 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1725317288] [2022-02-20 23:46:57,128 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1725317288] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:57,128 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:57,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:46:57,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1687695912] [2022-02-20 23:46:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:57,129 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:57,129 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:57,129 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:57,145 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:57,146 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:46:57,146 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:57,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:46:57,146 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:46:57,146 INFO L87 Difference]: Start difference. First operand 172 states and 208 transitions. Second operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:58,476 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2022-02-20 23:46:58,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:46:58,476 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:58,476 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:58,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 224 transitions. [2022-02-20 23:46:58,477 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,478 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 224 transitions. [2022-02-20 23:46:58,478 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 224 transitions. [2022-02-20 23:46:58,673 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 224 edges. 224 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:58,676 INFO L225 Difference]: With dead ends: 230 [2022-02-20 23:46:58,676 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 23:46:58,676 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=104, Invalid=358, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:46:58,677 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 333 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 625 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 659 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 625 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:58,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 313 Invalid, 659 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 625 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:46:58,677 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 23:46:58,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 187. [2022-02-20 23:46:58,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:58,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,680 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,680 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:58,682 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2022-02-20 23:46:58,682 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2022-02-20 23:46:58,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:58,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:58,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 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 230 states. [2022-02-20 23:46:58,683 INFO L87 Difference]: Start difference. First operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 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 230 states. [2022-02-20 23:46:58,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:58,686 INFO L93 Difference]: Finished difference Result 230 states and 266 transitions. [2022-02-20 23:46:58,686 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 266 transitions. [2022-02-20 23:46:58,687 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:58,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:58,687 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:58,687 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:58,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 187 states, 152 states have (on average 1.480263157894737) internal successors, (225), 186 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 187 states to 187 states and 225 transitions. [2022-02-20 23:46:58,698 INFO L78 Accepts]: Start accepts. Automaton has 187 states and 225 transitions. Word has length 18 [2022-02-20 23:46:58,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:58,698 INFO L470 AbstractCegarLoop]: Abstraction has 187 states and 225 transitions. [2022-02-20 23:46:58,698 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.8) internal successors, (18), 11 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,698 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 225 transitions. [2022-02-20 23:46:58,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:58,699 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:58,699 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:58,699 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:46:58,699 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:58,700 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:58,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793954, now seen corresponding path program 1 times [2022-02-20 23:46:58,700 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:58,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2133943612] [2022-02-20 23:46:58,700 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:58,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:58,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:58,748 INFO L290 TraceCheckUtils]: 0: Hoare triple {9293#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(13, 2); {9293#true} is VALID [2022-02-20 23:46:58,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {9293#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {9293#true} is VALID [2022-02-20 23:46:58,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {9293#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {9293#true} is VALID [2022-02-20 23:46:58,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {9293#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {9293#true} is VALID [2022-02-20 23:46:58,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {9293#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {9293#true} is VALID [2022-02-20 23:46:58,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {9293#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {9293#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {9293#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {9293#true} assume !main_#t~short7#1; {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {9293#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 10: Hoare triple {9293#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 11: Hoare triple {9293#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {9293#true} is VALID [2022-02-20 23:46:58,750 INFO L290 TraceCheckUtils]: 12: Hoare triple {9293#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {9293#true} is VALID [2022-02-20 23:46:58,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {9293#true} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8); {9295#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} is VALID [2022-02-20 23:46:58,752 INFO L290 TraceCheckUtils]: 14: Hoare triple {9295#(= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L545 {9296#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:58,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {9296#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {9296#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:58,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {9296#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L546 {9297#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:46:58,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {9297#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume !(1 == #valid[main_#t~mem15#1.base]); {9294#false} is VALID [2022-02-20 23:46:58,753 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:58,754 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:58,754 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2133943612] [2022-02-20 23:46:58,754 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2133943612] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:58,754 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:58,754 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:58,754 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923208554] [2022-02-20 23:46:58,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:58,755 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:58,755 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:58,755 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:58,764 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:58,765 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:58,765 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:58,765 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:58,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:58,765 INFO L87 Difference]: Start difference. First operand 187 states and 225 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,079 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-02-20 23:46:59,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:59,079 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:59,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:59,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:46:59,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 114 transitions. [2022-02-20 23:46:59,080 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 114 transitions. [2022-02-20 23:46:59,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,144 INFO L225 Difference]: With dead ends: 186 [2022-02-20 23:46:59,144 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 23:46:59,144 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:59,145 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 6 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 273 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:59,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 273 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:59,145 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 23:46:59,147 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 186. [2022-02-20 23:46:59,147 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:59,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,148 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,148 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,150 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-02-20 23:46:59,150 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2022-02-20 23:46:59,151 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,151 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,151 INFO L74 IsIncluded]: Start isIncluded. First operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 186 states. [2022-02-20 23:46:59,151 INFO L87 Difference]: Start difference. First operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 186 states. [2022-02-20 23:46:59,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,153 INFO L93 Difference]: Finished difference Result 186 states and 223 transitions. [2022-02-20 23:46:59,154 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2022-02-20 23:46:59,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:59,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:59,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 186 states, 152 states have (on average 1.4671052631578947) internal successors, (223), 185 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 186 states to 186 states and 223 transitions. [2022-02-20 23:46:59,157 INFO L78 Accepts]: Start accepts. Automaton has 186 states and 223 transitions. Word has length 18 [2022-02-20 23:46:59,157 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:59,157 INFO L470 AbstractCegarLoop]: Abstraction has 186 states and 223 transitions. [2022-02-20 23:46:59,157 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,157 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 223 transitions. [2022-02-20 23:46:59,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:46:59,157 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:59,157 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:59,158 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:46:59,158 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:59,158 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:59,158 INFO L85 PathProgramCache]: Analyzing trace with hash 1821793955, now seen corresponding path program 1 times [2022-02-20 23:46:59,158 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:59,158 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1361657228] [2022-02-20 23:46:59,159 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:59,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:59,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:59,198 INFO L290 TraceCheckUtils]: 0: Hoare triple {10048#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(13, 2); {10048#true} is VALID [2022-02-20 23:46:59,198 INFO L290 TraceCheckUtils]: 1: Hoare triple {10048#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 2: Hoare triple {10048#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 3: Hoare triple {10048#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 4: Hoare triple {10048#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {10048#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 6: Hoare triple {10048#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 7: Hoare triple {10048#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {10048#true} is VALID [2022-02-20 23:46:59,199 INFO L290 TraceCheckUtils]: 8: Hoare triple {10048#true} assume !main_#t~short7#1; {10048#true} is VALID [2022-02-20 23:46:59,200 INFO L290 TraceCheckUtils]: 9: Hoare triple {10048#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {10048#true} is VALID [2022-02-20 23:46:59,200 INFO L290 TraceCheckUtils]: 10: Hoare triple {10048#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {10048#true} is VALID [2022-02-20 23:46:59,200 INFO L290 TraceCheckUtils]: 11: Hoare triple {10048#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {10048#true} is VALID [2022-02-20 23:46:59,200 INFO L290 TraceCheckUtils]: 12: Hoare triple {10048#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {10048#true} is VALID [2022-02-20 23:46:59,201 INFO L290 TraceCheckUtils]: 13: Hoare triple {10048#true} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8); {10050#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:46:59,202 INFO L290 TraceCheckUtils]: 14: Hoare triple {10050#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 8) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L545 {10051#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:59,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {10051#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {10051#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:46:59,203 INFO L290 TraceCheckUtils]: 16: Hoare triple {10051#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L546 {10052#(and (= |ULTIMATE.start_main_#t~mem15#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:46:59,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {10052#(and (= |ULTIMATE.start_main_#t~mem15#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|) (- 8)) 0))} assume !(4 + main_#t~mem15#1.offset <= #length[main_#t~mem15#1.base] && 0 <= main_#t~mem15#1.offset); {10049#false} is VALID [2022-02-20 23:46:59,203 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:59,203 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:59,204 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1361657228] [2022-02-20 23:46:59,204 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1361657228] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:59,204 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:59,204 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:46:59,204 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1202402391] [2022-02-20 23:46:59,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:59,205 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:59,205 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:59,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,216 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,216 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:46:59,216 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:59,217 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:46:59,217 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:46:59,217 INFO L87 Difference]: Start difference. First operand 186 states and 223 transitions. Second operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,550 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2022-02-20 23:46:59,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:46:59,550 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:46:59,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:59,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-02-20 23:46:59,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 113 transitions. [2022-02-20 23:46:59,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 113 transitions. [2022-02-20 23:46:59,621 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,623 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:46:59,623 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:46:59,623 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:46:59,623 INFO L933 BasicCegarLoop]: 107 mSDtfsCounter, 4 mSDsluCounter, 148 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 255 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:59,623 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 255 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:46:59,624 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:46:59,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 185. [2022-02-20 23:46:59,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:59,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,626 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,626 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,628 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2022-02-20 23:46:59,628 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2022-02-20 23:46:59,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,629 INFO L74 IsIncluded]: Start isIncluded. First operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:46:59,629 INFO L87 Difference]: Start difference. First operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:46:59,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:59,631 INFO L93 Difference]: Finished difference Result 185 states and 221 transitions. [2022-02-20 23:46:59,632 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2022-02-20 23:46:59,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:59,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:59,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:59,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:59,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 185 states, 152 states have (on average 1.4539473684210527) internal successors, (221), 184 states have internal predecessors, (221), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 185 states to 185 states and 221 transitions. [2022-02-20 23:46:59,634 INFO L78 Accepts]: Start accepts. Automaton has 185 states and 221 transitions. Word has length 18 [2022-02-20 23:46:59,635 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:59,635 INFO L470 AbstractCegarLoop]: Abstraction has 185 states and 221 transitions. [2022-02-20 23:46:59,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.5) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,635 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 221 transitions. [2022-02-20 23:46:59,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:46:59,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:59,635 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:59,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:46:59,636 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:46:59,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:59,636 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983029, now seen corresponding path program 1 times [2022-02-20 23:46:59,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:46:59,636 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1508145598] [2022-02-20 23:46:59,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:59,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:46:59,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:59,698 INFO L290 TraceCheckUtils]: 0: Hoare triple {10799#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(13, 2); {10799#true} is VALID [2022-02-20 23:46:59,699 INFO L290 TraceCheckUtils]: 1: Hoare triple {10799#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10799#true} is VALID [2022-02-20 23:46:59,699 INFO L290 TraceCheckUtils]: 2: Hoare triple {10799#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {10799#true} is VALID [2022-02-20 23:46:59,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {10799#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {10799#true} is VALID [2022-02-20 23:46:59,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {10799#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {10799#true} is VALID [2022-02-20 23:46:59,699 INFO L290 TraceCheckUtils]: 5: Hoare triple {10799#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {10799#true} is VALID [2022-02-20 23:46:59,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {10799#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,700 INFO L290 TraceCheckUtils]: 7: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,700 INFO L290 TraceCheckUtils]: 8: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,701 INFO L290 TraceCheckUtils]: 9: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,701 INFO L290 TraceCheckUtils]: 10: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,701 INFO L290 TraceCheckUtils]: 11: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,702 INFO L290 TraceCheckUtils]: 12: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:46:59,702 INFO L290 TraceCheckUtils]: 13: Hoare triple {10801#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8); {10802#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} is VALID [2022-02-20 23:46:59,703 INFO L290 TraceCheckUtils]: 14: Hoare triple {10802#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc14#1.base|) 1) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L545 {10803#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:46:59,704 INFO L290 TraceCheckUtils]: 15: Hoare triple {10803#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {10803#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:46:59,704 INFO L290 TraceCheckUtils]: 16: Hoare triple {10803#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L546 {10804#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} is VALID [2022-02-20 23:46:59,705 INFO L290 TraceCheckUtils]: 17: Hoare triple {10804#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L546-1 {10805#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:59,705 INFO L290 TraceCheckUtils]: 18: Hoare triple {10805#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {10805#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} is VALID [2022-02-20 23:46:59,706 INFO L290 TraceCheckUtils]: 19: Hoare triple {10805#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 1)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {10806#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} is VALID [2022-02-20 23:46:59,706 INFO L290 TraceCheckUtils]: 20: Hoare triple {10806#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} assume !(1 == #valid[main_#t~mem16#1.base]); {10800#false} is VALID [2022-02-20 23:46:59,706 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:59,706 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:46:59,707 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1508145598] [2022-02-20 23:46:59,707 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1508145598] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:59,707 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:59,707 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:46:59,707 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [876272608] [2022-02-20 23:46:59,707 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:59,708 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:46:59,708 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:59,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:59,722 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:59,723 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:46:59,723 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:46:59,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:46:59,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:59,724 INFO L87 Difference]: Start difference. First operand 185 states and 221 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,169 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-02-20 23:47:00,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:47:00,170 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:47:00,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:00,170 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-02-20 23:47:00,171 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,171 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 116 transitions. [2022-02-20 23:47:00,171 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 116 transitions. [2022-02-20 23:47:00,257 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,259 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:47:00,259 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:47:00,259 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:47:00,260 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 80 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 274 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 80 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 285 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 274 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:00,260 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [80 Valid, 214 Invalid, 285 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 274 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:00,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:47:00,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 184. [2022-02-20 23:47:00,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:00,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,263 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,263 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,265 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-02-20 23:47:00,265 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-02-20 23:47:00,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,266 INFO L74 IsIncluded]: Start isIncluded. First operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:47:00,267 INFO L87 Difference]: Start difference. First operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:47:00,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:00,281 INFO L93 Difference]: Finished difference Result 187 states and 223 transitions. [2022-02-20 23:47:00,281 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 223 transitions. [2022-02-20 23:47:00,282 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:00,283 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:00,283 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:00,283 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:00,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 184 states, 152 states have (on average 1.4407894736842106) internal successors, (219), 183 states have internal predecessors, (219), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 184 states to 184 states and 219 transitions. [2022-02-20 23:47:00,288 INFO L78 Accepts]: Start accepts. Automaton has 184 states and 219 transitions. Word has length 21 [2022-02-20 23:47:00,289 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:00,289 INFO L470 AbstractCegarLoop]: Abstraction has 184 states and 219 transitions. [2022-02-20 23:47:00,289 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,289 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 219 transitions. [2022-02-20 23:47:00,289 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:47:00,289 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:00,290 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:00,290 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:47:00,290 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:00,292 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:00,292 INFO L85 PathProgramCache]: Analyzing trace with hash 1856983030, now seen corresponding path program 1 times [2022-02-20 23:47:00,293 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:00,293 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1585260030] [2022-02-20 23:47:00,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:00,293 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:00,319 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:00,392 INFO L290 TraceCheckUtils]: 0: Hoare triple {11566#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(13, 2); {11566#true} is VALID [2022-02-20 23:47:00,392 INFO L290 TraceCheckUtils]: 1: Hoare triple {11566#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {11566#true} is VALID [2022-02-20 23:47:00,393 INFO L290 TraceCheckUtils]: 2: Hoare triple {11566#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {11566#true} is VALID [2022-02-20 23:47:00,393 INFO L290 TraceCheckUtils]: 3: Hoare triple {11566#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {11566#true} is VALID [2022-02-20 23:47:00,393 INFO L290 TraceCheckUtils]: 4: Hoare triple {11566#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {11566#true} is VALID [2022-02-20 23:47:00,393 INFO L290 TraceCheckUtils]: 5: Hoare triple {11566#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {11566#true} is VALID [2022-02-20 23:47:00,393 INFO L290 TraceCheckUtils]: 6: Hoare triple {11566#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,394 INFO L290 TraceCheckUtils]: 7: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,394 INFO L290 TraceCheckUtils]: 8: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,395 INFO L290 TraceCheckUtils]: 10: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,395 INFO L290 TraceCheckUtils]: 11: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,395 INFO L290 TraceCheckUtils]: 12: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:00,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {11568#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1;call main_#t~malloc14#1.base, main_#t~malloc14#1.offset := #Ultimate.allocOnHeap(8); {11569#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} is VALID [2022-02-20 23:47:00,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {11569#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc14#1.base|) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc14#1.base|)) (= |ULTIMATE.start_main_#t~malloc14#1.offset| 0))} SUMMARY for call write~$Pointer$(main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L545 {11570#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:00,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {11570#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~malloc14#1.base, main_#t~malloc14#1.offset; {11570#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:00,398 INFO L290 TraceCheckUtils]: 16: Hoare triple {11570#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L546 {11571#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:00,399 INFO L290 TraceCheckUtils]: 17: Hoare triple {11571#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem15#1.base, main_#t~mem15#1.offset, 4); srcloc: L546-1 {11572#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:00,399 INFO L290 TraceCheckUtils]: 18: Hoare triple {11572#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {11572#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} is VALID [2022-02-20 23:47:00,400 INFO L290 TraceCheckUtils]: 19: Hoare triple {11572#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) 0))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L547 {11573#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} is VALID [2022-02-20 23:47:00,401 INFO L290 TraceCheckUtils]: 20: Hoare triple {11573#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem16#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem16#1.offset| 0))} assume !(4 + (4 + main_#t~mem16#1.offset) <= #length[main_#t~mem16#1.base] && 0 <= 4 + main_#t~mem16#1.offset); {11567#false} is VALID [2022-02-20 23:47:00,401 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:00,401 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:00,401 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1585260030] [2022-02-20 23:47:00,401 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1585260030] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:00,401 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:00,402 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:00,402 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [205193501] [2022-02-20 23:47:00,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:00,402 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:47:00,402 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:00,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:00,416 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:00,416 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:00,416 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:00,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:00,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:00,417 INFO L87 Difference]: Start difference. First operand 184 states and 219 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,128 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-02-20 23:47:01,128 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:47:01,128 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 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 21 [2022-02-20 23:47:01,128 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:01,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2022-02-20 23:47:01,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 115 transitions. [2022-02-20 23:47:01,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 115 transitions. [2022-02-20 23:47:01,224 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,225 INFO L225 Difference]: With dead ends: 186 [2022-02-20 23:47:01,225 INFO L226 Difference]: Without dead ends: 186 [2022-02-20 23:47:01,225 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:47:01,226 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 72 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 403 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 414 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 403 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:01,226 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 294 Invalid, 414 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 403 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:01,227 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 186 states. [2022-02-20 23:47:01,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 186 to 183. [2022-02-20 23:47:01,228 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:01,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 186 states. Second operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,229 INFO L74 IsIncluded]: Start isIncluded. First operand 186 states. Second operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,229 INFO L87 Difference]: Start difference. First operand 186 states. Second operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,231 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,231 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-02-20 23:47:01,231 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2022-02-20 23:47:01,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,232 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 186 states. [2022-02-20 23:47:01,232 INFO L87 Difference]: Start difference. First operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 186 states. [2022-02-20 23:47:01,234 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,234 INFO L93 Difference]: Finished difference Result 186 states and 221 transitions. [2022-02-20 23:47:01,234 INFO L276 IsEmpty]: Start isEmpty. Operand 186 states and 221 transitions. [2022-02-20 23:47:01,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,234 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:01,234 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:01,235 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 152 states have (on average 1.4276315789473684) internal successors, (217), 182 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,236 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 217 transitions. [2022-02-20 23:47:01,236 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 217 transitions. Word has length 21 [2022-02-20 23:47:01,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:01,237 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 217 transitions. [2022-02-20 23:47:01,237 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,237 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 217 transitions. [2022-02-20 23:47:01,237 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:01,237 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:01,237 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:01,238 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:47:01,238 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:01,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:01,238 INFO L85 PathProgramCache]: Analyzing trace with hash 27790463, now seen corresponding path program 1 times [2022-02-20 23:47:01,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:01,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [773069674] [2022-02-20 23:47:01,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:01,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:01,252 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:01,270 INFO L290 TraceCheckUtils]: 0: Hoare triple {12329#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(13, 2); {12329#true} is VALID [2022-02-20 23:47:01,270 INFO L290 TraceCheckUtils]: 1: Hoare triple {12329#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {12329#true} is VALID [2022-02-20 23:47:01,270 INFO L290 TraceCheckUtils]: 2: Hoare triple {12329#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {12329#true} is VALID [2022-02-20 23:47:01,270 INFO L290 TraceCheckUtils]: 3: Hoare triple {12329#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 4: Hoare triple {12329#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 5: Hoare triple {12329#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 6: Hoare triple {12329#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 7: Hoare triple {12329#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 8: Hoare triple {12329#true} assume !main_#t~short7#1; {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 9: Hoare triple {12329#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {12329#true} is VALID [2022-02-20 23:47:01,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {12329#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {12329#true} is VALID [2022-02-20 23:47:01,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {12329#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {12329#true} is VALID [2022-02-20 23:47:01,272 INFO L290 TraceCheckUtils]: 12: Hoare triple {12329#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {12329#true} is VALID [2022-02-20 23:47:01,272 INFO L290 TraceCheckUtils]: 13: Hoare triple {12329#true} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {12329#true} is VALID [2022-02-20 23:47:01,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {12329#true} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544-5 {12329#true} is VALID [2022-02-20 23:47:01,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {12329#true} main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {12329#true} is VALID [2022-02-20 23:47:01,273 INFO L290 TraceCheckUtils]: 16: Hoare triple {12329#true} assume main_#t~short19#1;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_#t~short19#1 := 0 != main_#t~nondet18#1; {12329#true} is VALID [2022-02-20 23:47:01,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {12329#true} assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8); {12331#(= (select |#valid| |ULTIMATE.start_main_#t~malloc20#1.base|) 1)} is VALID [2022-02-20 23:47:01,276 INFO L290 TraceCheckUtils]: 18: Hoare triple {12331#(= (select |#valid| |ULTIMATE.start_main_#t~malloc20#1.base|) 1)} SUMMARY for call write~$Pointer$(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L550 {12332#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:01,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {12332#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset; {12332#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:01,277 INFO L290 TraceCheckUtils]: 20: Hoare triple {12332#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L551 {12333#(= (select |#valid| |ULTIMATE.start_main_#t~mem21#1.base|) 1)} is VALID [2022-02-20 23:47:01,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {12333#(= (select |#valid| |ULTIMATE.start_main_#t~mem21#1.base|) 1)} assume !(1 == #valid[main_#t~mem21#1.base]); {12330#false} is VALID [2022-02-20 23:47:01,280 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:47:01,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:01,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [773069674] [2022-02-20 23:47:01,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [773069674] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:01,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:01,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:01,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980305098] [2022-02-20 23:47:01,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:01,281 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:01,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:01,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,294 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,294 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:01,294 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:01,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:01,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:01,295 INFO L87 Difference]: Start difference. First operand 183 states and 217 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,593 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,593 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-02-20 23:47:01,593 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:01,593 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:01,593 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:01,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:47:01,594 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 110 transitions. [2022-02-20 23:47:01,594 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 110 transitions. [2022-02-20 23:47:01,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,661 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:47:01,661 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:47:01,661 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:01,662 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 6 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:01,662 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 263 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:01,662 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:47:01,664 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 182. [2022-02-20 23:47:01,664 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:01,664 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,664 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,665 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,666 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,666 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-02-20 23:47:01,666 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2022-02-20 23:47:01,666 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,666 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,667 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:01,668 INFO L87 Difference]: Start difference. First operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:01,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:01,669 INFO L93 Difference]: Finished difference Result 182 states and 215 transitions. [2022-02-20 23:47:01,669 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2022-02-20 23:47:01,670 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:01,670 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:01,670 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:01,670 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:01,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 152 states have (on average 1.4144736842105263) internal successors, (215), 181 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 215 transitions. [2022-02-20 23:47:01,672 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 215 transitions. Word has length 22 [2022-02-20 23:47:01,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:01,672 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 215 transitions. [2022-02-20 23:47:01,672 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,672 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 215 transitions. [2022-02-20 23:47:01,673 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:01,673 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:01,673 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:01,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:47:01,674 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:01,674 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:01,674 INFO L85 PathProgramCache]: Analyzing trace with hash 27790464, now seen corresponding path program 1 times [2022-02-20 23:47:01,674 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:01,674 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2109235413] [2022-02-20 23:47:01,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:01,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:01,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 0: Hoare triple {13068#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(13, 2); {13068#true} is VALID [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 1: Hoare triple {13068#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {13068#true} is VALID [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 2: Hoare triple {13068#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {13068#true} is VALID [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 3: Hoare triple {13068#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {13068#true} is VALID [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 4: Hoare triple {13068#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {13068#true} is VALID [2022-02-20 23:47:01,736 INFO L290 TraceCheckUtils]: 5: Hoare triple {13068#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 6: Hoare triple {13068#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 7: Hoare triple {13068#true} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 8: Hoare triple {13068#true} assume !main_#t~short7#1; {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 9: Hoare triple {13068#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 10: Hoare triple {13068#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {13068#true} is VALID [2022-02-20 23:47:01,737 INFO L290 TraceCheckUtils]: 11: Hoare triple {13068#true} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {13068#true} is VALID [2022-02-20 23:47:01,738 INFO L290 TraceCheckUtils]: 12: Hoare triple {13068#true} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {13068#true} is VALID [2022-02-20 23:47:01,738 INFO L290 TraceCheckUtils]: 13: Hoare triple {13068#true} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {13068#true} is VALID [2022-02-20 23:47:01,738 INFO L290 TraceCheckUtils]: 14: Hoare triple {13068#true} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544-5 {13068#true} is VALID [2022-02-20 23:47:01,738 INFO L290 TraceCheckUtils]: 15: Hoare triple {13068#true} main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {13068#true} is VALID [2022-02-20 23:47:01,738 INFO L290 TraceCheckUtils]: 16: Hoare triple {13068#true} assume main_#t~short19#1;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_#t~short19#1 := 0 != main_#t~nondet18#1; {13068#true} is VALID [2022-02-20 23:47:01,739 INFO L290 TraceCheckUtils]: 17: Hoare triple {13068#true} assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8); {13070#(and (= |ULTIMATE.start_main_#t~malloc20#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc20#1.base|)))} is VALID [2022-02-20 23:47:01,740 INFO L290 TraceCheckUtils]: 18: Hoare triple {13070#(and (= |ULTIMATE.start_main_#t~malloc20#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_#t~malloc20#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L550 {13071#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:01,740 INFO L290 TraceCheckUtils]: 19: Hoare triple {13071#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset; {13071#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:01,740 INFO L290 TraceCheckUtils]: 20: Hoare triple {13071#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L551 {13072#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|)) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} is VALID [2022-02-20 23:47:01,741 INFO L290 TraceCheckUtils]: 21: Hoare triple {13072#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem21#1.base|)) (= |ULTIMATE.start_main_#t~mem21#1.offset| 0))} assume !(4 + main_#t~mem21#1.offset <= #length[main_#t~mem21#1.base] && 0 <= main_#t~mem21#1.offset); {13069#false} is VALID [2022-02-20 23:47:01,742 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:47:01,742 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:01,742 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2109235413] [2022-02-20 23:47:01,743 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2109235413] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:01,743 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:01,743 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:01,743 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [199227814] [2022-02-20 23:47:01,743 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:01,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:01,744 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:01,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:01,757 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:01,757 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:01,757 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:01,758 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:01,758 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:01,758 INFO L87 Difference]: Start difference. First operand 182 states and 215 transitions. Second operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,076 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2022-02-20 23:47:02,076 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:02,076 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:02,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:02,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:47:02,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,078 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 109 transitions. [2022-02-20 23:47:02,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 109 transitions. [2022-02-20 23:47:02,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,153 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:02,153 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:02,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:02,154 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 4 mSDsluCounter, 142 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 179 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:02,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 179 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:02,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:02,156 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 181. [2022-02-20 23:47:02,156 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:02,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,157 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,157 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,159 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2022-02-20 23:47:02,159 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-02-20 23:47:02,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,160 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 181 states. [2022-02-20 23:47:02,160 INFO L87 Difference]: Start difference. First operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 181 states. [2022-02-20 23:47:02,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:02,162 INFO L93 Difference]: Finished difference Result 181 states and 213 transitions. [2022-02-20 23:47:02,162 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-02-20 23:47:02,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:02,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:02,162 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:02,162 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:02,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 152 states have (on average 1.4013157894736843) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2022-02-20 23:47:02,164 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 22 [2022-02-20 23:47:02,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:02,164 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2022-02-20 23:47:02,164 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.5) internal successors, (22), 5 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,165 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-02-20 23:47:02,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:47:02,165 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:02,165 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:02,165 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:47:02,165 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:02,166 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:02,166 INFO L85 PathProgramCache]: Analyzing trace with hash -496178395, now seen corresponding path program 1 times [2022-02-20 23:47:02,166 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:02,166 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1980971741] [2022-02-20 23:47:02,166 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:02,166 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:02,183 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:02,274 INFO L290 TraceCheckUtils]: 0: Hoare triple {13803#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(13, 2); {13803#true} is VALID [2022-02-20 23:47:02,275 INFO L290 TraceCheckUtils]: 1: Hoare triple {13803#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:02,276 INFO L290 TraceCheckUtils]: 2: Hoare triple {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:02,276 INFO L290 TraceCheckUtils]: 3: Hoare triple {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:02,277 INFO L290 TraceCheckUtils]: 4: Hoare triple {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:02,277 INFO L290 TraceCheckUtils]: 5: Hoare triple {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:02,278 INFO L290 TraceCheckUtils]: 6: Hoare triple {13805#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|))} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {13806#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:02,278 INFO L290 TraceCheckUtils]: 7: Hoare triple {13806#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {13806#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:02,279 INFO L290 TraceCheckUtils]: 8: Hoare triple {13806#(and (= |ULTIMATE.start_main_~root~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~root~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {13807#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:02,279 INFO L290 TraceCheckUtils]: 9: Hoare triple {13807#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (+ |ULTIMATE.start_main_~s~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {13808#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= (+ |ULTIMATE.start_main_~s~0#1.offset| 4) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:02,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {13808#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= (+ |ULTIMATE.start_main_~s~0#1.offset| 4) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {13809#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {13809#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|)} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {13809#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,281 INFO L290 TraceCheckUtils]: 12: Hoare triple {13809#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (+ |ULTIMATE.start_main_~st~0#1.offset| 4)) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {13810#(<= (+ |ULTIMATE.start_main_#t~mem25#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,281 INFO L290 TraceCheckUtils]: 13: Hoare triple {13810#(<= (+ |ULTIMATE.start_main_#t~mem25#1.base| 1) |#StackHeapBarrier|)} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,281 INFO L290 TraceCheckUtils]: 14: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~st~0#1.offset; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,282 INFO L290 TraceCheckUtils]: 15: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume main_~st~0#1.base < #StackHeapBarrier; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,282 INFO L290 TraceCheckUtils]: 16: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,283 INFO L290 TraceCheckUtils]: 17: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L564 {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,283 INFO L290 TraceCheckUtils]: 18: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem26#1.base != 0 || main_#t~mem26#1.offset != 0);havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,283 INFO L290 TraceCheckUtils]: 19: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem29#1.base, main_#t~mem29#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L564-3 {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,284 INFO L290 TraceCheckUtils]: 20: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem29#1.base != 0 || main_#t~mem29#1.offset != 0);havoc main_#t~mem29#1.base, main_#t~mem29#1.offset; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,284 INFO L290 TraceCheckUtils]: 21: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_~n~0#1.offset; {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:02,284 INFO L290 TraceCheckUtils]: 22: Hoare triple {13811#(<= (+ |ULTIMATE.start_main_~n~0#1.base| 1) |#StackHeapBarrier|)} assume !(main_~n~0#1.base < #StackHeapBarrier); {13804#false} is VALID [2022-02-20 23:47:02,285 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:47:02,285 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:02,285 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1980971741] [2022-02-20 23:47:02,285 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1980971741] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:02,285 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:02,285 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:02,285 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [62903047] [2022-02-20 23:47:02,285 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:02,286 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:02,286 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:02,286 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:02,322 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:02,322 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:02,322 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:02,323 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:02,323 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:02,323 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,071 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,071 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-02-20 23:47:03,071 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:03,072 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:47:03,072 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,076 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2022-02-20 23:47:03,076 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,077 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 192 transitions. [2022-02-20 23:47:03,077 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 192 transitions. [2022-02-20 23:47:03,210 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:47:03,211 INFO L225 Difference]: With dead ends: 199 [2022-02-20 23:47:03,212 INFO L226 Difference]: Without dead ends: 199 [2022-02-20 23:47:03,212 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=204, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:47:03,212 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 273 mSDsluCounter, 304 mSDsCounter, 0 mSdLazyCounter, 300 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 311 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 300 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,212 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 382 Invalid, 311 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 300 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:03,213 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2022-02-20 23:47:03,214 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 183. [2022-02-20 23:47:03,215 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,215 INFO L82 GeneralOperation]: Start isEquivalent. First operand 199 states. Second operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,215 INFO L74 IsIncluded]: Start isIncluded. First operand 199 states. Second operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,215 INFO L87 Difference]: Start difference. First operand 199 states. Second operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,218 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-02-20 23:47:03,218 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-02-20 23:47:03,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,218 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 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 199 states. [2022-02-20 23:47:03,219 INFO L87 Difference]: Start difference. First operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 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 199 states. [2022-02-20 23:47:03,221 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,221 INFO L93 Difference]: Finished difference Result 199 states and 233 transitions. [2022-02-20 23:47:03,221 INFO L276 IsEmpty]: Start isEmpty. Operand 199 states and 233 transitions. [2022-02-20 23:47:03,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,222 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 154 states have (on average 1.396103896103896) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-02-20 23:47:03,224 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 23 [2022-02-20 23:47:03,224 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,224 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-02-20 23:47:03,224 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,224 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-02-20 23:47:03,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:03,225 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,225 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:03,225 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:47:03,225 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:03,225 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:03,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919462, now seen corresponding path program 1 times [2022-02-20 23:47:03,225 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:03,226 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2139318075] [2022-02-20 23:47:03,226 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,226 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:03,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:03,287 INFO L290 TraceCheckUtils]: 0: Hoare triple {14610#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(13, 2); {14610#true} is VALID [2022-02-20 23:47:03,287 INFO L290 TraceCheckUtils]: 1: Hoare triple {14610#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {14610#true} is VALID [2022-02-20 23:47:03,288 INFO L290 TraceCheckUtils]: 2: Hoare triple {14610#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {14610#true} is VALID [2022-02-20 23:47:03,288 INFO L290 TraceCheckUtils]: 3: Hoare triple {14610#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {14610#true} is VALID [2022-02-20 23:47:03,288 INFO L290 TraceCheckUtils]: 4: Hoare triple {14610#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {14610#true} is VALID [2022-02-20 23:47:03,288 INFO L290 TraceCheckUtils]: 5: Hoare triple {14610#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {14610#true} is VALID [2022-02-20 23:47:03,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {14610#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,289 INFO L290 TraceCheckUtils]: 7: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,289 INFO L290 TraceCheckUtils]: 8: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,291 INFO L290 TraceCheckUtils]: 12: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,291 INFO L290 TraceCheckUtils]: 13: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,291 INFO L290 TraceCheckUtils]: 14: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544-5 {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,292 INFO L290 TraceCheckUtils]: 16: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short19#1;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_#t~short19#1 := 0 != main_#t~nondet18#1; {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:03,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {14612#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8); {14613#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc20#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc20#1.base|) 1))} is VALID [2022-02-20 23:47:03,293 INFO L290 TraceCheckUtils]: 18: Hoare triple {14613#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc20#1.base|)) (= (select |#valid| |ULTIMATE.start_main_#t~malloc20#1.base|) 1))} SUMMARY for call write~$Pointer$(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L550 {14614#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:47:03,294 INFO L290 TraceCheckUtils]: 19: Hoare triple {14614#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset; {14614#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} is VALID [2022-02-20 23:47:03,294 INFO L290 TraceCheckUtils]: 20: Hoare triple {14614#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L551 {14615#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:03,295 INFO L290 TraceCheckUtils]: 21: Hoare triple {14615#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4); srcloc: L551-1 {14616#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:03,295 INFO L290 TraceCheckUtils]: 22: Hoare triple {14616#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {14616#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} is VALID [2022-02-20 23:47:03,296 INFO L290 TraceCheckUtils]: 23: Hoare triple {14616#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4))) 1)} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L552 {14617#(= (select |#valid| |ULTIMATE.start_main_#t~mem22#1.base|) 1)} is VALID [2022-02-20 23:47:03,296 INFO L290 TraceCheckUtils]: 24: Hoare triple {14617#(= (select |#valid| |ULTIMATE.start_main_#t~mem22#1.base|) 1)} assume !(1 == #valid[main_#t~mem22#1.base]); {14611#false} is VALID [2022-02-20 23:47:03,296 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:47:03,296 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:03,296 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2139318075] [2022-02-20 23:47:03,297 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2139318075] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:03,297 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:03,297 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:03,297 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1900547084] [2022-02-20 23:47:03,297 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:03,297 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:03,297 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:03,298 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,313 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:03,313 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:03,313 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:03,313 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:03,313 INFO L87 Difference]: Start difference. First operand 183 states and 215 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,848 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-02-20 23:47:03,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:47:03,848 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:03,848 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:03,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-02-20 23:47:03,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 112 transitions. [2022-02-20 23:47:03,849 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 112 transitions. [2022-02-20 23:47:03,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 112 edges. 112 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:03,920 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:47:03,920 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:47:03,920 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:47:03,920 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 67 mSDsluCounter, 178 mSDsCounter, 0 mSdLazyCounter, 330 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 341 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:03,921 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [67 Valid, 244 Invalid, 341 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 330 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:03,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:47:03,923 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 182. [2022-02-20 23:47:03,923 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:03,923 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,923 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,924 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,925 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,925 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-02-20 23:47:03,925 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2022-02-20 23:47:03,926 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,926 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:47:03,926 INFO L87 Difference]: Start difference. First operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:47:03,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:03,928 INFO L93 Difference]: Finished difference Result 185 states and 218 transitions. [2022-02-20 23:47:03,928 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 218 transitions. [2022-02-20 23:47:03,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:03,929 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:03,929 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:03,929 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:03,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 182 states, 154 states have (on average 1.3896103896103895) internal successors, (214), 181 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 182 states to 182 states and 214 transitions. [2022-02-20 23:47:03,931 INFO L78 Accepts]: Start accepts. Automaton has 182 states and 214 transitions. Word has length 25 [2022-02-20 23:47:03,931 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:03,931 INFO L470 AbstractCegarLoop]: Abstraction has 182 states and 214 transitions. [2022-02-20 23:47:03,931 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:03,931 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 214 transitions. [2022-02-20 23:47:03,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:03,931 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:03,932 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:03,932 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:47:03,932 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:03,932 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:03,932 INFO L85 PathProgramCache]: Analyzing trace with hash -1022919461, now seen corresponding path program 1 times [2022-02-20 23:47:03,932 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:03,933 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1136832120] [2022-02-20 23:47:03,933 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:03,933 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:03,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:04,047 INFO L290 TraceCheckUtils]: 0: Hoare triple {15369#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(13, 2); {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 1: Hoare triple {15369#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 2: Hoare triple {15369#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 3: Hoare triple {15369#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 4: Hoare triple {15369#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 5: Hoare triple {15369#true} assume !!(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {15369#true} is VALID [2022-02-20 23:47:04,048 INFO L290 TraceCheckUtils]: 6: Hoare triple {15369#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L539-2 {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,049 INFO L290 TraceCheckUtils]: 7: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short7#1 := main_#t~mem5#1.base != 0 || main_#t~mem5#1.offset != 0; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,049 INFO L290 TraceCheckUtils]: 8: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,049 INFO L290 TraceCheckUtils]: 9: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L538-8 {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short13#1 := main_#t~mem11#1.base == 0 && main_#t~mem11#1.offset == 0; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,050 INFO L290 TraceCheckUtils]: 12: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short13#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_#t~short13#1 := 0 != main_#t~nondet12#1; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,050 INFO L290 TraceCheckUtils]: 13: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume !main_#t~short13#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;havoc main_#t~short13#1; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,051 INFO L290 TraceCheckUtils]: 14: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} SUMMARY for call main_#t~mem17#1.base, main_#t~mem17#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L544-5 {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,055 INFO L290 TraceCheckUtils]: 15: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} main_#t~short19#1 := main_#t~mem17#1.base == 0 && main_#t~mem17#1.offset == 0; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,055 INFO L290 TraceCheckUtils]: 16: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short19#1;assume -2147483648 <= main_#t~nondet18#1 && main_#t~nondet18#1 <= 2147483647;main_#t~short19#1 := 0 != main_#t~nondet18#1; {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} is VALID [2022-02-20 23:47:04,056 INFO L290 TraceCheckUtils]: 17: Hoare triple {15371#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) 1)} assume main_#t~short19#1;havoc main_#t~mem17#1.base, main_#t~mem17#1.offset;havoc main_#t~nondet18#1;havoc main_#t~short19#1;call main_#t~malloc20#1.base, main_#t~malloc20#1.offset := #Ultimate.allocOnHeap(8); {15372#(and (= |ULTIMATE.start_main_#t~malloc20#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_#t~malloc20#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc20#1.base|)))} is VALID [2022-02-20 23:47:04,057 INFO L290 TraceCheckUtils]: 18: Hoare triple {15372#(and (= |ULTIMATE.start_main_#t~malloc20#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_#t~malloc20#1.base|)) (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_#t~malloc20#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L550 {15373#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:04,057 INFO L290 TraceCheckUtils]: 19: Hoare triple {15373#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} havoc main_#t~malloc20#1.base, main_#t~malloc20#1.offset; {15373#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:04,058 INFO L290 TraceCheckUtils]: 20: Hoare triple {15373#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} SUMMARY for call main_#t~mem21#1.base, main_#t~mem21#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L551 {15374#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:04,059 INFO L290 TraceCheckUtils]: 21: Hoare triple {15374#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))) (not (= |ULTIMATE.start_main_#t~mem21#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(0, 0, main_#t~mem21#1.base, main_#t~mem21#1.offset, 4); srcloc: L551-1 {15375#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:04,059 INFO L290 TraceCheckUtils]: 22: Hoare triple {15375#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} havoc main_#t~mem21#1.base, main_#t~mem21#1.offset; {15375#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} is VALID [2022-02-20 23:47:04,059 INFO L290 TraceCheckUtils]: 23: Hoare triple {15375#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)) 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (+ |ULTIMATE.start_main_~n~0#1.offset| 4)))))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L552 {15376#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem22#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} is VALID [2022-02-20 23:47:04,060 INFO L290 TraceCheckUtils]: 24: Hoare triple {15376#(and (= (+ (select |#length| |ULTIMATE.start_main_#t~mem22#1.base|) (- 8)) 0) (= |ULTIMATE.start_main_#t~mem22#1.offset| 0))} assume !(4 + (4 + main_#t~mem22#1.offset) <= #length[main_#t~mem22#1.base] && 0 <= 4 + main_#t~mem22#1.offset); {15370#false} is VALID [2022-02-20 23:47:04,060 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:47:04,060 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:04,060 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1136832120] [2022-02-20 23:47:04,060 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1136832120] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:04,060 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:04,060 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:04,061 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284553166] [2022-02-20 23:47:04,061 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:04,061 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:04,061 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:04,061 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:04,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:04,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:04,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:04,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:04,078 INFO L87 Difference]: Start difference. First operand 182 states and 214 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,746 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:04,746 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-02-20 23:47:04,746 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:47:04,746 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:04,746 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:04,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2022-02-20 23:47:04,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 111 transitions. [2022-02-20 23:47:04,747 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 111 transitions. [2022-02-20 23:47:04,827 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 111 edges. 111 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:04,829 INFO L225 Difference]: With dead ends: 184 [2022-02-20 23:47:04,829 INFO L226 Difference]: Without dead ends: 184 [2022-02-20 23:47:04,829 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:47:04,829 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 64 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 381 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 392 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 381 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:04,829 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 292 Invalid, 392 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 381 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:04,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2022-02-20 23:47:04,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 181. [2022-02-20 23:47:04,831 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:04,832 INFO L82 GeneralOperation]: Start isEquivalent. First operand 184 states. Second operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,832 INFO L74 IsIncluded]: Start isIncluded. First operand 184 states. Second operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,832 INFO L87 Difference]: Start difference. First operand 184 states. Second operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:04,834 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-02-20 23:47:04,834 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2022-02-20 23:47:04,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:04,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:04,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 184 states. [2022-02-20 23:47:04,835 INFO L87 Difference]: Start difference. First operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 184 states. [2022-02-20 23:47:04,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:04,837 INFO L93 Difference]: Finished difference Result 184 states and 217 transitions. [2022-02-20 23:47:04,837 INFO L276 IsEmpty]: Start isEmpty. Operand 184 states and 217 transitions. [2022-02-20 23:47:04,837 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:04,837 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:04,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:04,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:04,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 181 states, 154 states have (on average 1.3831168831168832) internal successors, (213), 180 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 181 states to 181 states and 213 transitions. [2022-02-20 23:47:04,840 INFO L78 Accepts]: Start accepts. Automaton has 181 states and 213 transitions. Word has length 25 [2022-02-20 23:47:04,840 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:04,840 INFO L470 AbstractCegarLoop]: Abstraction has 181 states and 213 transitions. [2022-02-20 23:47:04,840 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:04,840 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 213 transitions. [2022-02-20 23:47:04,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:47:04,840 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:04,841 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:04,841 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:47:04,841 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:04,841 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash 1627096903, now seen corresponding path program 1 times [2022-02-20 23:47:04,841 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:04,842 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [699326841] [2022-02-20 23:47:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:04,842 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:04,857 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:04,911 INFO L290 TraceCheckUtils]: 0: Hoare triple {16124#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(13, 2); {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {16124#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 2: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 3: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 4: Hoare triple {16124#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 5: Hoare triple {16124#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {16124#true} is VALID [2022-02-20 23:47:04,912 INFO L290 TraceCheckUtils]: 6: Hoare triple {16124#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:04,913 INFO L290 TraceCheckUtils]: 7: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:04,914 INFO L290 TraceCheckUtils]: 8: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:04,914 INFO L290 TraceCheckUtils]: 9: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:04,915 INFO L290 TraceCheckUtils]: 10: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:47:04,915 INFO L290 TraceCheckUtils]: 11: Hoare triple {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,916 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,916 INFO L290 TraceCheckUtils]: 13: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,916 INFO L290 TraceCheckUtils]: 14: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,917 INFO L290 TraceCheckUtils]: 15: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,917 INFO L290 TraceCheckUtils]: 16: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,917 INFO L290 TraceCheckUtils]: 17: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L564 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,918 INFO L290 TraceCheckUtils]: 18: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem26#1.base != 0 || main_#t~mem26#1.offset != 0);havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,918 INFO L290 TraceCheckUtils]: 19: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem29#1.base, main_#t~mem29#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L564-3 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,919 INFO L290 TraceCheckUtils]: 20: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem29#1.base != 0 || main_#t~mem29#1.offset != 0);havoc main_#t~mem29#1.base, main_#t~mem29#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,919 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,919 INFO L290 TraceCheckUtils]: 22: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,920 INFO L290 TraceCheckUtils]: 23: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:04,920 INFO L290 TraceCheckUtils]: 24: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16125#false} is VALID [2022-02-20 23:47:04,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {16125#false} assume !(1 == #valid[main_~s~0#1.base]); {16125#false} is VALID [2022-02-20 23:47:04,921 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:04,921 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:47:04,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [699326841] [2022-02-20 23:47:04,922 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [699326841] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:47:04,922 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1390673840] [2022-02-20 23:47:04,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:04,922 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:47:04,923 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:04,924 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:47:04,927 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:47:05,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:05,025 INFO L263 TraceCheckSpWp]: Trace formula consists of 191 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:47:05,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:05,048 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:05,096 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:47:05,100 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:47:05,138 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:47:05,139 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:47:05,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:05,145 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:47:05,194 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:05,206 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:05,279 INFO L290 TraceCheckUtils]: 0: Hoare triple {16124#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(13, 2); {16124#true} is VALID [2022-02-20 23:47:05,279 INFO L290 TraceCheckUtils]: 1: Hoare triple {16124#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:05,279 INFO L290 TraceCheckUtils]: 2: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {16124#true} is VALID [2022-02-20 23:47:05,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {16124#true} is VALID [2022-02-20 23:47:05,280 INFO L290 TraceCheckUtils]: 4: Hoare triple {16124#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {16124#true} is VALID [2022-02-20 23:47:05,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {16124#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {16124#true} is VALID [2022-02-20 23:47:05,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {16124#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:05,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,281 INFO L290 TraceCheckUtils]: 8: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:47:05,283 INFO L290 TraceCheckUtils]: 11: Hoare triple {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,284 INFO L290 TraceCheckUtils]: 15: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L564 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,286 INFO L290 TraceCheckUtils]: 18: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem26#1.base != 0 || main_#t~mem26#1.offset != 0);havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,286 INFO L290 TraceCheckUtils]: 19: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem29#1.base, main_#t~mem29#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L564-3 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,286 INFO L290 TraceCheckUtils]: 20: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem29#1.base != 0 || main_#t~mem29#1.offset != 0);havoc main_#t~mem29#1.base, main_#t~mem29#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,287 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,287 INFO L290 TraceCheckUtils]: 22: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,288 INFO L290 TraceCheckUtils]: 23: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,288 INFO L290 TraceCheckUtils]: 24: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16125#false} is VALID [2022-02-20 23:47:05,288 INFO L290 TraceCheckUtils]: 25: Hoare triple {16125#false} assume !(1 == #valid[main_~s~0#1.base]); {16125#false} is VALID [2022-02-20 23:47:05,288 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:05,288 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:05,432 INFO L290 TraceCheckUtils]: 25: Hoare triple {16125#false} assume !(1 == #valid[main_~s~0#1.base]); {16125#false} is VALID [2022-02-20 23:47:05,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16125#false} is VALID [2022-02-20 23:47:05,433 INFO L290 TraceCheckUtils]: 23: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.base || 1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,433 INFO L290 TraceCheckUtils]: 22: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~n~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~n~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem29#1.base != 0 || main_#t~mem29#1.offset != 0);havoc main_#t~mem29#1.base, main_#t~mem29#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem29#1.base, main_#t~mem29#1.offset := read~$Pointer$(main_~n~0#1.base, 4 + main_~n~0#1.offset, 4); srcloc: L564-3 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,435 INFO L290 TraceCheckUtils]: 18: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume !(main_#t~mem26#1.base != 0 || main_#t~mem26#1.offset != 0);havoc main_#t~mem26#1.base, main_#t~mem26#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,435 INFO L290 TraceCheckUtils]: 17: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem26#1.base, main_#t~mem26#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4); srcloc: L564 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,435 INFO L290 TraceCheckUtils]: 16: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.base || 1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume main_~st~0#1.base < #StackHeapBarrier; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} assume 0 == main_~st~0#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,436 INFO L290 TraceCheckUtils]: 13: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem25#1.base, main_#t~mem25#1.offset;havoc main_#t~mem25#1.base, main_#t~mem25#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,437 INFO L290 TraceCheckUtils]: 12: Hoare triple {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} SUMMARY for call main_#t~mem25#1.base, main_#t~mem25#1.offset := read~$Pointer$(main_~st~0#1.base, 4 + main_~st~0#1.offset, 4); srcloc: L562 {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem24#1.base, main_#t~mem24#1.offset;havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {16128#(and (= |ULTIMATE.start_main_~s~0#1.base| 0) (= |ULTIMATE.start_main_~s~0#1.offset| 0))} is VALID [2022-02-20 23:47:05,438 INFO L290 TraceCheckUtils]: 10: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L561 {16127#(and (= |ULTIMATE.start_main_#t~mem24#1.base| 0) (= |ULTIMATE.start_main_#t~mem24#1.offset| 0))} is VALID [2022-02-20 23:47:05,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} assume !!(main_~s~0#1.base != 0 || main_~s~0#1.offset != 0);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, 4 + main_~s~0#1.offset, 4); srcloc: L557-1 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 7: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~s~0#1.base, main_~s~0#1.offset, 4); srcloc: L557 {16126#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) 0))} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 6: Hoare triple {16124#true} main_~n~0#1.base, main_~n~0#1.offset := 0, 0;call main_#t~malloc23#1.base, main_#t~malloc23#1.offset := #Ultimate.allocOnHeap(8);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_#t~malloc23#1.base, main_#t~malloc23#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 5: Hoare triple {16124#true} assume !(0 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {16124#true} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 4: Hoare triple {16124#true} assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647; {16124#true} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 3: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, 4 + main_~root~0#1.offset, 4); srcloc: L534-1 {16124#true} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 2: Hoare triple {16124#true} SUMMARY for call write~$Pointer$(0, 0, main_~root~0#1.base, main_~root~0#1.offset, 4); srcloc: L534 {16124#true} is VALID [2022-02-20 23:47:05,440 INFO L290 TraceCheckUtils]: 1: Hoare triple {16124#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~short13#1, main_#t~malloc14#1.base, main_#t~malloc14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~nondet18#1, main_#t~short19#1, main_#t~malloc20#1.base, main_#t~malloc20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~nondet4#1, main_#t~malloc23#1.base, main_#t~malloc23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~mem25#1.base, main_#t~mem25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~malloc27#1.base, main_#t~malloc27#1.offset, main_#t~mem28#1.base, main_#t~mem28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_#t~malloc30#1.base, main_#t~malloc30#1.offset, main_#t~mem31#1.base, main_#t~mem31#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {16124#true} is VALID [2022-02-20 23:47:05,441 INFO L290 TraceCheckUtils]: 0: Hoare triple {16124#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(13, 2); {16124#true} is VALID [2022-02-20 23:47:05,441 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:05,441 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1390673840] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:05,442 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:47:05,442 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 5 [2022-02-20 23:47:05,443 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1307606443] [2022-02-20 23:47:05,443 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:05,444 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:05,445 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:05,445 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:05,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:05,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:47:05,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:05,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:05,462 INFO L87 Difference]: Start difference. First operand 181 states and 213 transitions. Second operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,712 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2022-02-20 23:47:05,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:05,712 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:47:05,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-02-20 23:47:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 133 transitions. [2022-02-20 23:47:05,714 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 133 transitions. [2022-02-20 23:47:05,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 133 edges. 133 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:05,808 INFO L225 Difference]: With dead ends: 187 [2022-02-20 23:47:05,808 INFO L226 Difference]: Without dead ends: 187 [2022-02-20 23:47:05,809 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:05,809 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 12 mSDsluCounter, 255 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 354 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:05,809 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 354 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:05,810 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 187 states. [2022-02-20 23:47:05,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 187 to 183. [2022-02-20 23:47:05,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:05,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 187 states. Second operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,812 INFO L74 IsIncluded]: Start isIncluded. First operand 187 states. Second operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,812 INFO L87 Difference]: Start difference. First operand 187 states. Second operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,814 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2022-02-20 23:47:05,814 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2022-02-20 23:47:05,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,815 INFO L74 IsIncluded]: Start isIncluded. First operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:47:05,815 INFO L87 Difference]: Start difference. First operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 187 states. [2022-02-20 23:47:05,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:05,817 INFO L93 Difference]: Finished difference Result 187 states and 219 transitions. [2022-02-20 23:47:05,817 INFO L276 IsEmpty]: Start isEmpty. Operand 187 states and 219 transitions. [2022-02-20 23:47:05,817 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:05,817 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:05,818 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:05,818 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:05,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 183 states, 156 states have (on average 1.3782051282051282) internal successors, (215), 182 states have internal predecessors, (215), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 183 states to 183 states and 215 transitions. [2022-02-20 23:47:05,820 INFO L78 Accepts]: Start accepts. Automaton has 183 states and 215 transitions. Word has length 26 [2022-02-20 23:47:05,820 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:05,820 INFO L470 AbstractCegarLoop]: Abstraction has 183 states and 215 transitions. [2022-02-20 23:47:05,820 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.2) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:05,820 INFO L276 IsEmpty]: Start isEmpty. Operand 183 states and 215 transitions. [2022-02-20 23:47:05,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:47:05,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:05,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:05,839 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:47:06,035 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-20 23:47:06,036 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:06,036 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:06,036 INFO L85 PathProgramCache]: Analyzing trace with hash -1099603412, now seen corresponding path program 1 times [2022-02-20 23:47:06,036 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:47:06,036 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1354394689] [2022-02-20 23:47:06,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:06,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:47:06,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:06,079 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:47:06,079 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:47:06,086 INFO L158 Benchmark]: Toolchain (without parser) took 16884.25ms. Allocated memory was 109.1MB in the beginning and 205.5MB in the end (delta: 96.5MB). Free memory was 76.7MB in the beginning and 67.2MB in the end (delta: 9.6MB). Peak memory consumption was 104.5MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,086 INFO L158 Benchmark]: CDTParser took 0.23ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:47:06,087 INFO L158 Benchmark]: CACSL2BoogieTranslator took 398.37ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 76.8MB in the end (delta: -104.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,087 INFO L158 Benchmark]: Boogie Procedure Inliner took 35.25ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,087 INFO L158 Benchmark]: Boogie Preprocessor took 27.25ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,087 INFO L158 Benchmark]: RCFGBuilder took 705.18ms. Allocated memory is still 109.1MB. Free memory was 72.0MB in the beginning and 80.0MB in the end (delta: -7.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,088 INFO L158 Benchmark]: TraceAbstraction took 15712.50ms. Allocated memory was 109.1MB in the beginning and 205.5MB in the end (delta: 96.5MB). Free memory was 80.0MB in the beginning and 67.2MB in the end (delta: 12.8MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. [2022-02-20 23:47:06,091 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.23ms. Allocated memory is still 81.8MB. Free memory was 52.6MB in the beginning and 52.6MB in the end (delta: 25.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 398.37ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 76.8MB in the end (delta: -104.1kB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 35.25ms. Allocated memory is still 109.1MB. Free memory was 76.8MB in the beginning and 74.1MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 27.25ms. Allocated memory is still 109.1MB. Free memory was 74.1MB in the beginning and 72.0MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 705.18ms. Allocated memory is still 109.1MB. Free memory was 72.0MB in the beginning and 80.0MB in the end (delta: -7.9MB). Peak memory consumption was 32.4MB. Max. memory is 16.1GB. * TraceAbstraction took 15712.50ms. Allocated memory was 109.1MB in the beginning and 205.5MB in the end (delta: 96.5MB). Free memory was 80.0MB in the beginning and 67.2MB in the end (delta: 12.8MB). Peak memory consumption was 107.9MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:47:06,121 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety-ext/tree_stack.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 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:47:07,820 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:47:07,822 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:47:07,854 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:47:07,855 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:47:07,858 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:47:07,860 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:47:07,864 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:47:07,866 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:47:07,871 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:47:07,872 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:47:07,873 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:47:07,874 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:47:07,876 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:47:07,877 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:47:07,880 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:47:07,881 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:47:07,881 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:47:07,883 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:47:07,891 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:47:07,892 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:47:07,893 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:47:07,894 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:47:07,895 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:47:07,897 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:47:07,897 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:47:07,897 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:47:07,899 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:47:07,899 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:47:07,899 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:47:07,900 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:47:07,900 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:47:07,901 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:47:07,902 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:47:07,903 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:47:07,903 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:47:07,903 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:47:07,904 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:47:07,904 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:47:07,905 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:47:07,906 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:47:07,906 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:47:07,932 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:47:07,932 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:47:07,933 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:47:07,933 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:47:07,934 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:47:07,934 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:47:07,935 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:47:07,935 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:47:07,935 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:47:07,935 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:47:07,936 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:47:07,936 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:47:07,936 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:47:07,936 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:47:07,936 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:47:07,937 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:47:07,938 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:47:07,938 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:47:07,938 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:47:07,946 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:47:07,946 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:07,947 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:47:07,947 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:47:07,947 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:47:07,947 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:47:07,947 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:47:07,947 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 -> 882715956aab9fc92fb711e54ed51d64e792658e5015ed6151f84b857454f04c [2022-02-20 23:47:08,205 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:47:08,236 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:47:08,238 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:47:08,239 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:47:08,240 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:47:08,241 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-02-20 23:47:08,294 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f749dc5/de9c372127b649dbae383577e72a1aab/FLAG301035f81 [2022-02-20 23:47:08,700 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:47:08,701 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety-ext/tree_stack.i [2022-02-20 23:47:08,710 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f749dc5/de9c372127b649dbae383577e72a1aab/FLAG301035f81 [2022-02-20 23:47:08,722 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c6f749dc5/de9c372127b649dbae383577e72a1aab [2022-02-20 23:47:08,723 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:47:08,724 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:47:08,725 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:08,725 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:47:08,736 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:47:08,737 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:08" (1/1) ... [2022-02-20 23:47:08,738 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16571611 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:08, skipping insertion in model container [2022-02-20 23:47:08,738 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:47:08" (1/1) ... [2022-02-20 23:47:08,747 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:47:08,783 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:47:09,079 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:09,091 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:47:09,132 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:47:09,165 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:47:09,165 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09 WrapperNode [2022-02-20 23:47:09,166 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:47:09,167 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:09,168 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:47:09,168 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:47:09,173 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:47:09" (1/1) ... [2022-02-20 23:47:09,202 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:47:09" (1/1) ... [2022-02-20 23:47:09,231 INFO L137 Inliner]: procedures = 124, calls = 44, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 129 [2022-02-20 23:47:09,232 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:47:09,232 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:47:09,233 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:47:09,233 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:47:09,238 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,238 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,247 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,247 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,255 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,265 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,268 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,276 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:47:09,276 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:47:09,276 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:47:09,277 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:47:09,277 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (1/1) ... [2022-02-20 23:47:09,281 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:47:09,299 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:47:09,309 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:47:09,325 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:47:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:47:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:47:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:47:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:47:09,337 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:47:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:47:09,338 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:47:09,338 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:47:09,442 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:47:09,443 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:47:09,862 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:47:09,867 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:47:09,867 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 23:47:09,868 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:09 BoogieIcfgContainer [2022-02-20 23:47:09,868 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:47:09,869 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:47:09,870 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:47:09,873 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:47:09,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:47:08" (1/3) ... [2022-02-20 23:47:09,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b521c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:09, skipping insertion in model container [2022-02-20 23:47:09,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:47:09" (2/3) ... [2022-02-20 23:47:09,874 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@5b521c0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:47:09, skipping insertion in model container [2022-02-20 23:47:09,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:47:09" (3/3) ... [2022-02-20 23:47:09,877 INFO L111 eAbstractionObserver]: Analyzing ICFG tree_stack.i [2022-02-20 23:47:09,880 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:47:09,881 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-02-20 23:47:09,905 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:47:09,911 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:47:09,911 INFO L340 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-02-20 23:47:09,925 INFO L276 IsEmpty]: Start isEmpty. Operand has 133 states, 65 states have (on average 2.2153846153846155) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:09,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:47:09,928 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:09,929 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:47:09,929 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:09,936 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:09,936 INFO L85 PathProgramCache]: Analyzing trace with hash 29857, now seen corresponding path program 1 times [2022-02-20 23:47:09,944 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:09,944 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [759790917] [2022-02-20 23:47:09,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:09,945 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:09,946 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:09,947 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:47:09,954 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:47:10,002 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,003 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:10,010 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:10,013 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:10,070 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:47:10,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {136#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(13bv32, 2bv32); {136#true} is VALID [2022-02-20 23:47:10,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {136#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {144#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:10,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~root~0#1.base]); {137#false} is VALID [2022-02-20 23:47:10,084 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:47:10,084 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:10,084 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:10,084 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [759790917] [2022-02-20 23:47:10,085 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [759790917] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:10,085 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:10,085 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:10,087 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1290558279] [2022-02-20 23:47:10,088 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:10,091 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:47:10,092 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:10,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,098 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,098 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:10,100 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:10,119 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:10,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:10,122 INFO L87 Difference]: Start difference. First operand has 133 states, 65 states have (on average 2.2153846153846155) internal successors, (144), 132 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,613 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,614 INFO L93 Difference]: Finished difference Result 151 states and 159 transitions. [2022-02-20 23:47:10,614 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:10,614 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:47:10,615 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:10,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 23:47:10,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 165 transitions. [2022-02-20 23:47:10,629 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 165 transitions. [2022-02-20 23:47:10,793 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 165 edges. 165 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:10,802 INFO L225 Difference]: With dead ends: 151 [2022-02-20 23:47:10,802 INFO L226 Difference]: Without dead ends: 147 [2022-02-20 23:47:10,803 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:47:10,805 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 97 mSDsluCounter, 28 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 115 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:10,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 115 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:10,816 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-20 23:47:10,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 129. [2022-02-20 23:47:10,826 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:10,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,828 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,828 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,834 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2022-02-20 23:47:10,834 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2022-02-20 23:47:10,835 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,835 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,835 INFO L74 IsIncluded]: Start isIncluded. First operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 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:47:10,836 INFO L87 Difference]: Start difference. First operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 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:47:10,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:10,840 INFO L93 Difference]: Finished difference Result 147 states and 155 transitions. [2022-02-20 23:47:10,840 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 155 transitions. [2022-02-20 23:47:10,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:10,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:10,841 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:10,842 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:10,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 64 states have (on average 2.140625) internal successors, (137), 128 states have internal predecessors, (137), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 137 transitions. [2022-02-20 23:47:10,846 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 137 transitions. Word has length 3 [2022-02-20 23:47:10,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:10,846 INFO L470 AbstractCegarLoop]: Abstraction has 129 states and 137 transitions. [2022-02-20 23:47:10,846 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:10,847 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 137 transitions. [2022-02-20 23:47:10,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:47:10,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:10,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:47:10,856 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:47:11,053 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:47:11,054 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:11,054 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,055 INFO L85 PathProgramCache]: Analyzing trace with hash 29858, now seen corresponding path program 1 times [2022-02-20 23:47:11,055 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:11,055 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [83502183] [2022-02-20 23:47:11,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,055 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:11,056 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:47:11,065 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:47:11,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,110 INFO L263 TraceCheckSpWp]: Trace formula consists of 23 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:11,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:11,118 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:11,133 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:47:11,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {721#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(13bv32, 2bv32); {721#true} is VALID [2022-02-20 23:47:11,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {721#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {729#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:11,142 INFO L290 TraceCheckUtils]: 2: Hoare triple {729#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~root~0#1.offset), #length[main_~root~0#1.base]) && ~bvule32(main_~root~0#1.offset, ~bvadd32(4bv32, main_~root~0#1.offset))) && ~bvule32(0bv32, main_~root~0#1.offset)); {722#false} is VALID [2022-02-20 23:47:11,142 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:47:11,142 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:11,143 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:11,143 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [83502183] [2022-02-20 23:47:11,143 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [83502183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:11,143 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:11,143 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:11,143 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [278405823] [2022-02-20 23:47:11,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:11,144 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:47:11,144 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:11,145 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 3 edges. 3 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:11,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:11,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:11,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:11,149 INFO L87 Difference]: Start difference. First operand 129 states and 137 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,585 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-02-20 23:47:11,585 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:11,585 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2022-02-20 23:47:11,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:11,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 23:47:11,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-20 23:47:11,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2022-02-20 23:47:11,756 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:11,758 INFO L225 Difference]: With dead ends: 127 [2022-02-20 23:47:11,758 INFO L226 Difference]: Without dead ends: 127 [2022-02-20 23:47:11,758 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:47:11,759 INFO L933 BasicCegarLoop]: 71 mSDtfsCounter, 128 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 71 SdHoareTripleChecker+Invalid, 71 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:11,759 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [128 Valid, 71 Invalid, 71 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:11,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 127 states. [2022-02-20 23:47:11,762 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 127 to 127. [2022-02-20 23:47:11,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:11,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 127 states. Second operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,763 INFO L74 IsIncluded]: Start isIncluded. First operand 127 states. Second operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,763 INFO L87 Difference]: Start difference. First operand 127 states. Second operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,766 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-02-20 23:47:11,766 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2022-02-20 23:47:11,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,767 INFO L74 IsIncluded]: Start isIncluded. First operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 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 127 states. [2022-02-20 23:47:11,767 INFO L87 Difference]: Start difference. First operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 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 127 states. [2022-02-20 23:47:11,769 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:11,770 INFO L93 Difference]: Finished difference Result 127 states and 135 transitions. [2022-02-20 23:47:11,770 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2022-02-20 23:47:11,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:11,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:11,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:11,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:11,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 64 states have (on average 2.109375) internal successors, (135), 126 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 135 transitions. [2022-02-20 23:47:11,786 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 135 transitions. Word has length 3 [2022-02-20 23:47:11,786 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:11,786 INFO L470 AbstractCegarLoop]: Abstraction has 127 states and 135 transitions. [2022-02-20 23:47:11,786 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 3 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:11,786 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 135 transitions. [2022-02-20 23:47:11,787 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:47:11,788 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:11,788 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:47:11,794 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:47:11,996 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,996 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:11,996 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:11,996 INFO L85 PathProgramCache]: Analyzing trace with hash 889446412, now seen corresponding path program 1 times [2022-02-20 23:47:11,997 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:11,997 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [728752506] [2022-02-20 23:47:11,997 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:11,997 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:11,997 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:12,024 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:12,025 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:47:12,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,071 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:12,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:12,083 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:12,092 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:47:12,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {1240#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(13bv32, 2bv32); {1240#true} is VALID [2022-02-20 23:47:12,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {1240#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:12,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:12,115 INFO L290 TraceCheckUtils]: 3: Hoare triple {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:12,115 INFO L290 TraceCheckUtils]: 4: Hoare triple {1248#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1258#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:12,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {1258#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~n~0#1.base]); {1241#false} is VALID [2022-02-20 23:47:12,116 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:47:12,116 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:12,116 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:12,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [728752506] [2022-02-20 23:47:12,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [728752506] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:12,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:12,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:12,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1414897408] [2022-02-20 23:47:12,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:12,117 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:12,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:12,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:12,125 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:12,125 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:12,126 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:12,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:12,126 INFO L87 Difference]: Start difference. First operand 127 states and 135 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,711 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-02-20 23:47:12,711 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:12,711 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:12,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:12,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2022-02-20 23:47:12,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 159 transitions. [2022-02-20 23:47:12,715 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 159 transitions. [2022-02-20 23:47:12,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 159 edges. 159 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:12,857 INFO L225 Difference]: With dead ends: 134 [2022-02-20 23:47:12,858 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 23:47:12,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:12,859 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 161 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 161 SdHoareTripleChecker+Valid, 87 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:12,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [161 Valid, 87 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:47:12,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 23:47:12,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 113. [2022-02-20 23:47:12,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:12,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,863 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,863 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,866 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-02-20 23:47:12,866 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-02-20 23:47:12,866 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,866 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,866 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 134 states. [2022-02-20 23:47:12,867 INFO L87 Difference]: Start difference. First operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 134 states. [2022-02-20 23:47:12,869 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:12,869 INFO L93 Difference]: Finished difference Result 134 states and 143 transitions. [2022-02-20 23:47:12,869 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 143 transitions. [2022-02-20 23:47:12,869 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:12,869 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:12,869 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:12,870 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:12,870 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 65 states have (on average 1.876923076923077) internal successors, (122), 112 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,871 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 122 transitions. [2022-02-20 23:47:12,872 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 122 transitions. Word has length 6 [2022-02-20 23:47:12,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:12,872 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 122 transitions. [2022-02-20 23:47:12,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:12,872 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 122 transitions. [2022-02-20 23:47:12,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:47:12,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:12,873 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:47:12,880 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 23:47:13,078 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:13,079 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:13,079 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:13,079 INFO L85 PathProgramCache]: Analyzing trace with hash 889446413, now seen corresponding path program 1 times [2022-02-20 23:47:13,080 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:13,080 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1729510469] [2022-02-20 23:47:13,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:13,080 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:13,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:13,083 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:13,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:47:13,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,126 INFO L263 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:13,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:13,134 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:13,145 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:47:13,186 INFO L290 TraceCheckUtils]: 0: Hoare triple {1778#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(13bv32, 2bv32); {1778#true} is VALID [2022-02-20 23:47:13,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {1778#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:13,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:13,189 INFO L290 TraceCheckUtils]: 3: Hoare triple {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:13,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {1786#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {1796#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:13,190 INFO L290 TraceCheckUtils]: 5: Hoare triple {1796#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~n~0#1.offset), #length[main_~n~0#1.base]) && ~bvule32(main_~n~0#1.offset, ~bvadd32(4bv32, main_~n~0#1.offset))) && ~bvule32(0bv32, main_~n~0#1.offset)); {1779#false} is VALID [2022-02-20 23:47:13,190 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:47:13,190 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:13,190 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:13,190 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1729510469] [2022-02-20 23:47:13,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1729510469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:13,191 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:13,191 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:13,191 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2130279276] [2022-02-20 23:47:13,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:13,191 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:13,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:13,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:13,199 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:13,199 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:13,199 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:13,200 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:13,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:13,200 INFO L87 Difference]: Start difference. First operand 113 states and 122 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,101 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-02-20 23:47:14,102 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:47:14,102 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:47:14,102 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:14,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-02-20 23:47:14,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 179 transitions. [2022-02-20 23:47:14,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 179 transitions. [2022-02-20 23:47:14,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 179 edges. 179 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:14,307 INFO L225 Difference]: With dead ends: 153 [2022-02-20 23:47:14,307 INFO L226 Difference]: Without dead ends: 153 [2022-02-20 23:47:14,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:14,307 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 194 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 101 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:14,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 101 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:14,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2022-02-20 23:47:14,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 139. [2022-02-20 23:47:14,312 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:14,313 INFO L82 GeneralOperation]: Start isEquivalent. First operand 153 states. Second operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,313 INFO L74 IsIncluded]: Start isIncluded. First operand 153 states. Second operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,313 INFO L87 Difference]: Start difference. First operand 153 states. Second operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,316 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-02-20 23:47:14,316 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2022-02-20 23:47:14,316 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,316 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,317 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 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:47:14,317 INFO L87 Difference]: Start difference. First operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 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:47:14,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:14,320 INFO L93 Difference]: Finished difference Result 153 states and 167 transitions. [2022-02-20 23:47:14,320 INFO L276 IsEmpty]: Start isEmpty. Operand 153 states and 167 transitions. [2022-02-20 23:47:14,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:14,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:14,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:14,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:14,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 91 states have (on average 1.7362637362637363) internal successors, (158), 138 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 158 transitions. [2022-02-20 23:47:14,323 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 158 transitions. Word has length 6 [2022-02-20 23:47:14,323 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:14,323 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 158 transitions. [2022-02-20 23:47:14,323 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 4 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:14,324 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 158 transitions. [2022-02-20 23:47:14,324 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:47:14,324 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:14,324 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:14,332 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 23:47:14,530 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:14,531 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:14,531 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:14,531 INFO L85 PathProgramCache]: Analyzing trace with hash 1803036043, now seen corresponding path program 1 times [2022-02-20 23:47:14,531 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:14,531 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [372966750] [2022-02-20 23:47:14,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:14,532 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:14,532 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:14,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:14,534 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:47:14,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,581 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:47:14,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:14,591 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:14,611 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:47:14,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {2399#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(13bv32, 2bv32); {2399#true} is VALID [2022-02-20 23:47:14,616 INFO L290 TraceCheckUtils]: 1: Hoare triple {2399#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2399#true} is VALID [2022-02-20 23:47:14,616 INFO L290 TraceCheckUtils]: 2: Hoare triple {2399#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {2399#true} is VALID [2022-02-20 23:47:14,617 INFO L290 TraceCheckUtils]: 3: Hoare triple {2399#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {2399#true} is VALID [2022-02-20 23:47:14,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {2399#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2399#true} is VALID [2022-02-20 23:47:14,619 INFO L290 TraceCheckUtils]: 5: Hoare triple {2399#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {2419#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:14,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {2419#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~s~0#1.base]); {2400#false} is VALID [2022-02-20 23:47:14,620 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:47:14,620 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:14,620 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:14,620 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [372966750] [2022-02-20 23:47:14,620 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [372966750] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:14,620 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:14,620 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:14,620 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1913340488] [2022-02-20 23:47:14,620 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:14,621 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:47:14,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:14,622 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:47:14,628 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:47:14,628 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:14,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:14,629 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:14,629 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:14,629 INFO L87 Difference]: Start difference. First operand 139 states and 158 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:47:15,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,094 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-02-20 23:47:15,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:15,095 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:47:15,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:15,095 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:47:15,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:47:15,096 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:47:15,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-20 23:47:15,097 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-20 23:47:15,203 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:15,205 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:47:15,205 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 23:47:15,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:47:15,205 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 64 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 64 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:15,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [10 Valid, 166 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 64 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:15,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 23:47:15,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 139. [2022-02-20 23:47:15,209 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:15,209 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,209 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,209 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,211 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,212 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-02-20 23:47:15,212 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-02-20 23:47:15,212 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:15,212 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:15,212 INFO L74 IsIncluded]: Start isIncluded. First operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 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 143 states. [2022-02-20 23:47:15,215 INFO L87 Difference]: Start difference. First operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 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 143 states. [2022-02-20 23:47:15,217 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:15,218 INFO L93 Difference]: Finished difference Result 143 states and 162 transitions. [2022-02-20 23:47:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 162 transitions. [2022-02-20 23:47:15,218 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:15,218 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:15,218 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:15,218 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:15,219 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 139 states, 93 states have (on average 1.7204301075268817) internal successors, (160), 138 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:15,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 139 states to 139 states and 160 transitions. [2022-02-20 23:47:15,221 INFO L78 Accepts]: Start accepts. Automaton has 139 states and 160 transitions. Word has length 7 [2022-02-20 23:47:15,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:15,221 INFO L470 AbstractCegarLoop]: Abstraction has 139 states and 160 transitions. [2022-02-20 23:47:15,221 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:47:15,221 INFO L276 IsEmpty]: Start isEmpty. Operand 139 states and 160 transitions. [2022-02-20 23:47:15,221 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:47:15,221 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:15,222 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:15,232 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:15,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:15,428 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:15,428 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:15,428 INFO L85 PathProgramCache]: Analyzing trace with hash 1803036044, now seen corresponding path program 1 times [2022-02-20 23:47:15,429 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:15,429 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1755351041] [2022-02-20 23:47:15,429 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:15,429 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:15,429 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:15,430 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:15,438 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:47:15,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,480 INFO L263 TraceCheckSpWp]: Trace formula consists of 60 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:15,488 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:15,489 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:15,523 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:47:15,541 INFO L290 TraceCheckUtils]: 0: Hoare triple {2990#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(13bv32, 2bv32); {2990#true} is VALID [2022-02-20 23:47:15,541 INFO L290 TraceCheckUtils]: 1: Hoare triple {2990#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {2990#true} is VALID [2022-02-20 23:47:15,541 INFO L290 TraceCheckUtils]: 2: Hoare triple {2990#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {2990#true} is VALID [2022-02-20 23:47:15,541 INFO L290 TraceCheckUtils]: 3: Hoare triple {2990#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {2990#true} is VALID [2022-02-20 23:47:15,541 INFO L290 TraceCheckUtils]: 4: Hoare triple {2990#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {2990#true} is VALID [2022-02-20 23:47:15,543 INFO L290 TraceCheckUtils]: 5: Hoare triple {2990#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3010#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:15,543 INFO L290 TraceCheckUtils]: 6: Hoare triple {3010#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~s~0#1.offset), #length[main_~s~0#1.base]) && ~bvule32(main_~s~0#1.offset, ~bvadd32(4bv32, main_~s~0#1.offset))) && ~bvule32(0bv32, main_~s~0#1.offset)); {2991#false} is VALID [2022-02-20 23:47:15,543 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:47:15,543 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:15,544 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:15,544 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1755351041] [2022-02-20 23:47:15,544 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1755351041] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:15,544 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:15,544 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:47:15,544 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1471527505] [2022-02-20 23:47:15,544 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:15,545 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:47:15,545 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:15,545 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:47:15,553 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:47:15,553 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:15,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:15,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:15,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:15,555 INFO L87 Difference]: Start difference. First operand 139 states and 160 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:47:16,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,014 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-02-20 23:47:16,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:16,015 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:47:16,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:16,015 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:47:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:47:16,016 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:47:16,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:47:16,017 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-20 23:47:16,143 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,144 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:47:16,145 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:47:16,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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:47:16,146 INFO L933 BasicCegarLoop]: 111 mSDtfsCounter, 7 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:16,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [7 Valid, 158 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:16,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:47:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 137. [2022-02-20 23:47:16,149 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:16,149 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,149 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,154 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,156 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-02-20 23:47:16,156 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-02-20 23:47:16,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states. [2022-02-20 23:47:16,157 INFO L87 Difference]: Start difference. First operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states. [2022-02-20 23:47:16,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,160 INFO L93 Difference]: Finished difference Result 141 states and 160 transitions. [2022-02-20 23:47:16,160 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 160 transitions. [2022-02-20 23:47:16,160 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,160 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,160 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:16,160 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:16,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.6881720430107527) internal successors, (157), 136 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,162 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 157 transitions. [2022-02-20 23:47:16,162 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 157 transitions. Word has length 7 [2022-02-20 23:47:16,163 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:16,163 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 157 transitions. [2022-02-20 23:47:16,163 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:47:16,163 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 157 transitions. [2022-02-20 23:47:16,163 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:47:16,163 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:16,163 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:16,170 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:16,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:16,367 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:16,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:16,368 INFO L85 PathProgramCache]: Analyzing trace with hash 11428149, now seen corresponding path program 1 times [2022-02-20 23:47:16,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:16,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1775739669] [2022-02-20 23:47:16,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:16,369 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:16,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:16,370 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:16,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:47:16,434 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,436 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:47:16,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:16,445 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:16,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {3573#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(13bv32, 2bv32); {3573#true} is VALID [2022-02-20 23:47:16,470 INFO L290 TraceCheckUtils]: 1: Hoare triple {3573#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {3573#true} is VALID [2022-02-20 23:47:16,470 INFO L290 TraceCheckUtils]: 2: Hoare triple {3573#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {3573#true} is VALID [2022-02-20 23:47:16,470 INFO L290 TraceCheckUtils]: 3: Hoare triple {3573#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {3573#true} is VALID [2022-02-20 23:47:16,470 INFO L290 TraceCheckUtils]: 4: Hoare triple {3573#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {3573#true} is VALID [2022-02-20 23:47:16,471 INFO L290 TraceCheckUtils]: 5: Hoare triple {3573#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:16,471 INFO L290 TraceCheckUtils]: 6: Hoare triple {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:16,471 INFO L290 TraceCheckUtils]: 7: Hoare triple {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:16,472 INFO L290 TraceCheckUtils]: 8: Hoare triple {3593#(not (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)))} assume !(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32); {3574#false} is VALID [2022-02-20 23:47:16,472 INFO L290 TraceCheckUtils]: 9: Hoare triple {3574#false} main_#res#1 := 0bv32; {3574#false} is VALID [2022-02-20 23:47:16,472 INFO L290 TraceCheckUtils]: 10: Hoare triple {3574#false} assume !(#valid == main_old_#valid#1); {3574#false} is VALID [2022-02-20 23:47:16,472 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:47:16,472 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:16,472 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:16,473 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1775739669] [2022-02-20 23:47:16,473 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1775739669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:16,473 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:16,473 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:16,473 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11031859] [2022-02-20 23:47:16,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:16,473 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:47:16,474 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:16,474 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,484 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,484 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:16,484 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:16,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:16,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:16,485 INFO L87 Difference]: Start difference. First operand 137 states and 157 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,799 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2022-02-20 23:47:16,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:16,799 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:47:16,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:16,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-02-20 23:47:16,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 120 transitions. [2022-02-20 23:47:16,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 120 transitions. [2022-02-20 23:47:16,906 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 120 edges. 120 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:16,907 INFO L225 Difference]: With dead ends: 138 [2022-02-20 23:47:16,907 INFO L226 Difference]: Without dead ends: 138 [2022-02-20 23:47:16,908 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 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:47:16,908 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 2 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:16,908 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2 Valid, 214 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:16,909 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2022-02-20 23:47:16,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 137. [2022-02-20 23:47:16,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:16,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 138 states. Second operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,912 INFO L74 IsIncluded]: Start isIncluded. First operand 138 states. Second operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,912 INFO L87 Difference]: Start difference. First operand 138 states. Second operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,914 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2022-02-20 23:47:16,914 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2022-02-20 23:47:16,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,915 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,915 INFO L74 IsIncluded]: Start isIncluded. First operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 138 states. [2022-02-20 23:47:16,915 INFO L87 Difference]: Start difference. First operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 138 states. [2022-02-20 23:47:16,917 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:16,917 INFO L93 Difference]: Finished difference Result 138 states and 157 transitions. [2022-02-20 23:47:16,917 INFO L276 IsEmpty]: Start isEmpty. Operand 138 states and 157 transitions. [2022-02-20 23:47:16,918 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:16,918 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:16,918 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:16,918 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:16,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 137 states, 93 states have (on average 1.6774193548387097) internal successors, (156), 136 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 137 states to 137 states and 156 transitions. [2022-02-20 23:47:16,920 INFO L78 Accepts]: Start accepts. Automaton has 137 states and 156 transitions. Word has length 11 [2022-02-20 23:47:16,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:16,921 INFO L470 AbstractCegarLoop]: Abstraction has 137 states and 156 transitions. [2022-02-20 23:47:16,921 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:16,921 INFO L276 IsEmpty]: Start isEmpty. Operand 137 states and 156 transitions. [2022-02-20 23:47:16,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:16,921 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:16,921 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:16,928 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Ended with exit code 0 [2022-02-20 23:47:17,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:17,128 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr42REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:17,128 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:17,128 INFO L85 PathProgramCache]: Analyzing trace with hash 354271856, now seen corresponding path program 1 times [2022-02-20 23:47:17,129 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:17,129 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1887327689] [2022-02-20 23:47:17,129 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:17,129 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:17,129 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:17,130 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:17,135 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:47:17,194 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,197 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:47:17,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:17,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:17,222 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:47:17,249 INFO L290 TraceCheckUtils]: 0: Hoare triple {4159#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(13bv32, 2bv32); {4159#true} is VALID [2022-02-20 23:47:17,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {4159#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4159#true} is VALID [2022-02-20 23:47:17,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {4159#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {4159#true} is VALID [2022-02-20 23:47:17,252 INFO L290 TraceCheckUtils]: 3: Hoare triple {4159#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {4159#true} is VALID [2022-02-20 23:47:17,252 INFO L290 TraceCheckUtils]: 4: Hoare triple {4159#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4159#true} is VALID [2022-02-20 23:47:17,253 INFO L290 TraceCheckUtils]: 5: Hoare triple {4159#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,253 INFO L290 TraceCheckUtils]: 6: Hoare triple {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {4179#(= (select |#valid| |ULTIMATE.start_main_~s~0#1.base|) (_ bv1 1))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:17,260 INFO L290 TraceCheckUtils]: 11: Hoare triple {4189#(= (select |#valid| |ULTIMATE.start_main_~st~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~st~0#1.base]); {4160#false} is VALID [2022-02-20 23:47:17,260 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:47:17,260 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:17,260 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:17,260 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1887327689] [2022-02-20 23:47:17,260 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1887327689] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:17,260 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:17,260 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:17,261 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1996760257] [2022-02-20 23:47:17,261 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:17,261 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:17,261 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:17,261 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:17,272 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:17,273 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:17,273 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:17,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:17,273 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:17,273 INFO L87 Difference]: Start difference. First operand 137 states and 156 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,011 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:18,012 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:47:18,012 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:18,012 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:18,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:18,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,019 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2022-02-20 23:47:18,019 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,020 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2022-02-20 23:47:18,020 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 140 transitions. [2022-02-20 23:47:18,144 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:18,145 INFO L225 Difference]: With dead ends: 150 [2022-02-20 23:47:18,145 INFO L226 Difference]: Without dead ends: 150 [2022-02-20 23:47:18,145 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:18,146 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 43 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:18,146 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [43 Valid, 195 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 128 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2022-02-20 23:47:18,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 134. [2022-02-20 23:47:18,148 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:18,148 INFO L82 GeneralOperation]: Start isEquivalent. First operand 150 states. Second operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,148 INFO L74 IsIncluded]: Start isIncluded. First operand 150 states. Second operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,149 INFO L87 Difference]: Start difference. First operand 150 states. Second operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:18,151 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:47:18,151 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-02-20 23:47:18,152 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:18,152 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:18,152 INFO L74 IsIncluded]: Start isIncluded. First operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 150 states. [2022-02-20 23:47:18,152 INFO L87 Difference]: Start difference. First operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 150 states. [2022-02-20 23:47:18,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:18,155 INFO L93 Difference]: Finished difference Result 150 states and 170 transitions. [2022-02-20 23:47:18,155 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 170 transitions. [2022-02-20 23:47:18,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:18,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:18,155 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:18,155 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:18,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 95 states have (on average 1.6210526315789473) internal successors, (154), 133 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 154 transitions. [2022-02-20 23:47:18,157 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 154 transitions. Word has length 12 [2022-02-20 23:47:18,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:18,158 INFO L470 AbstractCegarLoop]: Abstraction has 134 states and 154 transitions. [2022-02-20 23:47:18,158 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,158 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 154 transitions. [2022-02-20 23:47:18,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:47:18,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:18,158 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:18,169 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:18,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,367 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr43REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:18,368 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:18,368 INFO L85 PathProgramCache]: Analyzing trace with hash 354271857, now seen corresponding path program 1 times [2022-02-20 23:47:18,368 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:18,368 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1346511872] [2022-02-20 23:47:18,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:18,368 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:18,368 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:18,369 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:18,370 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:47:18,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,442 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:18,451 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:18,452 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:18,490 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:47:18,555 INFO L290 TraceCheckUtils]: 0: Hoare triple {4784#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(13bv32, 2bv32); {4784#true} is VALID [2022-02-20 23:47:18,555 INFO L290 TraceCheckUtils]: 1: Hoare triple {4784#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {4784#true} is VALID [2022-02-20 23:47:18,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {4784#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {4784#true} is VALID [2022-02-20 23:47:18,556 INFO L290 TraceCheckUtils]: 3: Hoare triple {4784#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {4784#true} is VALID [2022-02-20 23:47:18,556 INFO L290 TraceCheckUtils]: 4: Hoare triple {4784#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {4784#true} is VALID [2022-02-20 23:47:18,557 INFO L290 TraceCheckUtils]: 5: Hoare triple {4784#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:18,557 INFO L290 TraceCheckUtils]: 6: Hoare triple {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:18,558 INFO L290 TraceCheckUtils]: 7: Hoare triple {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:18,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {4804#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:18,559 INFO L290 TraceCheckUtils]: 9: Hoare triple {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:18,559 INFO L290 TraceCheckUtils]: 10: Hoare triple {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:18,560 INFO L290 TraceCheckUtils]: 11: Hoare triple {4814#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_~st~0#1.offset)), #length[main_~st~0#1.base]) && ~bvule32(~bvadd32(4bv32, main_~st~0#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_~st~0#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_~st~0#1.offset))); {4785#false} is VALID [2022-02-20 23:47:18,560 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:47:18,560 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:18,560 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:18,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1346511872] [2022-02-20 23:47:18,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1346511872] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:18,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:18,560 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:18,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1240619172] [2022-02-20 23:47:18,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:18,561 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:18,561 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:18,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:18,575 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:18,575 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:47:18,575 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:18,575 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:47:18,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:47:18,576 INFO L87 Difference]: Start difference. First operand 134 states and 154 transitions. Second operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,521 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2022-02-20 23:47:19,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:19,522 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 23:47:19,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:19,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,523 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2022-02-20 23:47:19,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 163 transitions. [2022-02-20 23:47:19,524 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 163 transitions. [2022-02-20 23:47:19,675 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 163 edges. 163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:19,676 INFO L225 Difference]: With dead ends: 173 [2022-02-20 23:47:19,676 INFO L226 Difference]: Without dead ends: 173 [2022-02-20 23:47:19,677 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:19,677 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 51 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 168 SdHoareTripleChecker+Invalid, 171 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:19,677 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 168 Invalid, 171 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:19,678 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 173 states. [2022-02-20 23:47:19,679 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 173 to 141. [2022-02-20 23:47:19,679 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:19,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 173 states. Second operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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:47:19,680 INFO L74 IsIncluded]: Start isIncluded. First operand 173 states. Second operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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:47:19,680 INFO L87 Difference]: Start difference. First operand 173 states. Second operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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:47:19,682 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,682 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2022-02-20 23:47:19,682 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2022-02-20 23:47:19,683 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,683 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,683 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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 173 states. [2022-02-20 23:47:19,683 INFO L87 Difference]: Start difference. First operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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 173 states. [2022-02-20 23:47:19,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:19,685 INFO L93 Difference]: Finished difference Result 173 states and 195 transitions. [2022-02-20 23:47:19,685 INFO L276 IsEmpty]: Start isEmpty. Operand 173 states and 195 transitions. [2022-02-20 23:47:19,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:19,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:19,686 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:19,686 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:19,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 106 states have (on average 1.5754716981132075) internal successors, (167), 140 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:47:19,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 167 transitions. [2022-02-20 23:47:19,687 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 167 transitions. Word has length 12 [2022-02-20 23:47:19,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:19,688 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 167 transitions. [2022-02-20 23:47:19,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:19,688 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 167 transitions. [2022-02-20 23:47:19,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2022-02-20 23:47:19,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:19,688 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:19,697 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:19,894 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,894 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:19,895 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:19,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1772597097, now seen corresponding path program 1 times [2022-02-20 23:47:19,895 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:19,895 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1466196874] [2022-02-20 23:47:19,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:19,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:19,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:19,896 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:19,899 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:47:19,956 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,958 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:47:19,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:19,964 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 0: Hoare triple {5485#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(13bv32, 2bv32); {5485#true} is VALID [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {5485#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {5485#true} is VALID [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {5485#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {5485#true} is VALID [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {5485#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {5485#true} is VALID [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 4: Hoare triple {5485#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {5485#true} is VALID [2022-02-20 23:47:19,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {5485#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {5485#true} is VALID [2022-02-20 23:47:19,985 INFO L290 TraceCheckUtils]: 6: Hoare triple {5485#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {5485#true} is VALID [2022-02-20 23:47:19,985 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#true} assume !main_#t~short7#1; {5511#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:47:19,985 INFO L290 TraceCheckUtils]: 8: Hoare triple {5511#(not |ULTIMATE.start_main_#t~short7#1|)} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {5486#false} is VALID [2022-02-20 23:47:19,985 INFO L290 TraceCheckUtils]: 9: Hoare triple {5486#false} assume !(0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {5486#false} is VALID [2022-02-20 23:47:19,985 INFO L290 TraceCheckUtils]: 10: Hoare triple {5486#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L542 {5486#false} is VALID [2022-02-20 23:47:19,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {5486#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {5486#false} is VALID [2022-02-20 23:47:19,986 INFO L290 TraceCheckUtils]: 12: Hoare triple {5486#false} assume !(1bv1 == #valid[main_~n~0#1.base]); {5486#false} is VALID [2022-02-20 23:47:19,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:19,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:19,986 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:19,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1466196874] [2022-02-20 23:47:19,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1466196874] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:19,986 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:19,987 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:47:19,987 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731440939] [2022-02-20 23:47:19,987 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:19,987 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:19,987 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:19,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:19,997 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:47:19,998 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:47:19,998 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:19,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:47:19,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:47:19,998 INFO L87 Difference]: Start difference. First operand 141 states and 167 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:20,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,248 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2022-02-20 23:47:20,248 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:47:20,248 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:20,248 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:20,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:20,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 23:47:20,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:20,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 109 transitions. [2022-02-20 23:47:20,250 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 109 transitions. [2022-02-20 23:47:20,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,338 INFO L225 Difference]: With dead ends: 143 [2022-02-20 23:47:20,338 INFO L226 Difference]: Without dead ends: 143 [2022-02-20 23:47:20,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 11 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:47:20,339 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 0 mSDsluCounter, 100 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 206 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:20,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 206 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:47:20,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-20 23:47:20,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2022-02-20 23:47:20,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:20,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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:47:20,341 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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:47:20,342 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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:47:20,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,343 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2022-02-20 23:47:20,343 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2022-02-20 23:47:20,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,344 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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 143 states. [2022-02-20 23:47:20,344 INFO L87 Difference]: Start difference. First operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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 143 states. [2022-02-20 23:47:20,346 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:20,346 INFO L93 Difference]: Finished difference Result 143 states and 169 transitions. [2022-02-20 23:47:20,346 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2022-02-20 23:47:20,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:20,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:20,346 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:20,346 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:20,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 108 states have (on average 1.5648148148148149) internal successors, (169), 142 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:47:20,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2022-02-20 23:47:20,348 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 13 [2022-02-20 23:47:20,348 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:20,348 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2022-02-20 23:47:20,348 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 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:47:20,349 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2022-02-20 23:47:20,349 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:20,349 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:20,349 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:20,355 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:20,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,555 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:20,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:20,555 INFO L85 PathProgramCache]: Analyzing trace with hash 131239230, now seen corresponding path program 1 times [2022-02-20 23:47:20,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:20,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437460019] [2022-02-20 23:47:20,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:20,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:20,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:20,557 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:20,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:47:20,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,623 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:20,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:20,633 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:20,655 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:47:20,672 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:47:20,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:47:20,704 INFO L290 TraceCheckUtils]: 0: Hoare triple {6098#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(13bv32, 2bv32); {6098#true} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 1: Hoare triple {6098#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6098#true} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 2: Hoare triple {6098#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {6098#true} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 3: Hoare triple {6098#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {6098#true} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {6098#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {6098#true} is VALID [2022-02-20 23:47:20,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {6098#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {6098#true} is VALID [2022-02-20 23:47:20,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {6098#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {6098#true} is VALID [2022-02-20 23:47:20,706 INFO L290 TraceCheckUtils]: 7: Hoare triple {6098#true} assume !main_#t~short7#1; {6098#true} is VALID [2022-02-20 23:47:20,706 INFO L290 TraceCheckUtils]: 8: Hoare triple {6098#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {6098#true} is VALID [2022-02-20 23:47:20,706 INFO L290 TraceCheckUtils]: 9: Hoare triple {6098#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {6098#true} is VALID [2022-02-20 23:47:20,707 INFO L290 TraceCheckUtils]: 10: Hoare triple {6098#true} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32); {6133#(= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,709 INFO L290 TraceCheckUtils]: 11: Hoare triple {6133#(= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L545 {6137#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} is VALID [2022-02-20 23:47:20,709 INFO L290 TraceCheckUtils]: 12: Hoare triple {6137#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {6137#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} is VALID [2022-02-20 23:47:20,710 INFO L290 TraceCheckUtils]: 13: Hoare triple {6137#(= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L546 {6144#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:20,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {6144#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem14#1.base]); {6099#false} is VALID [2022-02-20 23:47:20,715 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:47:20,715 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:20,715 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:20,715 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437460019] [2022-02-20 23:47:20,715 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437460019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:20,715 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:20,715 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:20,716 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513007908] [2022-02-20 23:47:20,716 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:20,716 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:20,716 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:20,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:20,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:20,730 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:20,731 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:20,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:20,731 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:20,731 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,605 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-02-20 23:47:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,606 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:47:21,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,607 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 107 transitions. [2022-02-20 23:47:21,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 107 transitions. [2022-02-20 23:47:21,700 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 107 edges. 107 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:21,702 INFO L225 Difference]: With dead ends: 142 [2022-02-20 23:47:21,702 INFO L226 Difference]: Without dead ends: 142 [2022-02-20 23:47:21,702 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:21,702 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 6 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:21,703 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 245 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:21,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 142 states. [2022-02-20 23:47:21,704 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 142 to 142. [2022-02-20 23:47:21,705 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:21,705 INFO L82 GeneralOperation]: Start isEquivalent. First operand 142 states. Second operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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:47:21,705 INFO L74 IsIncluded]: Start isIncluded. First operand 142 states. Second operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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:47:21,705 INFO L87 Difference]: Start difference. First operand 142 states. Second operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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:47:21,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,707 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-02-20 23:47:21,707 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-02-20 23:47:21,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,708 INFO L74 IsIncluded]: Start isIncluded. First operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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 142 states. [2022-02-20 23:47:21,708 INFO L87 Difference]: Start difference. First operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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 142 states. [2022-02-20 23:47:21,709 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:21,710 INFO L93 Difference]: Finished difference Result 142 states and 167 transitions. [2022-02-20 23:47:21,710 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-02-20 23:47:21,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:21,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:21,710 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:21,710 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:21,711 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 142 states, 108 states have (on average 1.5462962962962963) internal successors, (167), 141 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:47:21,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 142 states to 142 states and 167 transitions. [2022-02-20 23:47:21,712 INFO L78 Accepts]: Start accepts. Automaton has 142 states and 167 transitions. Word has length 15 [2022-02-20 23:47:21,712 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:21,712 INFO L470 AbstractCegarLoop]: Abstraction has 142 states and 167 transitions. [2022-02-20 23:47:21,713 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:21,713 INFO L276 IsEmpty]: Start isEmpty. Operand 142 states and 167 transitions. [2022-02-20 23:47:21,713 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:21,713 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:21,713 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:21,720 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:21,919 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:21,919 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:21,920 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:21,920 INFO L85 PathProgramCache]: Analyzing trace with hash 131239231, now seen corresponding path program 1 times [2022-02-20 23:47:21,920 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:21,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187653433] [2022-02-20 23:47:21,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:21,920 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:21,920 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:21,921 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:21,922 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:47:21,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,982 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:21,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:21,994 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:22,020 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:47:22,050 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:47:22,057 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:47:22,091 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2022-02-20 23:47:22,108 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 0: Hoare triple {6719#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(13bv32, 2bv32); {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 1: Hoare triple {6719#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 2: Hoare triple {6719#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 3: Hoare triple {6719#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 4: Hoare triple {6719#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 5: Hoare triple {6719#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {6719#true} is VALID [2022-02-20 23:47:22,119 INFO L290 TraceCheckUtils]: 6: Hoare triple {6719#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {6719#true} is VALID [2022-02-20 23:47:22,120 INFO L290 TraceCheckUtils]: 7: Hoare triple {6719#true} assume !main_#t~short7#1; {6719#true} is VALID [2022-02-20 23:47:22,120 INFO L290 TraceCheckUtils]: 8: Hoare triple {6719#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {6719#true} is VALID [2022-02-20 23:47:22,120 INFO L290 TraceCheckUtils]: 9: Hoare triple {6719#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {6719#true} is VALID [2022-02-20 23:47:22,121 INFO L290 TraceCheckUtils]: 10: Hoare triple {6719#true} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32); {6754#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,124 INFO L290 TraceCheckUtils]: 11: Hoare triple {6754#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L545 {6758#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:22,124 INFO L290 TraceCheckUtils]: 12: Hoare triple {6758#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {6758#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:22,125 INFO L290 TraceCheckUtils]: 13: Hoare triple {6758#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L546 {6765#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:22,125 INFO L290 TraceCheckUtils]: 14: Hoare triple {6765#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_#t~mem14#1.offset), #length[main_#t~mem14#1.base]) && ~bvule32(main_#t~mem14#1.offset, ~bvadd32(4bv32, main_#t~mem14#1.offset))) && ~bvule32(0bv32, main_#t~mem14#1.offset)); {6720#false} is VALID [2022-02-20 23:47:22,125 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:47:22,126 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:22,126 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:22,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187653433] [2022-02-20 23:47:22,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187653433] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:22,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:22,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:22,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [846371695] [2022-02-20 23:47:22,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:22,126 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:22,126 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:22,126 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:22,140 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:22,140 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:22,141 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:22,141 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:22,141 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:22,141 INFO L87 Difference]: Start difference. First operand 142 states and 167 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,108 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2022-02-20 23:47:23,108 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:23,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:23,109 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:23,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:47:23,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,110 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 106 transitions. [2022-02-20 23:47:23,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 106 transitions. [2022-02-20 23:47:23,200 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:23,202 INFO L225 Difference]: With dead ends: 141 [2022-02-20 23:47:23,202 INFO L226 Difference]: Without dead ends: 141 [2022-02-20 23:47:23,202 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:23,202 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 4 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 184 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 184 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:23,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 227 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 184 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:23,203 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2022-02-20 23:47:23,204 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 141. [2022-02-20 23:47:23,204 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:23,205 INFO L82 GeneralOperation]: Start isEquivalent. First operand 141 states. Second operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,205 INFO L74 IsIncluded]: Start isIncluded. First operand 141 states. Second operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,205 INFO L87 Difference]: Start difference. First operand 141 states. Second operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,207 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2022-02-20 23:47:23,207 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2022-02-20 23:47:23,207 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,207 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,208 INFO L74 IsIncluded]: Start isIncluded. First operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states. [2022-02-20 23:47:23,208 INFO L87 Difference]: Start difference. First operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 141 states. [2022-02-20 23:47:23,209 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:23,209 INFO L93 Difference]: Finished difference Result 141 states and 165 transitions. [2022-02-20 23:47:23,209 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2022-02-20 23:47:23,210 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:23,210 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:23,210 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:23,210 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:23,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 141 states, 108 states have (on average 1.5277777777777777) internal successors, (165), 140 states have internal predecessors, (165), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 141 states to 141 states and 165 transitions. [2022-02-20 23:47:23,212 INFO L78 Accepts]: Start accepts. Automaton has 141 states and 165 transitions. Word has length 15 [2022-02-20 23:47:23,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:23,212 INFO L470 AbstractCegarLoop]: Abstraction has 141 states and 165 transitions. [2022-02-20 23:47:23,212 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,212 INFO L276 IsEmpty]: Start isEmpty. Operand 141 states and 165 transitions. [2022-02-20 23:47:23,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:23,212 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:23,213 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:23,219 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:23,419 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:23,419 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:23,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:23,420 INFO L85 PathProgramCache]: Analyzing trace with hash -1899349350, now seen corresponding path program 1 times [2022-02-20 23:47:23,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:23,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [278002432] [2022-02-20 23:47:23,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:23,420 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:23,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:23,421 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:23,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:47:23,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:23,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:23,483 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:23,497 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 13 treesize of output 9 [2022-02-20 23:47:23,502 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 13 treesize of output 9 [2022-02-20 23:47:23,575 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:23,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:23,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {7336#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(13bv32, 2bv32); {7336#true} is VALID [2022-02-20 23:47:23,612 INFO L290 TraceCheckUtils]: 1: Hoare triple {7336#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {7336#true} is VALID [2022-02-20 23:47:23,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {7336#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {7336#true} is VALID [2022-02-20 23:47:23,614 INFO L290 TraceCheckUtils]: 3: Hoare triple {7336#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {7350#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:23,616 INFO L290 TraceCheckUtils]: 4: Hoare triple {7350#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~root~0#1.offset|)) (_ bv0 32)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:23,617 INFO L290 TraceCheckUtils]: 5: Hoare triple {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:23,627 INFO L290 TraceCheckUtils]: 6: Hoare triple {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:23,628 INFO L290 TraceCheckUtils]: 7: Hoare triple {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} assume main_#t~short7#1; {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:23,631 INFO L290 TraceCheckUtils]: 8: Hoare triple {7354#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem6#1.base, main_#t~mem6#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L538-3 {7367#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:23,632 INFO L290 TraceCheckUtils]: 9: Hoare triple {7367#(and (= |ULTIMATE.start_main_#t~mem6#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem6#1.base| (_ bv0 32)))} main_#t~short7#1 := main_#t~mem6#1.base != 0bv32 || main_#t~mem6#1.offset != 0bv32; {7371#(not |ULTIMATE.start_main_#t~short7#1|)} is VALID [2022-02-20 23:47:23,632 INFO L290 TraceCheckUtils]: 10: Hoare triple {7371#(not |ULTIMATE.start_main_#t~short7#1|)} assume !!main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {7337#false} is VALID [2022-02-20 23:47:23,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {7337#false} assume !(0bv32 != main_#t~nondet8#1);havoc main_#t~nondet8#1; {7337#false} is VALID [2022-02-20 23:47:23,633 INFO L290 TraceCheckUtils]: 12: Hoare triple {7337#false} SUMMARY for call main_#t~mem10#1.base, main_#t~mem10#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L542 {7337#false} is VALID [2022-02-20 23:47:23,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {7337#false} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem10#1.base, main_#t~mem10#1.offset;havoc main_#t~mem10#1.base, main_#t~mem10#1.offset; {7337#false} is VALID [2022-02-20 23:47:23,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {7337#false} assume !(1bv1 == #valid[main_~n~0#1.base]); {7337#false} is VALID [2022-02-20 23:47:23,633 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:23,633 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:23,634 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:23,634 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [278002432] [2022-02-20 23:47:23,634 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [278002432] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:23,634 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:23,634 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:47:23,634 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1848491066] [2022-02-20 23:47:23,634 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:23,635 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:23,637 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:23,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:23,652 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:23,652 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:23,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:23,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:23,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:23,652 INFO L87 Difference]: Start difference. First operand 141 states and 165 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,928 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:24,929 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2022-02-20 23:47:24,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:47:24,929 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:24,929 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:24,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:47:24,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:24,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 147 transitions. [2022-02-20 23:47:24,930 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 147 transitions. [2022-02-20 23:47:25,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 147 edges. 147 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:25,081 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:47:25,081 INFO L226 Difference]: Without dead ends: 174 [2022-02-20 23:47:25,081 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:47:25,081 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 37 mSDsluCounter, 296 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 388 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:25,082 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 388 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:25,082 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 174 states. [2022-02-20 23:47:25,083 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 174 to 152. [2022-02-20 23:47:25,083 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:25,084 INFO L82 GeneralOperation]: Start isEquivalent. First operand 174 states. Second operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,084 INFO L74 IsIncluded]: Start isIncluded. First operand 174 states. Second operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,084 INFO L87 Difference]: Start difference. First operand 174 states. Second operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,086 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2022-02-20 23:47:25,086 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2022-02-20 23:47:25,086 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states. [2022-02-20 23:47:25,087 INFO L87 Difference]: Start difference. First operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 174 states. [2022-02-20 23:47:25,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:25,089 INFO L93 Difference]: Finished difference Result 174 states and 205 transitions. [2022-02-20 23:47:25,089 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 205 transitions. [2022-02-20 23:47:25,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:25,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:25,089 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:25,089 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:25,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 152 states, 119 states have (on average 1.5126050420168067) internal successors, (180), 151 states have internal predecessors, (180), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,092 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 152 states to 152 states and 180 transitions. [2022-02-20 23:47:25,092 INFO L78 Accepts]: Start accepts. Automaton has 152 states and 180 transitions. Word has length 15 [2022-02-20 23:47:25,092 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:25,092 INFO L470 AbstractCegarLoop]: Abstraction has 152 states and 180 transitions. [2022-02-20 23:47:25,092 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 6 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,092 INFO L276 IsEmpty]: Start isEmpty. Operand 152 states and 180 transitions. [2022-02-20 23:47:25,093 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:47:25,093 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:25,093 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:25,101 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:25,299 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:25,299 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:25,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:25,300 INFO L85 PathProgramCache]: Analyzing trace with hash 1378323132, now seen corresponding path program 1 times [2022-02-20 23:47:25,300 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:25,300 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [619667091] [2022-02-20 23:47:25,300 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:25,300 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:25,300 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:25,301 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:25,302 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:47:25,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,386 INFO L263 TraceCheckSpWp]: Trace formula consists of 106 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:47:25,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:25,395 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:25,755 INFO L290 TraceCheckUtils]: 0: Hoare triple {8068#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(13bv32, 2bv32); {8073#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:25,757 INFO L290 TraceCheckUtils]: 1: Hoare triple {8073#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:25,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:25,766 INFO L290 TraceCheckUtils]: 3: Hoare triple {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:25,768 INFO L290 TraceCheckUtils]: 4: Hoare triple {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} is VALID [2022-02-20 23:47:25,769 INFO L290 TraceCheckUtils]: 5: Hoare triple {8077#(exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32)))))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,777 INFO L290 TraceCheckUtils]: 6: Hoare triple {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,783 INFO L290 TraceCheckUtils]: 7: Hoare triple {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,785 INFO L290 TraceCheckUtils]: 8: Hoare triple {8090#(and (bvult |ULTIMATE.start_main_~s~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,790 INFO L290 TraceCheckUtils]: 10: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,794 INFO L290 TraceCheckUtils]: 12: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume 0bv32 == main_~st~0#1.offset; {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} is VALID [2022-02-20 23:47:25,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {8100#(and (bvult |ULTIMATE.start_main_~st~0#1.base| |#StackHeapBarrier|) (exists ((|ULTIMATE.start_main_~root~0#1.base| (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))))} assume !~bvult32(main_~st~0#1.base, #StackHeapBarrier); {8069#false} is VALID [2022-02-20 23:47:25,796 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:47:25,796 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:25,797 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:25,797 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [619667091] [2022-02-20 23:47:25,797 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [619667091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:25,797 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:25,797 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:25,797 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90276414] [2022-02-20 23:47:25,797 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:25,797 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:25,797 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:25,797 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:25,850 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:25,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:47:25,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:25,851 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:47:25,851 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:25,851 INFO L87 Difference]: Start difference. First operand 152 states and 180 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,300 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2022-02-20 23:47:26,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:47:26,300 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:47:26,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:26,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-02-20 23:47:26,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 140 transitions. [2022-02-20 23:47:26,301 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 140 transitions. [2022-02-20 23:47:26,474 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:26,475 INFO L225 Difference]: With dead ends: 165 [2022-02-20 23:47:26,475 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:47:26,475 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:26,476 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 54 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 248 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 36 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:26,476 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 248 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 6 Invalid, 0 Unknown, 36 Unchecked, 0.0s Time] [2022-02-20 23:47:26,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:47:26,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 162. [2022-02-20 23:47:26,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:26,478 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,478 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,478 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,480 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2022-02-20 23:47:26,480 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-02-20 23:47:26,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:26,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:26,480 INFO L74 IsIncluded]: Start isIncluded. First operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:47:26,481 INFO L87 Difference]: Start difference. First operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 165 states. [2022-02-20 23:47:26,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:26,483 INFO L93 Difference]: Finished difference Result 165 states and 190 transitions. [2022-02-20 23:47:26,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 190 transitions. [2022-02-20 23:47:26,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:26,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:26,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:26,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:26,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 129 states have (on average 1.4728682170542635) internal successors, (190), 161 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 190 transitions. [2022-02-20 23:47:26,485 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 190 transitions. Word has length 15 [2022-02-20 23:47:26,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:26,485 INFO L470 AbstractCegarLoop]: Abstraction has 162 states and 190 transitions. [2022-02-20 23:47:26,486 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,486 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 190 transitions. [2022-02-20 23:47:26,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:26,486 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:26,486 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:26,493 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:26,692 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:26,693 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:26,693 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751881, now seen corresponding path program 1 times [2022-02-20 23:47:26,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:26,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457100763] [2022-02-20 23:47:26,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:26,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:26,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:26,695 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:26,696 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:47:26,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,755 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:47:26,763 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:26,764 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:26,801 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:47:26,816 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 13 treesize of output 9 [2022-02-20 23:47:26,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:47:26,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {8775#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(13bv32, 2bv32); {8775#true} is VALID [2022-02-20 23:47:26,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {8775#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {8775#true} is VALID [2022-02-20 23:47:26,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {8775#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 3: Hoare triple {8775#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 4: Hoare triple {8775#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 5: Hoare triple {8775#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 6: Hoare triple {8775#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 7: Hoare triple {8775#true} assume !main_#t~short7#1; {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 8: Hoare triple {8775#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {8775#true} is VALID [2022-02-20 23:47:26,849 INFO L290 TraceCheckUtils]: 9: Hoare triple {8775#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {8775#true} is VALID [2022-02-20 23:47:26,850 INFO L290 TraceCheckUtils]: 10: Hoare triple {8775#true} assume !((main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; {8775#true} is VALID [2022-02-20 23:47:26,850 INFO L290 TraceCheckUtils]: 11: Hoare triple {8775#true} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544-2 {8775#true} is VALID [2022-02-20 23:47:26,851 INFO L290 TraceCheckUtils]: 12: Hoare triple {8775#true} assume (main_#t~mem16#1.base == 0bv32 && main_#t~mem16#1.offset == 0bv32) && 0bv32 != main_#t~nondet17#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1;call main_#t~malloc18#1.base, main_#t~malloc18#1.offset := #Ultimate.allocOnHeap(8bv32); {8816#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~malloc18#1.base|))} is VALID [2022-02-20 23:47:26,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {8816#(= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~malloc18#1.base|))} SUMMARY for call write~$Pointer$(main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L550 {8820#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:47:26,853 INFO L290 TraceCheckUtils]: 14: Hoare triple {8820#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1))} havoc main_#t~malloc18#1.base, main_#t~malloc18#1.offset; {8820#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1))} is VALID [2022-02-20 23:47:26,854 INFO L290 TraceCheckUtils]: 15: Hoare triple {8820#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L551 {8827#(= (select |#valid| |ULTIMATE.start_main_#t~mem19#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:26,854 INFO L290 TraceCheckUtils]: 16: Hoare triple {8827#(= (select |#valid| |ULTIMATE.start_main_#t~mem19#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem19#1.base]); {8776#false} is VALID [2022-02-20 23:47:26,854 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:47:26,854 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:26,854 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:26,855 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457100763] [2022-02-20 23:47:26,855 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457100763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:26,855 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:26,855 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:26,856 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28310763] [2022-02-20 23:47:26,856 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:26,856 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:26,856 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:26,856 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:26,874 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:26,875 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:26,875 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:26,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:26,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:26,876 INFO L87 Difference]: Start difference. First operand 162 states and 190 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,822 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2022-02-20 23:47:27,822 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:27,823 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:27,823 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:47:27,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 105 transitions. [2022-02-20 23:47:27,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 105 transitions. [2022-02-20 23:47:27,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 105 edges. 105 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:27,932 INFO L225 Difference]: With dead ends: 161 [2022-02-20 23:47:27,932 INFO L226 Difference]: Without dead ends: 161 [2022-02-20 23:47:27,932 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:27,932 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 6 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 240 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:27,933 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [6 Valid, 240 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:47:27,933 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 161 states. [2022-02-20 23:47:27,934 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 161 to 161. [2022-02-20 23:47:27,934 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:27,934 INFO L82 GeneralOperation]: Start isEquivalent. First operand 161 states. Second operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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:47:27,935 INFO L74 IsIncluded]: Start isIncluded. First operand 161 states. Second operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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:47:27,935 INFO L87 Difference]: Start difference. First operand 161 states. Second operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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:47:27,936 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,936 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2022-02-20 23:47:27,936 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2022-02-20 23:47:27,937 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,937 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,937 INFO L74 IsIncluded]: Start isIncluded. First operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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 161 states. [2022-02-20 23:47:27,937 INFO L87 Difference]: Start difference. First operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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 161 states. [2022-02-20 23:47:27,938 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:27,938 INFO L93 Difference]: Finished difference Result 161 states and 188 transitions. [2022-02-20 23:47:27,939 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2022-02-20 23:47:27,939 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:27,939 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:27,939 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:27,939 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:27,939 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 129 states have (on average 1.4573643410852712) internal successors, (188), 160 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:47:27,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 188 transitions. [2022-02-20 23:47:27,940 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 188 transitions. Word has length 17 [2022-02-20 23:47:27,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:27,941 INFO L470 AbstractCegarLoop]: Abstraction has 161 states and 188 transitions. [2022-02-20 23:47:27,941 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:27,941 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 188 transitions. [2022-02-20 23:47:27,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:27,941 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:27,941 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:27,953 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:28,141 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:28,142 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:28,142 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:28,142 INFO L85 PathProgramCache]: Analyzing trace with hash -1534751880, now seen corresponding path program 1 times [2022-02-20 23:47:28,142 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:28,142 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [941496748] [2022-02-20 23:47:28,142 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:28,142 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:28,142 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:28,143 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:28,144 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2022-02-20 23:47:28,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,205 INFO L263 TraceCheckSpWp]: Trace formula consists of 105 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:47:28,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:28,215 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:28,238 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:47:28,256 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 13 treesize of output 9 [2022-02-20 23:47:28,263 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 13 treesize of output 9 [2022-02-20 23:47:28,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2022-02-20 23:47:28,303 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:28,314 INFO L290 TraceCheckUtils]: 0: Hoare triple {9478#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(13bv32, 2bv32); {9478#true} is VALID [2022-02-20 23:47:28,314 INFO L290 TraceCheckUtils]: 1: Hoare triple {9478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 2: Hoare triple {9478#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 3: Hoare triple {9478#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 4: Hoare triple {9478#true} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 5: Hoare triple {9478#true} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 6: Hoare triple {9478#true} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 7: Hoare triple {9478#true} assume !main_#t~short7#1; {9478#true} is VALID [2022-02-20 23:47:28,315 INFO L290 TraceCheckUtils]: 8: Hoare triple {9478#true} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {9478#true} is VALID [2022-02-20 23:47:28,316 INFO L290 TraceCheckUtils]: 9: Hoare triple {9478#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {9478#true} is VALID [2022-02-20 23:47:28,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {9478#true} assume !((main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; {9478#true} is VALID [2022-02-20 23:47:28,317 INFO L290 TraceCheckUtils]: 11: Hoare triple {9478#true} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544-2 {9478#true} is VALID [2022-02-20 23:47:28,318 INFO L290 TraceCheckUtils]: 12: Hoare triple {9478#true} assume (main_#t~mem16#1.base == 0bv32 && main_#t~mem16#1.offset == 0bv32) && 0bv32 != main_#t~nondet17#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1;call main_#t~malloc18#1.base, main_#t~malloc18#1.offset := #Ultimate.allocOnHeap(8bv32); {9519#(and (= |ULTIMATE.start_main_#t~malloc18#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc18#1.base|)))} is VALID [2022-02-20 23:47:28,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {9519#(and (= |ULTIMATE.start_main_#t~malloc18#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc18#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L550 {9523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:28,320 INFO L290 TraceCheckUtils]: 14: Hoare triple {9523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} havoc main_#t~malloc18#1.base, main_#t~malloc18#1.offset; {9523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:28,320 INFO L290 TraceCheckUtils]: 15: Hoare triple {9523#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L551 {9530#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem19#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:28,321 INFO L290 TraceCheckUtils]: 16: Hoare triple {9530#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem19#1.base|)) (= |ULTIMATE.start_main_#t~mem19#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_#t~mem19#1.offset), #length[main_#t~mem19#1.base]) && ~bvule32(main_#t~mem19#1.offset, ~bvadd32(4bv32, main_#t~mem19#1.offset))) && ~bvule32(0bv32, main_#t~mem19#1.offset)); {9479#false} is VALID [2022-02-20 23:47:28,321 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:47:28,321 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:28,321 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:28,321 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [941496748] [2022-02-20 23:47:28,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [941496748] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:28,322 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:28,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:47:28,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289671524] [2022-02-20 23:47:28,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:28,322 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:28,322 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:28,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:28,338 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:28,339 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:28,339 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:28,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:28,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:28,339 INFO L87 Difference]: Start difference. First operand 161 states and 188 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,433 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2022-02-20 23:47:29,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:47:29,433 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:29,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:29,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:47:29,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 104 transitions. [2022-02-20 23:47:29,434 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 104 transitions. [2022-02-20 23:47:29,528 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:29,529 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:47:29,529 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:47:29,530 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:47:29,530 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 4 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:29,530 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 222 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:47:29,530 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:47:29,532 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 160. [2022-02-20 23:47:29,532 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:29,532 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,532 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,532 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,534 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,534 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2022-02-20 23:47:29,534 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2022-02-20 23:47:29,534 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,534 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,534 INFO L74 IsIncluded]: Start isIncluded. First operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 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 160 states. [2022-02-20 23:47:29,535 INFO L87 Difference]: Start difference. First operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 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 160 states. [2022-02-20 23:47:29,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:29,537 INFO L93 Difference]: Finished difference Result 160 states and 186 transitions. [2022-02-20 23:47:29,537 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2022-02-20 23:47:29,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:29,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:29,537 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:29,537 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:29,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 129 states have (on average 1.441860465116279) internal successors, (186), 159 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 186 transitions. [2022-02-20 23:47:29,539 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 186 transitions. Word has length 17 [2022-02-20 23:47:29,539 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:29,539 INFO L470 AbstractCegarLoop]: Abstraction has 160 states and 186 transitions. [2022-02-20 23:47:29,539 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:29,539 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 186 transitions. [2022-02-20 23:47:29,540 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:29,540 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:29,540 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:29,548 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:29,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:29,740 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:29,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:29,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1718608255, now seen corresponding path program 1 times [2022-02-20 23:47:29,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:29,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [659944204] [2022-02-20 23:47:29,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:29,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:29,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:29,743 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:29,763 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2022-02-20 23:47:29,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:29,822 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:47:29,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:29,835 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:29,846 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:47:29,881 INFO L356 Elim1Store]: treesize reduction 15, result has 46.4 percent of original size [2022-02-20 23:47:29,882 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 24 [2022-02-20 23:47:29,932 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:30,016 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2022-02-20 23:47:30,088 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:47:30,106 INFO L290 TraceCheckUtils]: 0: Hoare triple {10177#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(13bv32, 2bv32); {10177#true} is VALID [2022-02-20 23:47:30,107 INFO L290 TraceCheckUtils]: 1: Hoare triple {10177#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:30,108 INFO L290 TraceCheckUtils]: 2: Hoare triple {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:30,108 INFO L290 TraceCheckUtils]: 3: Hoare triple {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:30,108 INFO L290 TraceCheckUtils]: 4: Hoare triple {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:30,109 INFO L290 TraceCheckUtils]: 5: Hoare triple {10185#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {10198#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:30,110 INFO L290 TraceCheckUtils]: 6: Hoare triple {10198#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {10198#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:30,112 INFO L290 TraceCheckUtils]: 7: Hoare triple {10198#(and (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {10205#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)))} is VALID [2022-02-20 23:47:30,113 INFO L290 TraceCheckUtils]: 8: Hoare triple {10205#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv1 1)) (_ bv0 1)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:30,113 INFO L290 TraceCheckUtils]: 9: Hoare triple {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:30,114 INFO L290 TraceCheckUtils]: 10: Hoare triple {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:30,114 INFO L290 TraceCheckUtils]: 11: Hoare triple {10209#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv1 1)) (_ bv0 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {10219#(and (not (= |ULTIMATE.start_main_#t~mem23#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem23#1.base|) (_ bv1 1)) (_ bv0 1)))} is VALID [2022-02-20 23:47:30,115 INFO L290 TraceCheckUtils]: 12: Hoare triple {10219#(and (not (= |ULTIMATE.start_main_#t~mem23#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (bvadd (select |#valid| |ULTIMATE.start_main_#t~mem23#1.base|) (_ bv1 1)) (_ bv0 1)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:30,115 INFO L290 TraceCheckUtils]: 13: Hoare triple {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~st~0#1.offset; {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:30,116 INFO L290 TraceCheckUtils]: 14: Hoare triple {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} is VALID [2022-02-20 23:47:30,116 INFO L290 TraceCheckUtils]: 15: Hoare triple {10223#(and (not (= |ULTIMATE.start_main_~n~0#1.base| |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {10233#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:30,117 INFO L290 TraceCheckUtils]: 16: Hoare triple {10233#(= (_ bv0 1) (bvadd (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_~n~0#1.base]); {10178#false} is VALID [2022-02-20 23:47:30,117 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:47:30,117 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:30,117 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:30,117 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [659944204] [2022-02-20 23:47:30,117 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [659944204] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:30,117 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:30,117 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:47:30,117 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288358758] [2022-02-20 23:47:30,117 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:30,118 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:30,118 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:30,118 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:30,135 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:30,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:30,136 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:30,136 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:30,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:30,136 INFO L87 Difference]: Start difference. First operand 160 states and 186 transitions. Second operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,374 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:32,375 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2022-02-20 23:47:32,375 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:47:32,375 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:32,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:32,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-02-20 23:47:32,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 139 transitions. [2022-02-20 23:47:32,377 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 139 transitions. [2022-02-20 23:47:32,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:32,525 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:32,525 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:32,525 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:32,525 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 192 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 450 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 473 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 450 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:32,525 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 215 Invalid, 473 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 450 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2022-02-20 23:47:32,526 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:32,527 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 165. [2022-02-20 23:47:32,527 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:32,528 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,528 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,528 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:32,530 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2022-02-20 23:47:32,530 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2022-02-20 23:47:32,530 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:32,531 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:32,531 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:47:32,531 INFO L87 Difference]: Start difference. First operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 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 181 states. [2022-02-20 23:47:32,533 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:32,533 INFO L93 Difference]: Finished difference Result 181 states and 207 transitions. [2022-02-20 23:47:32,533 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 207 transitions. [2022-02-20 23:47:32,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:32,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:32,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:32,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:32,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 134 states have (on average 1.4402985074626866) internal successors, (193), 164 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 193 transitions. [2022-02-20 23:47:32,535 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 193 transitions. Word has length 17 [2022-02-20 23:47:32,535 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:32,535 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 193 transitions. [2022-02-20 23:47:32,536 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.125) internal successors, (17), 9 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:32,536 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 193 transitions. [2022-02-20 23:47:32,536 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:47:32,536 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:32,536 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:32,547 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:32,740 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:32,740 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:32,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:32,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1718608256, now seen corresponding path program 1 times [2022-02-20 23:47:32,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:32,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76727560] [2022-02-20 23:47:32,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:32,741 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:32,741 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:32,742 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:32,744 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2022-02-20 23:47:32,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:32,827 INFO L263 TraceCheckSpWp]: Trace formula consists of 110 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 23:47:32,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:32,836 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:32,848 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:47:32,852 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:47:32,919 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:32,919 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:47:32,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:47:32,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:32,992 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 13 treesize of output 9 [2022-02-20 23:47:33,084 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:33,090 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:47:33,152 INFO L290 TraceCheckUtils]: 0: Hoare triple {10958#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(13bv32, 2bv32); {10958#true} is VALID [2022-02-20 23:47:33,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {10958#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:33,153 INFO L290 TraceCheckUtils]: 2: Hoare triple {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:33,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:33,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:33,156 INFO L290 TraceCheckUtils]: 5: Hoare triple {10966#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {10979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:33,156 INFO L290 TraceCheckUtils]: 6: Hoare triple {10979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {10979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:33,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {10979#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~root~0#1.base|)) (not (= |ULTIMATE.start_main_~root~0#1.base| |ULTIMATE.start_main_~s~0#1.base|)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~root~0#1.offset| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {10986#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv8 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))} is VALID [2022-02-20 23:47:33,159 INFO L290 TraceCheckUtils]: 8: Hoare triple {10986#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |ULTIMATE.start_main_~s~0#1.base|)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))) (_ bv8 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32)))))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:33,160 INFO L290 TraceCheckUtils]: 9: Hoare triple {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:33,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:47:33,161 INFO L290 TraceCheckUtils]: 11: Hoare triple {10990#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|))) (_ bv8 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |ULTIMATE.start_main_~st~0#1.base|)) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32)))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {11000#(and (= |ULTIMATE.start_main_#t~mem23#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem23#1.base|)))} is VALID [2022-02-20 23:47:33,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {11000#(and (= |ULTIMATE.start_main_#t~mem23#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem23#1.base|)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:33,165 INFO L290 TraceCheckUtils]: 13: Hoare triple {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume 0bv32 == main_~st~0#1.offset; {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:33,165 INFO L290 TraceCheckUtils]: 14: Hoare triple {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:33,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:33,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {11004#(and (= |ULTIMATE.start_main_~n~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~n~0#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, main_~n~0#1.offset), #length[main_~n~0#1.base]) && ~bvule32(main_~n~0#1.offset, ~bvadd32(4bv32, main_~n~0#1.offset))) && ~bvule32(0bv32, main_~n~0#1.offset)); {10959#false} is VALID [2022-02-20 23:47:33,166 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:47:33,167 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:33,167 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:33,167 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76727560] [2022-02-20 23:47:33,167 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76727560] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:33,167 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:33,167 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:33,167 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187234078] [2022-02-20 23:47:33,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:33,167 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:33,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:33,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:33,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:33,190 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:33,190 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:33,191 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:33,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=43, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:33,191 INFO L87 Difference]: Start difference. First operand 165 states and 193 transitions. Second operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,631 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2022-02-20 23:47:35,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:47:35,631 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:47:35,631 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2022-02-20 23:47:35,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 203 transitions. [2022-02-20 23:47:35,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 203 transitions. [2022-02-20 23:47:35,870 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:35,872 INFO L225 Difference]: With dead ends: 219 [2022-02-20 23:47:35,872 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 23:47:35,872 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 22 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=58, Invalid=182, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:47:35,872 INFO L933 BasicCegarLoop]: 43 mSDtfsCounter, 194 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 474 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 494 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:35,872 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 215 Invalid, 494 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 474 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:47:35,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 23:47:35,874 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 180. [2022-02-20 23:47:35,875 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:35,875 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,875 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,875 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,878 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,878 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2022-02-20 23:47:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 250 transitions. [2022-02-20 23:47:35,878 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:35,878 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:35,878 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 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 219 states. [2022-02-20 23:47:35,879 INFO L87 Difference]: Start difference. First operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 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 219 states. [2022-02-20 23:47:35,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:35,881 INFO L93 Difference]: Finished difference Result 219 states and 250 transitions. [2022-02-20 23:47:35,881 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 250 transitions. [2022-02-20 23:47:35,882 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:35,882 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:35,882 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:35,882 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:35,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 149 states have (on average 1.4093959731543624) internal successors, (210), 179 states have internal predecessors, (210), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 210 transitions. [2022-02-20 23:47:35,884 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 210 transitions. Word has length 17 [2022-02-20 23:47:35,884 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:35,884 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 210 transitions. [2022-02-20 23:47:35,884 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 8 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:35,884 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 210 transitions. [2022-02-20 23:47:35,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:35,885 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:35,885 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:35,907 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (19)] Ended with exit code 0 [2022-02-20 23:47:36,091 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:36,092 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:36,092 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:36,092 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705298, now seen corresponding path program 1 times [2022-02-20 23:47:36,092 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:36,092 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1330442082] [2022-02-20 23:47:36,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:36,092 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:36,092 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:36,093 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:36,095 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2022-02-20 23:47:36,169 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:36,172 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:36,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:36,183 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:36,189 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:47:36,228 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:47:36,237 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:36,237 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:47:36,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:47:36,293 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:47:36,368 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:36,369 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2022-02-20 23:47:36,373 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:47:36,402 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 23:47:36,411 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:36,428 INFO L290 TraceCheckUtils]: 0: Hoare triple {11869#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(13bv32, 2bv32); {11869#true} is VALID [2022-02-20 23:47:36,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {11869#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,429 INFO L290 TraceCheckUtils]: 2: Hoare triple {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,429 INFO L290 TraceCheckUtils]: 3: Hoare triple {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,430 INFO L290 TraceCheckUtils]: 4: Hoare triple {11877#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,430 INFO L290 TraceCheckUtils]: 5: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,430 INFO L290 TraceCheckUtils]: 6: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,431 INFO L290 TraceCheckUtils]: 7: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !main_#t~short7#1; {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,431 INFO L290 TraceCheckUtils]: 8: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,431 INFO L290 TraceCheckUtils]: 9: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:36,432 INFO L290 TraceCheckUtils]: 10: Hoare triple {11887#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32); {11906#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:36,433 INFO L290 TraceCheckUtils]: 11: Hoare triple {11906#(and (= (select |#length| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv8 32)) (= |ULTIMATE.start_main_#t~malloc13#1.offset| (_ bv0 32)) (not (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L545 {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:36,434 INFO L290 TraceCheckUtils]: 12: Hoare triple {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:36,434 INFO L290 TraceCheckUtils]: 13: Hoare triple {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L546 {11917#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:36,436 INFO L290 TraceCheckUtils]: 14: Hoare triple {11917#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4bv32); srcloc: L546-1 {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:36,436 INFO L290 TraceCheckUtils]: 15: Hoare triple {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:36,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {11910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (= (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L547 {11927#(and (= |ULTIMATE.start_main_#t~mem15#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)))} is VALID [2022-02-20 23:47:36,437 INFO L290 TraceCheckUtils]: 17: Hoare triple {11927#(and (= |ULTIMATE.start_main_#t~mem15#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem15#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem15#1.offset)), #length[main_#t~mem15#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem15#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem15#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem15#1.offset))); {11870#false} is VALID [2022-02-20 23:47:36,438 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:47:36,438 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:36,438 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:36,438 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1330442082] [2022-02-20 23:47:36,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1330442082] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:36,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:36,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:36,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602561060] [2022-02-20 23:47:36,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:36,439 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:36,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:36,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:36,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:36,458 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:36,458 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:36,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:36,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:36,459 INFO L87 Difference]: Start difference. First operand 180 states and 210 transitions. Second operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,294 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,295 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2022-02-20 23:47:38,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:38,295 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:38,295 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:38,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,296 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-02-20 23:47:38,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 116 transitions. [2022-02-20 23:47:38,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 116 transitions. [2022-02-20 23:47:38,405 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 116 edges. 116 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:38,406 INFO L225 Difference]: With dead ends: 182 [2022-02-20 23:47:38,407 INFO L226 Difference]: Without dead ends: 182 [2022-02-20 23:47:38,407 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:47:38,407 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 127 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 372 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 217 SdHoareTripleChecker+Invalid, 387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 372 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:38,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 217 Invalid, 387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 372 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:47:38,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 182 states. [2022-02-20 23:47:38,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 182 to 179. [2022-02-20 23:47:38,409 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:38,410 INFO L82 GeneralOperation]: Start isEquivalent. First operand 182 states. Second operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,410 INFO L74 IsIncluded]: Start isIncluded. First operand 182 states. Second operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,410 INFO L87 Difference]: Start difference. First operand 182 states. Second operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,412 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2022-02-20 23:47:38,412 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2022-02-20 23:47:38,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:38,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:38,412 INFO L74 IsIncluded]: Start isIncluded. First operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:38,413 INFO L87 Difference]: Start difference. First operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 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 182 states. [2022-02-20 23:47:38,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:38,414 INFO L93 Difference]: Finished difference Result 182 states and 211 transitions. [2022-02-20 23:47:38,414 INFO L276 IsEmpty]: Start isEmpty. Operand 182 states and 211 transitions. [2022-02-20 23:47:38,415 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:38,415 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:38,415 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:38,415 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:38,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 179 states, 149 states have (on average 1.395973154362416) internal successors, (208), 178 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,416 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 179 states to 179 states and 208 transitions. [2022-02-20 23:47:38,417 INFO L78 Accepts]: Start accepts. Automaton has 179 states and 208 transitions. Word has length 18 [2022-02-20 23:47:38,417 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:38,417 INFO L470 AbstractCegarLoop]: Abstraction has 179 states and 208 transitions. [2022-02-20 23:47:38,417 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.5714285714285716) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:38,417 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 208 transitions. [2022-02-20 23:47:38,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:47:38,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:38,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:38,439 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:38,624 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:38,624 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:38,625 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:38,625 INFO L85 PathProgramCache]: Analyzing trace with hash 1327705297, now seen corresponding path program 1 times [2022-02-20 23:47:38,625 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:38,625 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1402716084] [2022-02-20 23:47:38,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:38,625 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:38,626 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:38,626 INFO L229 MonitoredProcess]: Starting monitored process 21 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:38,629 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2022-02-20 23:47:38,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,715 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:38,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:38,758 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:38,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-02-20 23:47:38,898 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:47:38,898 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-02-20 23:47:38,989 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:47:39,168 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:39,168 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2022-02-20 23:47:39,251 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 25 [2022-02-20 23:47:39,345 INFO L290 TraceCheckUtils]: 0: Hoare triple {12669#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(13bv32, 2bv32); {12674#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:47:39,346 INFO L290 TraceCheckUtils]: 1: Hoare triple {12674#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:39,346 INFO L290 TraceCheckUtils]: 2: Hoare triple {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:39,347 INFO L290 TraceCheckUtils]: 3: Hoare triple {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:39,347 INFO L290 TraceCheckUtils]: 4: Hoare triple {12678#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,348 INFO L290 TraceCheckUtils]: 5: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,348 INFO L290 TraceCheckUtils]: 6: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,349 INFO L290 TraceCheckUtils]: 7: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume !main_#t~short7#1; {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,349 INFO L290 TraceCheckUtils]: 8: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,349 INFO L290 TraceCheckUtils]: 9: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:39,351 INFO L290 TraceCheckUtils]: 10: Hoare triple {12688#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume (main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1;call main_#t~malloc13#1.base, main_#t~malloc13#1.offset := #Ultimate.allocOnHeap(8bv32); {12707#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_#t~malloc13#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))) (not (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:39,357 INFO L290 TraceCheckUtils]: 11: Hoare triple {12707#(and (= (select |#valid| |ULTIMATE.start_main_#t~malloc13#1.base|) (_ bv1 1)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= |ULTIMATE.start_main_#t~malloc13#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))) (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))) (not (= |ULTIMATE.start_main_#t~malloc13#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L545 {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:39,359 INFO L290 TraceCheckUtils]: 12: Hoare triple {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} havoc main_#t~malloc13#1.base, main_#t~malloc13#1.offset; {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:39,362 INFO L290 TraceCheckUtils]: 13: Hoare triple {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L546 {12718#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:39,375 INFO L290 TraceCheckUtils]: 14: Hoare triple {12718#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_#t~mem14#1.base, main_#t~mem14#1.offset, 4bv32); srcloc: L546-1 {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:39,376 INFO L290 TraceCheckUtils]: 15: Hoare triple {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} havoc main_#t~mem14#1.base, main_#t~mem14#1.offset; {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} is VALID [2022-02-20 23:47:39,381 INFO L290 TraceCheckUtils]: 16: Hoare triple {12711#(and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) |ULTIMATE.start_main_~n~0#1.base|)) (exists ((v_arrayElimCell_25 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|) (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) |ULTIMATE.start_main_~n~0#1.offset|))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L547 {12728#(and (exists ((v_arrayElimCell_25 (_ BitVec 1)) (|ULTIMATE.start_main_~n~0#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (not (= |ULTIMATE.start_main_#t~mem15#1.base| |ULTIMATE.start_main_~n~0#1.base|)) (or (= |ULTIMATE.start_main_#t~mem15#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|)))} is VALID [2022-02-20 23:47:39,382 INFO L290 TraceCheckUtils]: 17: Hoare triple {12728#(and (exists ((v_arrayElimCell_25 (_ BitVec 1)) (|ULTIMATE.start_main_~n~0#1.base| (_ BitVec 32))) (and (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (or (= (_ bv0 1) v_arrayElimCell_25) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (not (= |ULTIMATE.start_main_#t~mem15#1.base| |ULTIMATE.start_main_~n~0#1.base|)) (or (= |ULTIMATE.start_main_#t~mem15#1.base| (_ bv0 32)) (= (bvadd (bvneg v_arrayElimCell_25) (select |#valid| (_ bv0 32))) (_ bv0 1))))) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|)))} assume !(1bv1 == #valid[main_#t~mem15#1.base]); {12670#false} is VALID [2022-02-20 23:47:39,382 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:47:39,382 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:39,382 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:39,382 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1402716084] [2022-02-20 23:47:39,382 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1402716084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:39,382 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:39,382 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:39,382 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1392529387] [2022-02-20 23:47:39,383 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:39,383 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:39,383 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:39,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:39,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:39,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:39,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:39,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:39,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:39,419 INFO L87 Difference]: Start difference. First operand 179 states and 208 transitions. Second operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,356 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-02-20 23:47:40,356 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:40,356 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:47:40,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,357 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-02-20 23:47:40,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 115 transitions. [2022-02-20 23:47:40,358 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 115 transitions. [2022-02-20 23:47:40,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 115 edges. 115 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:40,472 INFO L225 Difference]: With dead ends: 181 [2022-02-20 23:47:40,472 INFO L226 Difference]: Without dead ends: 181 [2022-02-20 23:47:40,472 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:47:40,472 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 221 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 419 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 286 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:40,472 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 212 Invalid, 419 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 286 Unchecked, 0.2s Time] [2022-02-20 23:47:40,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2022-02-20 23:47:40,474 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 178. [2022-02-20 23:47:40,475 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:40,475 INFO L82 GeneralOperation]: Start isEquivalent. First operand 181 states. Second operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,475 INFO L74 IsIncluded]: Start isIncluded. First operand 181 states. Second operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,475 INFO L87 Difference]: Start difference. First operand 181 states. Second operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,477 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-02-20 23:47:40,477 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2022-02-20 23:47:40,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:40,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:40,478 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 181 states. [2022-02-20 23:47:40,478 INFO L87 Difference]: Start difference. First operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 181 states. [2022-02-20 23:47:40,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:40,479 INFO L93 Difference]: Finished difference Result 181 states and 209 transitions. [2022-02-20 23:47:40,479 INFO L276 IsEmpty]: Start isEmpty. Operand 181 states and 209 transitions. [2022-02-20 23:47:40,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:40,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:40,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:40,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:40,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 149 states have (on average 1.3825503355704698) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2022-02-20 23:47:40,482 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 18 [2022-02-20 23:47:40,482 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:40,482 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2022-02-20 23:47:40,482 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.25) internal successors, (18), 8 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:40,482 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2022-02-20 23:47:40,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:47:40,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:40,483 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:40,496 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:40,689 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:40,689 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:40,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:40,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350413, now seen corresponding path program 1 times [2022-02-20 23:47:40,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:40,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [149201669] [2022-02-20 23:47:40,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:40,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:40,690 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:40,691 INFO L229 MonitoredProcess]: Starting monitored process 22 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:40,692 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2022-02-20 23:47:40,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:40,779 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 14 conjunts are in the unsatisfiable core [2022-02-20 23:47:40,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:40,790 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:40,811 INFO L356 Elim1Store]: treesize reduction 8, result has 60.0 percent of original size [2022-02-20 23:47:40,812 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 21 [2022-02-20 23:47:40,969 INFO L356 Elim1Store]: treesize reduction 38, result has 39.7 percent of original size [2022-02-20 23:47:40,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 26 treesize of output 43 [2022-02-20 23:47:41,046 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:41,244 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:41,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 51 [2022-02-20 23:47:41,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2022-02-20 23:47:41,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {13468#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(13bv32, 2bv32); {13473#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} is VALID [2022-02-20 23:47:41,512 INFO L290 TraceCheckUtils]: 1: Hoare triple {13473#(= (_ bv0 1) (select |#valid| (_ bv0 32)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,513 INFO L290 TraceCheckUtils]: 2: Hoare triple {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,513 INFO L290 TraceCheckUtils]: 3: Hoare triple {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,514 INFO L290 TraceCheckUtils]: 4: Hoare triple {13477#(and (or (= (_ bv0 1) (select |#valid| (_ bv0 32))) (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))) (= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,514 INFO L290 TraceCheckUtils]: 5: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,516 INFO L290 TraceCheckUtils]: 6: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,516 INFO L290 TraceCheckUtils]: 7: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume !main_#t~short7#1; {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,516 INFO L290 TraceCheckUtils]: 8: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,517 INFO L290 TraceCheckUtils]: 9: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,517 INFO L290 TraceCheckUtils]: 10: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume !((main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,520 INFO L290 TraceCheckUtils]: 11: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544-2 {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} is VALID [2022-02-20 23:47:41,522 INFO L290 TraceCheckUtils]: 12: Hoare triple {13487#(and (= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (or (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32)) (= (_ bv0 1) (select |#valid| (_ bv0 32)))))} assume (main_#t~mem16#1.base == 0bv32 && main_#t~mem16#1.offset == 0bv32) && 0bv32 != main_#t~nondet17#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1;call main_#t~malloc18#1.base, main_#t~malloc18#1.offset := #Ultimate.allocOnHeap(8bv32); {13512#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_#t~malloc18#1.base| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~malloc18#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc18#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:41,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {13512#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= |ULTIMATE.start_main_#t~malloc18#1.base| (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (= (_ bv1 1) (select |#valid| |ULTIMATE.start_main_#t~malloc18#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc18#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L550 {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,531 INFO L290 TraceCheckUtils]: 14: Hoare triple {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} havoc main_#t~malloc18#1.base, main_#t~malloc18#1.offset; {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L551 {13523#(and (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {13523#(and (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_#t~mem19#1.base, main_#t~mem19#1.offset, 4bv32); srcloc: L551-1 {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,545 INFO L290 TraceCheckUtils]: 17: Hoare triple {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,549 INFO L290 TraceCheckUtils]: 18: Hoare triple {13516#(and (exists ((v_arrayElimCell_31 (_ BitVec 1))) (and (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))) (or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31)))))) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv1 1)))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L552 {13533#(and (exists ((|ULTIMATE.start_main_~n~0#1.base| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 1))) (and (not (= |ULTIMATE.start_main_#t~mem20#1.base| |ULTIMATE.start_main_~n~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31))) (= |ULTIMATE.start_main_#t~mem20#1.base| (_ bv0 32))) (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:47:41,549 INFO L290 TraceCheckUtils]: 19: Hoare triple {13533#(and (exists ((|ULTIMATE.start_main_~n~0#1.base| (_ BitVec 32)) (v_arrayElimCell_31 (_ BitVec 1))) (and (not (= |ULTIMATE.start_main_#t~mem20#1.base| |ULTIMATE.start_main_~n~0#1.base|)) (= (bvneg (select |#valid| |ULTIMATE.start_main_~n~0#1.base|)) (_ bv1 1)) (or (= (_ bv0 1) (bvadd (select |#valid| (_ bv0 32)) (bvneg v_arrayElimCell_31))) (= |ULTIMATE.start_main_#t~mem20#1.base| (_ bv0 32))) (or (= (_ bv0 1) v_arrayElimCell_31) (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))) (= (select |#valid| |ULTIMATE.start_main_#t~mem20#1.base|) (_ bv1 1)))} assume !(1bv1 == #valid[main_#t~mem20#1.base]); {13469#false} is VALID [2022-02-20 23:47:41,549 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:47:41,549 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:41,550 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:41,550 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [149201669] [2022-02-20 23:47:41,550 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [149201669] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:41,550 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:41,550 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:41,550 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [157637383] [2022-02-20 23:47:41,550 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:41,550 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:47:41,550 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:41,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:41,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:41,592 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:41,592 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:41,593 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:41,593 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:41,593 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,541 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2022-02-20 23:47:42,541 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:42,541 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:47:42,541 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:42,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 23:47:42,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 114 transitions. [2022-02-20 23:47:42,542 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 114 transitions. [2022-02-20 23:47:42,664 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:42,665 INFO L225 Difference]: With dead ends: 180 [2022-02-20 23:47:42,665 INFO L226 Difference]: Without dead ends: 180 [2022-02-20 23:47:42,665 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=83, Invalid=189, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:47:42,666 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 218 mSDsluCounter, 135 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 212 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:42,666 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 176 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 109 Invalid, 0 Unknown, 212 Unchecked, 0.2s Time] [2022-02-20 23:47:42,666 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 180 states. [2022-02-20 23:47:42,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 180 to 177. [2022-02-20 23:47:42,668 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:42,668 INFO L82 GeneralOperation]: Start isEquivalent. First operand 180 states. Second operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,669 INFO L74 IsIncluded]: Start isIncluded. First operand 180 states. Second operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,669 INFO L87 Difference]: Start difference. First operand 180 states. Second operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,670 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,670 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2022-02-20 23:47:42,670 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2022-02-20 23:47:42,671 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,671 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,671 INFO L74 IsIncluded]: Start isIncluded. First operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 180 states. [2022-02-20 23:47:42,671 INFO L87 Difference]: Start difference. First operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 180 states. [2022-02-20 23:47:42,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:42,673 INFO L93 Difference]: Finished difference Result 180 states and 208 transitions. [2022-02-20 23:47:42,673 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2022-02-20 23:47:42,673 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:42,673 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:42,673 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:42,673 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:42,674 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 177 states, 149 states have (on average 1.3758389261744965) internal successors, (205), 176 states have internal predecessors, (205), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 177 states to 177 states and 205 transitions. [2022-02-20 23:47:42,675 INFO L78 Accepts]: Start accepts. Automaton has 177 states and 205 transitions. Word has length 20 [2022-02-20 23:47:42,675 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:42,675 INFO L470 AbstractCegarLoop]: Abstraction has 177 states and 205 transitions. [2022-02-20 23:47:42,675 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:42,676 INFO L276 IsEmpty]: Start isEmpty. Operand 177 states and 205 transitions. [2022-02-20 23:47:42,676 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:47:42,676 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:42,676 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:42,683 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:42,883 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:42,883 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:42,883 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:42,884 INFO L85 PathProgramCache]: Analyzing trace with hash -1866350412, now seen corresponding path program 1 times [2022-02-20 23:47:42,884 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:42,884 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [918741871] [2022-02-20 23:47:42,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:42,884 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:42,884 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:42,885 INFO L229 MonitoredProcess]: Starting monitored process 23 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:42,885 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2022-02-20 23:47:42,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:42,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 125 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:47:42,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:42,980 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:42,999 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:47:43,055 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:47:43,055 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:47:43,061 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:47:43,095 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:43,103 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 13 treesize of output 9 [2022-02-20 23:47:43,183 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 23:47:43,183 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 45 [2022-02-20 23:47:43,188 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 22 treesize of output 24 [2022-02-20 23:47:43,219 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 23:47:43,222 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2022-02-20 23:47:43,247 INFO L290 TraceCheckUtils]: 0: Hoare triple {14269#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(13bv32, 2bv32); {14269#true} is VALID [2022-02-20 23:47:43,248 INFO L290 TraceCheckUtils]: 1: Hoare triple {14269#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,248 INFO L290 TraceCheckUtils]: 2: Hoare triple {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,249 INFO L290 TraceCheckUtils]: 3: Hoare triple {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,249 INFO L290 TraceCheckUtils]: 4: Hoare triple {14277#(= (select |#valid| |ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1;main_~n~0#1.base, main_~n~0#1.offset := main_~root~0#1.base, main_~root~0#1.offset; {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem5#1.base, main_#t~mem5#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L539-2 {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} main_#t~short7#1 := main_#t~mem5#1.base != 0bv32 || main_#t~mem5#1.offset != 0bv32; {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,250 INFO L290 TraceCheckUtils]: 7: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !main_#t~short7#1; {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,250 INFO L290 TraceCheckUtils]: 8: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !main_#t~short7#1;havoc main_#t~mem5#1.base, main_#t~mem5#1.offset;havoc main_#t~mem6#1.base, main_#t~mem6#1.offset;havoc main_#t~short7#1; {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,251 INFO L290 TraceCheckUtils]: 9: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L538-8 {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,251 INFO L290 TraceCheckUtils]: 10: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume !((main_#t~mem11#1.base == 0bv32 && main_#t~mem11#1.offset == 0bv32) && 0bv32 != main_#t~nondet12#1);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset;havoc main_#t~nondet12#1; {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,251 INFO L290 TraceCheckUtils]: 11: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L544-2 {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:47:43,252 INFO L290 TraceCheckUtils]: 12: Hoare triple {14287#(= (select |#valid| |ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))} assume (main_#t~mem16#1.base == 0bv32 && main_#t~mem16#1.offset == 0bv32) && 0bv32 != main_#t~nondet17#1;havoc main_#t~mem16#1.base, main_#t~mem16#1.offset;havoc main_#t~nondet17#1;call main_#t~malloc18#1.base, main_#t~malloc18#1.offset := #Ultimate.allocOnHeap(8bv32); {14312#(and (= |ULTIMATE.start_main_#t~malloc18#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc18#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc18#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} is VALID [2022-02-20 23:47:43,254 INFO L290 TraceCheckUtils]: 13: Hoare triple {14312#(and (= |ULTIMATE.start_main_#t~malloc18#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~malloc18#1.base|)) (not (= |ULTIMATE.start_main_#t~malloc18#1.base| |ULTIMATE.start_main_~n~0#1.base|)))} SUMMARY for call write~$Pointer$(main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L550 {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:43,255 INFO L290 TraceCheckUtils]: 14: Hoare triple {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} havoc main_#t~malloc18#1.base, main_#t~malloc18#1.offset; {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:43,255 INFO L290 TraceCheckUtils]: 15: Hoare triple {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} SUMMARY for call main_#t~mem19#1.base, main_#t~mem19#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L551 {14323#(and (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:43,257 INFO L290 TraceCheckUtils]: 16: Hoare triple {14323#(and (= |ULTIMATE.start_main_#t~mem19#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_#t~mem19#1.base, main_#t~mem19#1.offset, 4bv32); srcloc: L551-1 {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:43,257 INFO L290 TraceCheckUtils]: 17: Hoare triple {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} havoc main_#t~mem19#1.base, main_#t~mem19#1.offset; {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} is VALID [2022-02-20 23:47:43,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {14316#(and (not (= |ULTIMATE.start_main_~n~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|)) (_ bv0 32)) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~n~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~n~0#1.offset|))) (_ bv8 32)))} SUMMARY for call main_#t~mem20#1.base, main_#t~mem20#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L552 {14333#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:43,258 INFO L290 TraceCheckUtils]: 19: Hoare triple {14333#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem20#1.base|)) (= |ULTIMATE.start_main_#t~mem20#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem20#1.offset)), #length[main_#t~mem20#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem20#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem20#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem20#1.offset))); {14270#false} is VALID [2022-02-20 23:47:43,258 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:47:43,259 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:43,259 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:43,259 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [918741871] [2022-02-20 23:47:43,259 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [918741871] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:43,259 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:43,259 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:43,259 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322595312] [2022-02-20 23:47:43,259 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:43,260 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:47:43,260 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:43,260 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:43,282 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:43,282 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:47:43,282 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:43,283 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:47:43,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:47:43,283 INFO L87 Difference]: Start difference. First operand 177 states and 205 transitions. Second operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,750 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2022-02-20 23:47:44,750 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:47:44,750 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:47:44,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-02-20 23:47:44,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 113 transitions. [2022-02-20 23:47:44,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 113 transitions. [2022-02-20 23:47:44,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:44,857 INFO L225 Difference]: With dead ends: 179 [2022-02-20 23:47:44,857 INFO L226 Difference]: Without dead ends: 179 [2022-02-20 23:47:44,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=62, Invalid=148, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:47:44,858 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 117 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 297 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 117 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 297 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:44,858 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [117 Valid, 184 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 297 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:44,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2022-02-20 23:47:44,860 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 176. [2022-02-20 23:47:44,860 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:44,860 INFO L82 GeneralOperation]: Start isEquivalent. First operand 179 states. Second operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,861 INFO L74 IsIncluded]: Start isIncluded. First operand 179 states. Second operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,861 INFO L87 Difference]: Start difference. First operand 179 states. Second operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,862 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2022-02-20 23:47:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2022-02-20 23:47:44,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:44,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:44,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 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 179 states. [2022-02-20 23:47:44,863 INFO L87 Difference]: Start difference. First operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 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 179 states. [2022-02-20 23:47:44,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:44,865 INFO L93 Difference]: Finished difference Result 179 states and 207 transitions. [2022-02-20 23:47:44,865 INFO L276 IsEmpty]: Start isEmpty. Operand 179 states and 207 transitions. [2022-02-20 23:47:44,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:44,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:44,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:44,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:44,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 176 states, 149 states have (on average 1.3691275167785235) internal successors, (204), 175 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 176 states to 176 states and 204 transitions. [2022-02-20 23:47:44,867 INFO L78 Accepts]: Start accepts. Automaton has 176 states and 204 transitions. Word has length 20 [2022-02-20 23:47:44,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:44,867 INFO L470 AbstractCegarLoop]: Abstraction has 176 states and 204 transitions. [2022-02-20 23:47:44,867 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.857142857142857) internal successors, (20), 8 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:44,867 INFO L276 IsEmpty]: Start isEmpty. Operand 176 states and 204 transitions. [2022-02-20 23:47:44,867 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:47:44,867 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:44,868 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:44,877 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:45,074 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:45,075 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:45,075 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:45,075 INFO L85 PathProgramCache]: Analyzing trace with hash 428836918, now seen corresponding path program 1 times [2022-02-20 23:47:45,075 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:45,075 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [42990017] [2022-02-20 23:47:45,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:45,075 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:45,075 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:45,076 INFO L229 MonitoredProcess]: Starting monitored process 24 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:45,077 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2022-02-20 23:47:45,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:45,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:47:45,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:45,165 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:45,257 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:47:45,330 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-20 23:47:45,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {15063#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(13bv32, 2bv32); {15068#(bvult (_ bv0 32) |#StackHeapBarrier|)} is VALID [2022-02-20 23:47:45,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {15068#(bvult (_ bv0 32) |#StackHeapBarrier|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,410 INFO L290 TraceCheckUtils]: 2: Hoare triple {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {15072#(and (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {15085#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {15085#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {15085#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,418 INFO L290 TraceCheckUtils]: 7: Hoare triple {15085#(and (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult |ULTIMATE.start_main_~root~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~root~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {15092#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) (_ bv0 32))) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:47:45,425 INFO L290 TraceCheckUtils]: 8: Hoare triple {15092#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) (_ bv0 32))) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) (bvadd |ULTIMATE.start_main_~s~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:45,426 INFO L290 TraceCheckUtils]: 9: Hoare triple {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:45,426 INFO L290 TraceCheckUtils]: 10: Hoare triple {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} is VALID [2022-02-20 23:47:45,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {15096#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) |#StackHeapBarrier|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~st~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~st~0#1.offset|)) (_ bv0 32))) (= (_ bv0 32) |ULTIMATE.start_main_~st~0#1.offset|))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {15106#(and (bvult |ULTIMATE.start_main_#t~mem23#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_#t~mem23#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,427 INFO L290 TraceCheckUtils]: 12: Hoare triple {15106#(and (bvult |ULTIMATE.start_main_#t~mem23#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_#t~mem23#1.base| (_ bv0 32))))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,427 INFO L290 TraceCheckUtils]: 13: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume 0bv32 == main_~st~0#1.offset; {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,428 INFO L290 TraceCheckUtils]: 14: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,428 INFO L290 TraceCheckUtils]: 15: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,428 INFO L290 TraceCheckUtils]: 16: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L564 {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,429 INFO L290 TraceCheckUtils]: 17: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume !(main_#t~mem24#1.base != 0bv32 || main_#t~mem24#1.offset != 0bv32);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,429 INFO L290 TraceCheckUtils]: 18: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L564-3 {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,430 INFO L290 TraceCheckUtils]: 19: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume !(main_#t~mem27#1.base != 0bv32 || main_#t~mem27#1.offset != 0bv32);havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,430 INFO L290 TraceCheckUtils]: 20: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume 0bv32 == main_~n~0#1.offset; {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:47:45,430 INFO L290 TraceCheckUtils]: 21: Hoare triple {15110#(and (bvult |ULTIMATE.start_main_~n~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_main_~n~0#1.base| (_ bv0 32))))} assume !~bvult32(main_~n~0#1.base, #StackHeapBarrier); {15064#false} is VALID [2022-02-20 23:47:45,430 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:47:45,431 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:47:45,431 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:45,431 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [42990017] [2022-02-20 23:47:45,431 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [42990017] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:47:45,431 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:47:45,431 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:47:45,431 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549728324] [2022-02-20 23:47:45,431 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:47:45,432 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:45,432 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:45,432 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:45,458 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:45,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:47:45,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:45,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:47:45,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:47:45,459 INFO L87 Difference]: Start difference. First operand 176 states and 204 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:47,587 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2022-02-20 23:47:47,587 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:47:47,587 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:47:47,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:47,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2022-02-20 23:47:47,588 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 188 transitions. [2022-02-20 23:47:47,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 188 transitions. [2022-02-20 23:47:47,804 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 188 edges. 188 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:47,806 INFO L225 Difference]: With dead ends: 209 [2022-02-20 23:47:47,806 INFO L226 Difference]: Without dead ends: 209 [2022-02-20 23:47:47,806 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 24 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=80, Invalid=192, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:47:47,806 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 268 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 296 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 268 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 306 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 296 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:47,806 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [268 Valid, 324 Invalid, 306 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 296 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:47:47,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 209 states. [2022-02-20 23:47:47,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 209 to 178. [2022-02-20 23:47:47,808 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:47,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 209 states. Second operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,809 INFO L74 IsIncluded]: Start isIncluded. First operand 209 states. Second operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,809 INFO L87 Difference]: Start difference. First operand 209 states. Second operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:47,811 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2022-02-20 23:47:47,811 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2022-02-20 23:47:47,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:47,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:47,812 INFO L74 IsIncluded]: Start isIncluded. First operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states. [2022-02-20 23:47:47,812 INFO L87 Difference]: Start difference. First operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 209 states. [2022-02-20 23:47:47,814 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:47,814 INFO L93 Difference]: Finished difference Result 209 states and 240 transitions. [2022-02-20 23:47:47,814 INFO L276 IsEmpty]: Start isEmpty. Operand 209 states and 240 transitions. [2022-02-20 23:47:47,814 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:47,814 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:47,814 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:47,814 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:47,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 178 states, 151 states have (on average 1.3642384105960266) internal successors, (206), 177 states have internal predecessors, (206), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 178 states to 178 states and 206 transitions. [2022-02-20 23:47:47,816 INFO L78 Accepts]: Start accepts. Automaton has 178 states and 206 transitions. Word has length 22 [2022-02-20 23:47:47,816 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:47,816 INFO L470 AbstractCegarLoop]: Abstraction has 178 states and 206 transitions. [2022-02-20 23:47:47,816 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 8 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:47,816 INFO L276 IsEmpty]: Start isEmpty. Operand 178 states and 206 transitions. [2022-02-20 23:47:47,817 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:47:47,817 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:47,817 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:47,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (24)] Forceful destruction successful, exit code 0 [2022-02-20 23:47:48,024 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:48,024 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:48,024 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:48,024 INFO L85 PathProgramCache]: Analyzing trace with hash -2046866841, now seen corresponding path program 1 times [2022-02-20 23:47:48,025 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:48,025 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2113557764] [2022-02-20 23:47:48,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:48,025 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:48,025 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:48,026 INFO L229 MonitoredProcess]: Starting monitored process 25 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:48,026 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Waiting until timeout for monitored process [2022-02-20 23:47:48,117 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:48,121 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:47:48,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:48,131 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:48,147 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:47:48,151 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:47:48,177 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 23:47:48,177 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:47:48,182 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:47:48,184 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:47:48,202 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:48,204 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 0: Hoare triple {15958#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(13bv32, 2bv32); {15958#true} is VALID [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 1: Hoare triple {15958#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {15958#true} is VALID [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 2: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {15958#true} is VALID [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 3: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {15958#true} is VALID [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 4: Hoare triple {15958#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {15958#true} is VALID [2022-02-20 23:47:48,289 INFO L290 TraceCheckUtils]: 5: Hoare triple {15958#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {15958#true} is VALID [2022-02-20 23:47:48,291 INFO L290 TraceCheckUtils]: 6: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,293 INFO L290 TraceCheckUtils]: 7: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {15991#(and (= |ULTIMATE.start_main_#t~mem22#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {15991#(and (= |ULTIMATE.start_main_#t~mem22#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,295 INFO L290 TraceCheckUtils]: 12: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~st~0#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,296 INFO L290 TraceCheckUtils]: 15: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L564 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !(main_#t~mem24#1.base != 0bv32 || main_#t~mem24#1.offset != 0bv32);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,298 INFO L290 TraceCheckUtils]: 18: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L564-3 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !(main_#t~mem27#1.base != 0bv32 || main_#t~mem27#1.offset != 0bv32);havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,298 INFO L290 TraceCheckUtils]: 20: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~n~0#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,299 INFO L290 TraceCheckUtils]: 21: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume ~bvult32(main_~n~0#1.base, #StackHeapBarrier); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,299 INFO L290 TraceCheckUtils]: 22: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~n~0#1.base || 1bv1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,300 INFO L290 TraceCheckUtils]: 23: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15959#false} is VALID [2022-02-20 23:47:48,300 INFO L290 TraceCheckUtils]: 24: Hoare triple {15959#false} assume !(1bv1 == #valid[main_~s~0#1.base]); {15959#false} is VALID [2022-02-20 23:47:48,300 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:48,300 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:47:48,421 INFO L290 TraceCheckUtils]: 24: Hoare triple {15959#false} assume !(1bv1 == #valid[main_~s~0#1.base]); {15959#false} is VALID [2022-02-20 23:47:48,422 INFO L290 TraceCheckUtils]: 23: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15959#false} is VALID [2022-02-20 23:47:48,422 INFO L290 TraceCheckUtils]: 22: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~n~0#1.base || 1bv1 == #valid[main_~n~0#1.base];call ULTIMATE.dealloc(main_~n~0#1.base, main_~n~0#1.offset); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume ~bvult32(main_~n~0#1.base, #StackHeapBarrier); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~n~0#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,423 INFO L290 TraceCheckUtils]: 19: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !(main_#t~mem27#1.base != 0bv32 || main_#t~mem27#1.offset != 0bv32);havoc main_#t~mem27#1.base, main_#t~mem27#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,424 INFO L290 TraceCheckUtils]: 18: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem27#1.base, main_#t~mem27#1.offset := read~$Pointer$(main_~n~0#1.base, ~bvadd32(4bv32, main_~n~0#1.offset), 4bv32); srcloc: L564-3 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,424 INFO L290 TraceCheckUtils]: 17: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume !(main_#t~mem24#1.base != 0bv32 || main_#t~mem24#1.offset != 0bv32);havoc main_#t~mem24#1.base, main_#t~mem24#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,425 INFO L290 TraceCheckUtils]: 16: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem24#1.base, main_#t~mem24#1.offset := read~$Pointer$(main_~n~0#1.base, main_~n~0#1.offset, 4bv32); srcloc: L564 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,425 INFO L290 TraceCheckUtils]: 15: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~st~0#1.base || 1bv1 == #valid[main_~st~0#1.base];call ULTIMATE.dealloc(main_~st~0#1.base, main_~st~0#1.offset); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,426 INFO L290 TraceCheckUtils]: 14: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume ~bvult32(main_~st~0#1.base, #StackHeapBarrier); {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,426 INFO L290 TraceCheckUtils]: 13: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} assume 0bv32 == main_~st~0#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,426 INFO L290 TraceCheckUtils]: 12: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} main_~n~0#1.base, main_~n~0#1.offset := main_#t~mem23#1.base, main_#t~mem23#1.offset;havoc main_#t~mem23#1.base, main_#t~mem23#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,427 INFO L290 TraceCheckUtils]: 11: Hoare triple {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} SUMMARY for call main_#t~mem23#1.base, main_#t~mem23#1.offset := read~$Pointer$(main_~st~0#1.base, ~bvadd32(4bv32, main_~st~0#1.offset), 4bv32); srcloc: L562 {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,427 INFO L290 TraceCheckUtils]: 10: Hoare triple {15991#(and (= |ULTIMATE.start_main_#t~mem22#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} main_~s~0#1.base, main_~s~0#1.offset := main_#t~mem22#1.base, main_#t~mem22#1.offset;havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {15995#(and (= |ULTIMATE.start_main_~s~0#1.base| (_ bv0 32)) (= |ULTIMATE.start_main_~s~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L561 {15991#(and (= |ULTIMATE.start_main_#t~mem22#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_#t~mem22#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:47:48,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} assume !!(main_~s~0#1.base != 0bv32 || main_~s~0#1.offset != 0bv32);main_~st~0#1.base, main_~st~0#1.offset := main_~s~0#1.base, main_~s~0#1.offset; {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,430 INFO L290 TraceCheckUtils]: 7: Hoare triple {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~root~0#1.base, main_~root~0#1.offset, main_~s~0#1.base, ~bvadd32(4bv32, main_~s~0#1.offset), 4bv32); srcloc: L557-1 {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 6: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~s~0#1.base, main_~s~0#1.offset, 4bv32); srcloc: L557 {15981#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~s~0#1.base|) |ULTIMATE.start_main_~s~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 5: Hoare triple {15958#true} main_~n~0#1.base, main_~n~0#1.offset := 0bv32, 0bv32;call main_#t~malloc21#1.base, main_#t~malloc21#1.offset := #Ultimate.allocOnHeap(8bv32);main_~s~0#1.base, main_~s~0#1.offset := main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_#t~malloc21#1.base, main_#t~malloc21#1.offset;havoc main_~st~0#1.base, main_~st~0#1.offset; {15958#true} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 4: Hoare triple {15958#true} assume !(0bv32 != main_#t~nondet4#1);havoc main_#t~nondet4#1; {15958#true} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 3: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, ~bvadd32(4bv32, main_~root~0#1.offset), 4bv32); srcloc: L534-1 {15958#true} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 2: Hoare triple {15958#true} SUMMARY for call write~$Pointer$(0bv32, 0bv32, main_~root~0#1.base, main_~root~0#1.offset, 4bv32); srcloc: L534 {15958#true} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {15958#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset, main_#t~nondet8#1, main_#t~mem9#1.base, main_#t~mem9#1.offset, main_#t~mem10#1.base, main_#t~mem10#1.offset, main_#t~mem5#1.base, main_#t~mem5#1.offset, main_#t~mem6#1.base, main_#t~mem6#1.offset, main_#t~short7#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~nondet12#1, main_#t~malloc13#1.base, main_#t~malloc13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_#t~nondet17#1, main_#t~malloc18#1.base, main_#t~malloc18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~nondet4#1, main_#t~malloc21#1.base, main_#t~malloc21#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_#t~mem23#1.base, main_#t~mem23#1.offset, main_#t~mem24#1.base, main_#t~mem24#1.offset, main_#t~malloc25#1.base, main_#t~malloc25#1.offset, main_#t~mem26#1.base, main_#t~mem26#1.offset, main_#t~mem27#1.base, main_#t~mem27#1.offset, main_#t~malloc28#1.base, main_#t~malloc28#1.offset, main_#t~mem29#1.base, main_#t~mem29#1.offset, main_~root~0#1.base, main_~root~0#1.offset, main_~n~0#1.base, main_~n~0#1.offset, main_~s~0#1.base, main_~s~0#1.offset, main_~st~0#1.base, main_~st~0#1.offset;call main_#t~malloc3#1.base, main_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);main_~root~0#1.base, main_~root~0#1.offset := main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_#t~malloc3#1.base, main_#t~malloc3#1.offset;havoc main_~n~0#1.base, main_~n~0#1.offset; {15958#true} is VALID [2022-02-20 23:47:48,432 INFO L290 TraceCheckUtils]: 0: Hoare triple {15958#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(13bv32, 2bv32); {15958#true} is VALID [2022-02-20 23:47:48,433 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:47:48,433 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:47:48,433 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2113557764] [2022-02-20 23:47:48,433 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2113557764] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:47:48,433 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:47:48,433 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 5 [2022-02-20 23:47:48,434 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2057822810] [2022-02-20 23:47:48,434 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:47:48,434 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:48,435 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:47:48,435 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:48,459 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:48,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:47:48,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:47:48,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:47:48,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:47:48,460 INFO L87 Difference]: Start difference. First operand 178 states and 206 transitions. Second operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,227 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,227 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:47:49,227 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:47:49,228 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:47:49,228 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:47:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-02-20 23:47:49,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 127 transitions. [2022-02-20 23:47:49,229 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 127 transitions. [2022-02-20 23:47:49,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:47:49,338 INFO L225 Difference]: With dead ends: 185 [2022-02-20 23:47:49,338 INFO L226 Difference]: Without dead ends: 185 [2022-02-20 23:47:49,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:47:49,338 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 13 mSDsluCounter, 234 mSDsCounter, 0 mSdLazyCounter, 65 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 326 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 65 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:47:49,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 326 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 65 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:47:49,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 185 states. [2022-02-20 23:47:49,340 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 185 to 180. [2022-02-20 23:47:49,340 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:47:49,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 185 states. Second operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,341 INFO L74 IsIncluded]: Start isIncluded. First operand 185 states. Second operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,341 INFO L87 Difference]: Start difference. First operand 185 states. Second operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,342 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,343 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:47:49,343 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2022-02-20 23:47:49,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:49,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:49,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:47:49,343 INFO L87 Difference]: Start difference. First operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 185 states. [2022-02-20 23:47:49,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:47:49,345 INFO L93 Difference]: Finished difference Result 185 states and 212 transitions. [2022-02-20 23:47:49,345 INFO L276 IsEmpty]: Start isEmpty. Operand 185 states and 212 transitions. [2022-02-20 23:47:49,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:47:49,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:47:49,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:47:49,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:47:49,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 180 states, 153 states have (on average 1.3594771241830066) internal successors, (208), 179 states have internal predecessors, (208), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 180 states to 180 states and 208 transitions. [2022-02-20 23:47:49,347 INFO L78 Accepts]: Start accepts. Automaton has 180 states and 208 transitions. Word has length 25 [2022-02-20 23:47:49,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:47:49,347 INFO L470 AbstractCegarLoop]: Abstraction has 180 states and 208 transitions. [2022-02-20 23:47:49,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.0) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:47:49,348 INFO L276 IsEmpty]: Start isEmpty. Operand 180 states and 208 transitions. [2022-02-20 23:47:49,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:47:49,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:47:49,348 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:47:49,355 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (25)] Ended with exit code 0 [2022-02-20 23:47:49,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:47:49,555 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:47:49,555 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:47:49,555 INFO L85 PathProgramCache]: Analyzing trace with hash 971637501, now seen corresponding path program 1 times [2022-02-20 23:47:49,555 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:47:49,555 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1953414730] [2022-02-20 23:47:49,555 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:47:49,556 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:47:49,556 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:47:49,556 INFO L229 MonitoredProcess]: Starting monitored process 26 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:47:49,557 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (26)] Waiting until timeout for monitored process [2022-02-20 23:47:49,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:49,668 INFO L263 TraceCheckSpWp]: Trace formula consists of 134 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:47:49,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:47:49,677 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:47:49,774 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 13 treesize of output 9 [2022-02-20 23:47:49,883 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27