./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/20051113-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/20051113-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2a43a02844acf962bfa6f77d0e1512c06ac1cc2fb3c3905e584a292a069b5426 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:43:41,201 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:43:41,203 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:43:41,227 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:43:41,227 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:43:41,229 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:43:41,230 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:43:41,231 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:43:41,233 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:43:41,234 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:43:41,235 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:43:41,236 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:43:41,237 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:43:41,238 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:43:41,239 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:43:41,240 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:43:41,241 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:43:41,241 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:43:41,243 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:43:41,245 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:43:41,246 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:43:41,248 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:43:41,249 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:43:41,250 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:43:41,252 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:43:41,252 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:43:41,253 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:43:41,254 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:43:41,254 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:43:41,255 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:43:41,255 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:43:41,256 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:43:41,257 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:43:41,257 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:43:41,258 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:43:41,259 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:43:41,259 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:43:41,260 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:43:41,260 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:43:41,261 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:43:41,262 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:43:41,262 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:43:41,280 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:43:41,281 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:43:41,281 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:43:41,281 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:43:41,282 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:43:41,282 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:43:41,283 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:43:41,283 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:43:41,283 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:43:41,284 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:43:41,284 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:43:41,284 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:43:41,284 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:43:41,285 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:43:41,285 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:43:41,285 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:43:41,285 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:43:41,286 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:43:41,286 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:43:41,286 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:43:41,286 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:43:41,287 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:43:41,289 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:43:41,290 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:43:41,290 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:43:41,290 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:41,290 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:43:41,291 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:43:41,291 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:43:41,292 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:43:41,292 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 -> 2a43a02844acf962bfa6f77d0e1512c06ac1cc2fb3c3905e584a292a069b5426 [2022-02-20 23:43:41,548 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:43:41,566 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:43:41,567 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:43:41,568 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:43:41,571 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:43:41,572 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/20051113-1.i [2022-02-20 23:43:41,626 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be38eaa29/dbcbb5c97a074c58a9dd0dacf373842f/FLAGc7c6c740c [2022-02-20 23:43:42,127 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:43:42,128 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/20051113-1.i [2022-02-20 23:43:42,148 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be38eaa29/dbcbb5c97a074c58a9dd0dacf373842f/FLAGc7c6c740c [2022-02-20 23:43:42,450 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/be38eaa29/dbcbb5c97a074c58a9dd0dacf373842f [2022-02-20 23:43:42,452 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:43:42,454 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:43:42,457 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:42,457 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:43:42,461 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:43:42,462 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:42,463 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@78ca7ae and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42, skipping insertion in model container [2022-02-20 23:43:42,463 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:42,472 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:43:42,513 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:43:42,888 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:42,899 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:43:42,956 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:43:42,986 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:43:42,986 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42 WrapperNode [2022-02-20 23:43:42,987 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:43:42,988 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:42,988 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:43:42,988 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:43:42,995 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:43:42" (1/1) ... [2022-02-20 23:43:43,023 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:43:42" (1/1) ... [2022-02-20 23:43:43,056 INFO L137 Inliner]: procedures = 125, calls = 23, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 77 [2022-02-20 23:43:43,057 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:43:43,058 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:43:43,059 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:43:43,059 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:43:43,066 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,066 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,074 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,074 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,092 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,096 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,101 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,103 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:43:43,106 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:43:43,106 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:43:43,106 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:43:43,107 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (1/1) ... [2022-02-20 23:43:43,114 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:43:43,124 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:43,141 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:43:43,152 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:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:43:43,182 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:43:43,183 INFO L130 BoogieDeclarations]: Found specification of procedure dummy_abort [2022-02-20 23:43:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure dummy_abort [2022-02-20 23:43:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:43:43,184 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:43:43,184 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:43:43,286 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:43:43,288 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:43:43,671 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:43:43,677 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:43:43,677 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:43:43,678 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:43 BoogieIcfgContainer [2022-02-20 23:43:43,679 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:43:43,680 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:43:43,680 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:43:43,688 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:43:43,688 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:43:42" (1/3) ... [2022-02-20 23:43:43,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265b553b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:43, skipping insertion in model container [2022-02-20 23:43:43,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:43:42" (2/3) ... [2022-02-20 23:43:43,689 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@265b553b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:43:43, skipping insertion in model container [2022-02-20 23:43:43,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:43:43" (3/3) ... [2022-02-20 23:43:43,690 INFO L111 eAbstractionObserver]: Analyzing ICFG 20051113-1.i [2022-02-20 23:43:43,695 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:43:43,695 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 25 error locations. [2022-02-20 23:43:43,742 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:43:43,749 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:43:43,749 INFO L340 AbstractCegarLoop]: Starting to check reachability of 25 error locations. [2022-02-20 23:43:43,765 INFO L276 IsEmpty]: Start isEmpty. Operand has 64 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:43,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2022-02-20 23:43:43,769 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:43,770 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1] [2022-02-20 23:43:43,771 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:43,775 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:43,776 INFO L85 PathProgramCache]: Analyzing trace with hash 30849, now seen corresponding path program 1 times [2022-02-20 23:43:43,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:43,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2052826900] [2022-02-20 23:43:43,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:43,784 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:43,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:43,918 INFO L290 TraceCheckUtils]: 0: Hoare triple {67#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); {67#true} is VALID [2022-02-20 23:43:43,920 INFO L290 TraceCheckUtils]: 1: Hoare triple {67#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {69#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:43:43,921 INFO L290 TraceCheckUtils]: 2: Hoare triple {69#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {68#false} is VALID [2022-02-20 23:43:43,922 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:43:43,922 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:43,923 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2052826900] [2022-02-20 23:43:43,923 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2052826900] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:43,924 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:43,924 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:43,925 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1703977385] [2022-02-20 23:43:43,926 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:43,930 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:43:43,931 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:43,933 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:43:43,938 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:43:43,938 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:43,939 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:43,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:43,956 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:43,958 INFO L87 Difference]: Start difference. First operand has 64 states, 35 states have (on average 1.9142857142857144) internal successors, (67), 62 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) 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:43:44,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,088 INFO L93 Difference]: Finished difference Result 63 states and 68 transitions. [2022-02-20 23:43:44,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:44,088 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:43:44,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:44,090 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:43:44,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 23:43:44,103 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:43:44,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 71 transitions. [2022-02-20 23:43:44,105 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 71 transitions. [2022-02-20 23:43:44,190 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 71 edges. 71 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:44,201 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:43:44,201 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 23:43:44,203 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:43:44,208 INFO L933 BasicCegarLoop]: 39 mSDtfsCounter, 61 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 40 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:44,210 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 40 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:44,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 23:43:44,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 61. [2022-02-20 23:43:44,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:44,241 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,242 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,243 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,248 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-02-20 23:43:44,248 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-02-20 23:43:44,249 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,249 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,249 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 61 states. [2022-02-20 23:43:44,250 INFO L87 Difference]: Start difference. First operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 61 states. [2022-02-20 23:43:44,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,254 INFO L93 Difference]: Finished difference Result 61 states and 66 transitions. [2022-02-20 23:43:44,255 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-02-20 23:43:44,255 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,255 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,256 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:44,256 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:44,256 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 34 states have (on average 1.8235294117647058) internal successors, (62), 59 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,259 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-02-20 23:43:44,260 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 3 [2022-02-20 23:43:44,260 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:44,261 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-02-20 23:43:44,261 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:43:44,261 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-02-20 23:43:44,261 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:43:44,262 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:44,262 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:43:44,262 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:43:44,262 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:44,263 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:44,263 INFO L85 PathProgramCache]: Analyzing trace with hash 956356, now seen corresponding path program 1 times [2022-02-20 23:43:44,263 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:44,264 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1179453969] [2022-02-20 23:43:44,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:44,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:44,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:44,315 INFO L290 TraceCheckUtils]: 0: Hoare triple {318#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); {318#true} is VALID [2022-02-20 23:43:44,316 INFO L290 TraceCheckUtils]: 1: Hoare triple {318#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {320#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94))} is VALID [2022-02-20 23:43:44,317 INFO L290 TraceCheckUtils]: 2: Hoare triple {320#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {320#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94))} is VALID [2022-02-20 23:43:44,318 INFO L290 TraceCheckUtils]: 3: Hoare triple {320#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) 0) (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| 0) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {319#false} is VALID [2022-02-20 23:43:44,318 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:43:44,318 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:44,319 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1179453969] [2022-02-20 23:43:44,319 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1179453969] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:44,319 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:44,319 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:44,319 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1746971189] [2022-02-20 23:43:44,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:44,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:44,321 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:44,321 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:44,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:44,326 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:44,326 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:44,326 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:44,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:44,327 INFO L87 Difference]: Start difference. First operand 61 states and 66 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:44,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,432 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:43:44,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:44,432 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 4 [2022-02-20 23:43:44,432 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:44,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:44,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 23:43:44,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:44,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 66 transitions. [2022-02-20 23:43:44,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 66 transitions. [2022-02-20 23:43:44,504 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:44,506 INFO L225 Difference]: With dead ends: 60 [2022-02-20 23:43:44,507 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 23:43:44,507 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:43:44,508 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 57 mSDsluCounter, 1 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 39 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:44,509 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [59 Valid, 39 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:44,510 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 23:43:44,513 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 60. [2022-02-20 23:43:44,513 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:44,514 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,514 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,515 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,517 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:43:44,518 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-02-20 23:43:44,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,519 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-02-20 23:43:44,519 INFO L87 Difference]: Start difference. First operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 60 states. [2022-02-20 23:43:44,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,522 INFO L93 Difference]: Finished difference Result 60 states and 65 transitions. [2022-02-20 23:43:44,522 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-02-20 23:43:44,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,523 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:44,523 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:44,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 34 states have (on average 1.7941176470588236) internal successors, (61), 58 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 65 transitions. [2022-02-20 23:43:44,526 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 65 transitions. Word has length 4 [2022-02-20 23:43:44,526 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:44,527 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 65 transitions. [2022-02-20 23:43:44,527 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:44,527 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 65 transitions. [2022-02-20 23:43:44,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:43:44,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:44,528 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:44,528 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:43:44,528 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:44,529 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:44,529 INFO L85 PathProgramCache]: Analyzing trace with hash -1573926710, now seen corresponding path program 1 times [2022-02-20 23:43:44,529 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:44,529 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [877348029] [2022-02-20 23:43:44,529 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:44,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:44,545 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:44,593 INFO L290 TraceCheckUtils]: 0: Hoare triple {563#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); {563#true} is VALID [2022-02-20 23:43:44,594 INFO L290 TraceCheckUtils]: 1: Hoare triple {563#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {565#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|))} is VALID [2022-02-20 23:43:44,595 INFO L290 TraceCheckUtils]: 2: Hoare triple {565#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} is VALID [2022-02-20 23:43:44,596 INFO L290 TraceCheckUtils]: 3: Hoare triple {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} is VALID [2022-02-20 23:43:44,596 INFO L290 TraceCheckUtils]: 4: Hoare triple {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} is VALID [2022-02-20 23:43:44,597 INFO L290 TraceCheckUtils]: 5: Hoare triple {566#(and (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {567#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:44,597 INFO L290 TraceCheckUtils]: 6: Hoare triple {567#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(1 == #valid[main_~p~0#1.base]); {564#false} is VALID [2022-02-20 23:43:44,598 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:43:44,598 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:44,598 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [877348029] [2022-02-20 23:43:44,598 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [877348029] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:44,599 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:44,599 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:44,599 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1275411979] [2022-02-20 23:43:44,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:44,600 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,600 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:44,600 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,607 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:43:44,607 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:44,607 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:44,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:44,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:44,608 INFO L87 Difference]: Start difference. First operand 60 states and 65 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,767 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,767 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-02-20 23:43:44,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:44,767 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,768 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:44,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:43:44,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 65 transitions. [2022-02-20 23:43:44,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 65 transitions. [2022-02-20 23:43:44,840 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 65 edges. 65 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:44,841 INFO L225 Difference]: With dead ends: 53 [2022-02-20 23:43:44,841 INFO L226 Difference]: Without dead ends: 53 [2022-02-20 23:43:44,842 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:43:44,843 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 143 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:44,843 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [145 Valid, 32 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:44,844 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2022-02-20 23:43:44,846 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 53. [2022-02-20 23:43:44,846 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:44,847 INFO L82 GeneralOperation]: Start isEquivalent. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,847 INFO L74 IsIncluded]: Start isIncluded. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,848 INFO L87 Difference]: Start difference. First operand 53 states. Second operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,856 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-02-20 23:43:44,856 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-02-20 23:43:44,856 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,857 INFO L74 IsIncluded]: Start isIncluded. First operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 53 states. [2022-02-20 23:43:44,857 INFO L87 Difference]: Start difference. First operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 53 states. [2022-02-20 23:43:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:44,862 INFO L93 Difference]: Finished difference Result 53 states and 58 transitions. [2022-02-20 23:43:44,862 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-02-20 23:43:44,864 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:44,867 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:44,868 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:44,868 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:44,869 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 53 states, 34 states have (on average 1.588235294117647) internal successors, (54), 51 states have internal predecessors, (54), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:44,870 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 58 transitions. [2022-02-20 23:43:44,871 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 58 transitions. Word has length 7 [2022-02-20 23:43:44,871 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:44,872 INFO L470 AbstractCegarLoop]: Abstraction has 53 states and 58 transitions. [2022-02-20 23:43:44,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 5 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:43:44,875 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 58 transitions. [2022-02-20 23:43:44,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:43:44,878 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:44,878 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:44,878 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:43:44,878 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:44,879 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:44,879 INFO L85 PathProgramCache]: Analyzing trace with hash -1573926709, now seen corresponding path program 1 times [2022-02-20 23:43:44,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:44,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1500151763] [2022-02-20 23:43:44,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:44,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:44,896 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:44,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {782#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); {782#true} is VALID [2022-02-20 23:43:44,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {782#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:44,924 INFO L290 TraceCheckUtils]: 2: Hoare triple {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:44,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:44,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:44,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:44,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {784#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) 0) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4 + main_~p~0#1.offset <= #length[main_~p~0#1.base] && 0 <= main_~p~0#1.offset); {783#false} is VALID [2022-02-20 23:43:44,927 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:43:44,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:44,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1500151763] [2022-02-20 23:43:44,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1500151763] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:44,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:44,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:43:44,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1824292420] [2022-02-20 23:43:44,929 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:44,929 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:43:44,929 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:44,929 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:43:44,936 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:43:44,936 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:43:44,937 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:44,937 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:43:44,937 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:43:44,937 INFO L87 Difference]: Start difference. First operand 53 states and 58 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:43:45,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,021 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:43:45,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:43:45,021 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:43:45,021 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:45,022 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:43:45,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-02-20 23:43:45,023 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:43:45,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2022-02-20 23:43:45,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2022-02-20 23:43:45,086 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:45,088 INFO L225 Difference]: With dead ends: 46 [2022-02-20 23:43:45,088 INFO L226 Difference]: Without dead ends: 46 [2022-02-20 23:43:45,088 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:43:45,089 INFO L933 BasicCegarLoop]: 33 mSDtfsCounter, 38 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:45,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 35 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:45,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2022-02-20 23:43:45,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 46. [2022-02-20 23:43:45,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:45,093 INFO L82 GeneralOperation]: Start isEquivalent. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,093 INFO L74 IsIncluded]: Start isIncluded. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,094 INFO L87 Difference]: Start difference. First operand 46 states. Second operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,095 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:43:45,096 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 23:43:45,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 23:43:45,099 INFO L87 Difference]: Start difference. First operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 46 states. [2022-02-20 23:43:45,102 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,102 INFO L93 Difference]: Finished difference Result 46 states and 51 transitions. [2022-02-20 23:43:45,102 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 23:43:45,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,103 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:45,103 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:45,103 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 34 states have (on average 1.3823529411764706) internal successors, (47), 44 states have internal predecessors, (47), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 51 transitions. [2022-02-20 23:43:45,105 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 51 transitions. Word has length 7 [2022-02-20 23:43:45,105 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:45,105 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 51 transitions. [2022-02-20 23:43:45,106 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:43:45,106 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 51 transitions. [2022-02-20 23:43:45,106 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:43:45,107 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:45,107 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:45,107 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:43:45,107 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:45,108 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:45,108 INFO L85 PathProgramCache]: Analyzing trace with hash 1365553495, now seen corresponding path program 1 times [2022-02-20 23:43:45,108 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:45,108 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1823839625] [2022-02-20 23:43:45,108 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:45,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:45,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:45,195 INFO L290 TraceCheckUtils]: 0: Hoare triple {971#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); {971#true} is VALID [2022-02-20 23:43:45,196 INFO L290 TraceCheckUtils]: 1: Hoare triple {971#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {973#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|)} is VALID [2022-02-20 23:43:45,197 INFO L290 TraceCheckUtils]: 2: Hoare triple {973#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:43:45,198 INFO L290 TraceCheckUtils]: 3: Hoare triple {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:43:45,198 INFO L290 TraceCheckUtils]: 4: Hoare triple {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:43:45,199 INFO L290 TraceCheckUtils]: 5: Hoare triple {974#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,200 INFO L290 TraceCheckUtils]: 6: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,200 INFO L290 TraceCheckUtils]: 7: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,201 INFO L290 TraceCheckUtils]: 8: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,201 INFO L290 TraceCheckUtils]: 9: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,209 INFO L290 TraceCheckUtils]: 10: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,211 INFO L290 TraceCheckUtils]: 12: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:45,211 INFO L290 TraceCheckUtils]: 13: Hoare triple {975#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {976#(= (select |#valid| |ULTIMATE.start_Sum_~instrs#1.base|) 1)} is VALID [2022-02-20 23:43:45,212 INFO L290 TraceCheckUtils]: 14: Hoare triple {976#(= (select |#valid| |ULTIMATE.start_Sum_~instrs#1.base|) 1)} assume !(1 == #valid[Sum_~instrs#1.base]); {972#false} is VALID [2022-02-20 23:43:45,212 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:43:45,212 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:45,213 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1823839625] [2022-02-20 23:43:45,213 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1823839625] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:45,213 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:45,213 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:45,213 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519046905] [2022-02-20 23:43:45,214 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:45,214 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) 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:43:45,214 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:45,214 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), 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:43:45,233 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:43:45,233 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:43:45,233 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:45,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:43:45,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:43:45,234 INFO L87 Difference]: Start difference. First operand 46 states and 51 transitions. Second operand has 6 states, 5 states have (on average 3.0) 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:43:45,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,391 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-02-20 23:43:45,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:45,391 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) 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:43:45,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:45,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) 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:43:45,393 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 23:43:45,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) 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:43:45,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 23:43:45,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 23:43:45,445 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:45,446 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:43:45,446 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:43:45,446 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:45,447 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 72 mSDsluCounter, 8 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 35 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:45,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 35 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:45,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:43:45,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:43:45,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:45,450 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,451 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,451 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,453 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-02-20 23:43:45,453 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-02-20 23:43:45,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 23:43:45,454 INFO L87 Difference]: Start difference. First operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 23:43:45,455 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,455 INFO L93 Difference]: Finished difference Result 44 states and 49 transitions. [2022-02-20 23:43:45,455 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-02-20 23:43:45,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:45,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 34 states have (on average 1.3235294117647058) internal successors, (45), 42 states have internal predecessors, (45), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 49 transitions. [2022-02-20 23:43:45,458 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 49 transitions. Word has length 15 [2022-02-20 23:43:45,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:45,458 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 49 transitions. [2022-02-20 23:43:45,459 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) 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:43:45,459 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 49 transitions. [2022-02-20 23:43:45,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:43:45,459 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:45,459 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:45,460 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:43:45,460 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:45,460 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:45,460 INFO L85 PathProgramCache]: Analyzing trace with hash 1365553496, now seen corresponding path program 1 times [2022-02-20 23:43:45,461 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:45,461 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1679042952] [2022-02-20 23:43:45,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:45,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:45,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:45,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {1157#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); {1157#true} is VALID [2022-02-20 23:43:45,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {1157#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,564 INFO L290 TraceCheckUtils]: 2: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,565 INFO L290 TraceCheckUtils]: 4: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,568 INFO L290 TraceCheckUtils]: 7: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,568 INFO L290 TraceCheckUtils]: 8: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,569 INFO L290 TraceCheckUtils]: 9: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,570 INFO L290 TraceCheckUtils]: 10: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,570 INFO L290 TraceCheckUtils]: 11: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,571 INFO L290 TraceCheckUtils]: 12: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,571 INFO L290 TraceCheckUtils]: 13: Hoare triple {1159#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {1160#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)))} is VALID [2022-02-20 23:43:45,572 INFO L290 TraceCheckUtils]: 14: Hoare triple {1160#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)))} assume !(4 + Sum_~instrs#1.offset <= #length[Sum_~instrs#1.base] && 0 <= Sum_~instrs#1.offset); {1158#false} is VALID [2022-02-20 23:43:45,572 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:43:45,573 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:45,573 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1679042952] [2022-02-20 23:43:45,573 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1679042952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:45,573 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:45,573 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:45,573 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [965734428] [2022-02-20 23:43:45,574 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:45,574 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:43:45,574 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:45,574 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:45,593 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:43:45,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:45,594 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:45,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:45,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:45,595 INFO L87 Difference]: Start difference. First operand 44 states and 49 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:45,719 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,719 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 23:43:45,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:45,719 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 23:43:45,720 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:45,720 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:45,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 23:43:45,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:45,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 49 transitions. [2022-02-20 23:43:45,723 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 49 transitions. [2022-02-20 23:43:45,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:45,771 INFO L225 Difference]: With dead ends: 43 [2022-02-20 23:43:45,771 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 23:43:45,772 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:43:45,772 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 56 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 33 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 38 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 33 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:45,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [56 Valid, 38 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:45,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 23:43:45,775 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 43. [2022-02-20 23:43:45,775 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:45,775 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,775 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,776 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,777 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 23:43:45,777 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 23:43:45,777 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,778 INFO L74 IsIncluded]: Start isIncluded. First operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 23:43:45,779 INFO L87 Difference]: Start difference. First operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 43 states. [2022-02-20 23:43:45,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:45,780 INFO L93 Difference]: Finished difference Result 43 states and 48 transitions. [2022-02-20 23:43:45,781 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 23:43:45,781 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:45,781 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:45,781 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:45,781 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:45,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 43 states, 34 states have (on average 1.2941176470588236) internal successors, (44), 41 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:45,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 43 states to 43 states and 48 transitions. [2022-02-20 23:43:45,783 INFO L78 Accepts]: Start accepts. Automaton has 43 states and 48 transitions. Word has length 15 [2022-02-20 23:43:45,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:45,784 INFO L470 AbstractCegarLoop]: Abstraction has 43 states and 48 transitions. [2022-02-20 23:43:45,784 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:45,784 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 48 transitions. [2022-02-20 23:43:45,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:43:45,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:45,790 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:43:45,790 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:43:45,790 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:45,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:45,791 INFO L85 PathProgramCache]: Analyzing trace with hash -1963083303, now seen corresponding path program 1 times [2022-02-20 23:43:45,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:45,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1938318952] [2022-02-20 23:43:45,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:45,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:45,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:45,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {1337#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); {1337#true} is VALID [2022-02-20 23:43:45,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {1337#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,882 INFO L290 TraceCheckUtils]: 2: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,884 INFO L290 TraceCheckUtils]: 5: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,884 INFO L290 TraceCheckUtils]: 6: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,885 INFO L290 TraceCheckUtils]: 7: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,889 INFO L290 TraceCheckUtils]: 10: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,890 INFO L290 TraceCheckUtils]: 11: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,890 INFO L290 TraceCheckUtils]: 12: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:45,891 INFO L290 TraceCheckUtils]: 13: Hoare triple {1339#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:45,892 INFO L290 TraceCheckUtils]: 14: Hoare triple {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:45,892 INFO L290 TraceCheckUtils]: 15: Hoare triple {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:45,893 INFO L290 TraceCheckUtils]: 16: Hoare triple {1340#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {1338#false} is VALID [2022-02-20 23:43:45,893 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:43:45,894 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:45,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1938318952] [2022-02-20 23:43:45,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1938318952] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:45,895 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:45,895 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:45,895 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195354476] [2022-02-20 23:43:45,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:45,895 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:45,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:45,896 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:45,912 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:43:45,912 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:45,912 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:45,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:45,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:45,913 INFO L87 Difference]: Start difference. First operand 43 states and 48 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:46,087 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,087 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-02-20 23:43:46,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:46,087 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:46,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:46,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:43:46,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:46,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 80 transitions. [2022-02-20 23:43:46,092 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 80 transitions. [2022-02-20 23:43:46,165 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 80 edges. 80 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:46,166 INFO L225 Difference]: With dead ends: 69 [2022-02-20 23:43:46,166 INFO L226 Difference]: Without dead ends: 69 [2022-02-20 23:43:46,167 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:43:46,167 INFO L933 BasicCegarLoop]: 30 mSDtfsCounter, 76 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:46,168 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 54 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:46,168 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 69 states. [2022-02-20 23:43:46,170 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 69 to 46. [2022-02-20 23:43:46,170 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,171 INFO L82 GeneralOperation]: Start isEquivalent. First operand 69 states. Second operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,171 INFO L74 IsIncluded]: Start isIncluded. First operand 69 states. Second operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,171 INFO L87 Difference]: Start difference. First operand 69 states. Second operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,173 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,173 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-02-20 23:43:46,174 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-02-20 23:43:46,174 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,174 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,174 INFO L74 IsIncluded]: Start isIncluded. First operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 23:43:46,175 INFO L87 Difference]: Start difference. First operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 69 states. [2022-02-20 23:43:46,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,177 INFO L93 Difference]: Finished difference Result 69 states and 79 transitions. [2022-02-20 23:43:46,177 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-02-20 23:43:46,177 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,177 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,177 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,178 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,178 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.2972972972972974) internal successors, (48), 44 states have internal predecessors, (48), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,179 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2022-02-20 23:43:46,179 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 17 [2022-02-20 23:43:46,179 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,180 INFO L470 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2022-02-20 23:43:46,180 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 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:43:46,180 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2022-02-20 23:43:46,180 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:43:46,180 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,181 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:43:46,181 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:43:46,181 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:46,181 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,182 INFO L85 PathProgramCache]: Analyzing trace with hash -58695891, now seen corresponding path program 1 times [2022-02-20 23:43:46,182 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,182 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1082103827] [2022-02-20 23:43:46,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {1598#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); {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {1598#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 2: Hoare triple {1598#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 3: Hoare triple {1598#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {1598#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {1598#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {1598#true} is VALID [2022-02-20 23:43:46,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {1598#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {1598#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 8: Hoare triple {1598#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 9: Hoare triple {1598#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 10: Hoare triple {1598#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 11: Hoare triple {1598#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {1598#true} is VALID [2022-02-20 23:43:46,257 INFO L290 TraceCheckUtils]: 12: Hoare triple {1598#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {1598#true} is VALID [2022-02-20 23:43:46,258 INFO L290 TraceCheckUtils]: 13: Hoare triple {1598#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {1600#(= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|)} is VALID [2022-02-20 23:43:46,258 INFO L290 TraceCheckUtils]: 14: Hoare triple {1600#(= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:46,259 INFO L290 TraceCheckUtils]: 15: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:46,259 INFO L290 TraceCheckUtils]: 16: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} Sum_#res#1 := Sum_~count~0#1; {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:46,260 INFO L290 TraceCheckUtils]: 17: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:46,260 INFO L290 TraceCheckUtils]: 18: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} is VALID [2022-02-20 23:43:46,261 INFO L290 TraceCheckUtils]: 19: Hoare triple {1601#(= (select |#valid| |ULTIMATE.start_main_~p~0#1.base|) 1)} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {1602#(= (select |#valid| |ULTIMATE.start_Sum2_~instrs#1.base|) 1)} is VALID [2022-02-20 23:43:46,261 INFO L290 TraceCheckUtils]: 20: Hoare triple {1602#(= (select |#valid| |ULTIMATE.start_Sum2_~instrs#1.base|) 1)} assume !(1 == #valid[Sum2_~instrs#1.base]); {1599#false} is VALID [2022-02-20 23:43:46,262 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:43:46,262 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,262 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1082103827] [2022-02-20 23:43:46,262 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1082103827] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:46,262 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:46,262 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:43:46,263 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295412838] [2022-02-20 23:43:46,263 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:46,264 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,264 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:46,264 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,279 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:43:46,280 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:46,280 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:46,281 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:46,281 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:46,281 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,443 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,443 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:43:46,443 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:43:46,443 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,444 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,444 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,445 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-20 23:43:46,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,446 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 48 transitions. [2022-02-20 23:43:46,446 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 48 transitions. [2022-02-20 23:43:46,488 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:46,489 INFO L225 Difference]: With dead ends: 44 [2022-02-20 23:43:46,489 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 23:43:46,490 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:46,490 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 70 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 70 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:46,491 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [70 Valid, 47 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:46,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 23:43:46,493 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 23:43:46,493 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,493 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,494 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,494 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,495 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,495 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:43:46,496 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:43:46,496 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,496 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,496 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 23:43:46,496 INFO L87 Difference]: Start difference. First operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 44 states. [2022-02-20 23:43:46,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,498 INFO L93 Difference]: Finished difference Result 44 states and 50 transitions. [2022-02-20 23:43:46,498 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:43:46,498 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,498 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,498 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,499 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 37 states have (on average 1.2432432432432432) internal successors, (46), 42 states have internal predecessors, (46), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 50 transitions. [2022-02-20 23:43:46,500 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 50 transitions. Word has length 21 [2022-02-20 23:43:46,500 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,500 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 50 transitions. [2022-02-20 23:43:46,501 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 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:43:46,501 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 50 transitions. [2022-02-20 23:43:46,501 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:43:46,501 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,501 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:43:46,502 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:43:46,502 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:46,502 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,502 INFO L85 PathProgramCache]: Analyzing trace with hash -58695890, now seen corresponding path program 1 times [2022-02-20 23:43:46,502 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,503 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [124857] [2022-02-20 23:43:46,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,503 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,554 INFO L290 TraceCheckUtils]: 0: Hoare triple {1785#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); {1785#true} is VALID [2022-02-20 23:43:46,554 INFO L290 TraceCheckUtils]: 1: Hoare triple {1785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {1785#true} is VALID [2022-02-20 23:43:46,555 INFO L290 TraceCheckUtils]: 2: Hoare triple {1785#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {1785#true} is VALID [2022-02-20 23:43:46,555 INFO L290 TraceCheckUtils]: 3: Hoare triple {1785#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {1785#true} is VALID [2022-02-20 23:43:46,555 INFO L290 TraceCheckUtils]: 4: Hoare triple {1785#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {1785#true} is VALID [2022-02-20 23:43:46,555 INFO L290 TraceCheckUtils]: 5: Hoare triple {1785#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {1785#true} is VALID [2022-02-20 23:43:46,555 INFO L290 TraceCheckUtils]: 6: Hoare triple {1785#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {1785#true} is VALID [2022-02-20 23:43:46,556 INFO L290 TraceCheckUtils]: 7: Hoare triple {1785#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {1785#true} is VALID [2022-02-20 23:43:46,556 INFO L290 TraceCheckUtils]: 8: Hoare triple {1785#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {1785#true} is VALID [2022-02-20 23:43:46,556 INFO L290 TraceCheckUtils]: 9: Hoare triple {1785#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {1785#true} is VALID [2022-02-20 23:43:46,556 INFO L290 TraceCheckUtils]: 10: Hoare triple {1785#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {1785#true} is VALID [2022-02-20 23:43:46,556 INFO L290 TraceCheckUtils]: 11: Hoare triple {1785#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {1785#true} is VALID [2022-02-20 23:43:46,557 INFO L290 TraceCheckUtils]: 12: Hoare triple {1785#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {1785#true} is VALID [2022-02-20 23:43:46,557 INFO L290 TraceCheckUtils]: 13: Hoare triple {1785#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} is VALID [2022-02-20 23:43:46,557 INFO L290 TraceCheckUtils]: 14: Hoare triple {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} is VALID [2022-02-20 23:43:46,558 INFO L290 TraceCheckUtils]: 15: Hoare triple {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} is VALID [2022-02-20 23:43:46,558 INFO L290 TraceCheckUtils]: 16: Hoare triple {1787#(= |ULTIMATE.start_Sum_~count~0#1| 0)} Sum_#res#1 := Sum_~count~0#1; {1788#(= |ULTIMATE.start_Sum_#res#1| 0)} is VALID [2022-02-20 23:43:46,559 INFO L290 TraceCheckUtils]: 17: Hoare triple {1788#(= |ULTIMATE.start_Sum_#res#1| 0)} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {1789#(= |ULTIMATE.start_main_#t~ret14#1| 0)} is VALID [2022-02-20 23:43:46,559 INFO L290 TraceCheckUtils]: 18: Hoare triple {1789#(= |ULTIMATE.start_main_#t~ret14#1| 0)} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {1786#false} is VALID [2022-02-20 23:43:46,559 INFO L290 TraceCheckUtils]: 19: Hoare triple {1786#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {1786#false} is VALID [2022-02-20 23:43:46,560 INFO L290 TraceCheckUtils]: 20: Hoare triple {1786#false} assume !(4 + Sum2_~instrs#1.offset <= #length[Sum2_~instrs#1.base] && 0 <= Sum2_~instrs#1.offset); {1786#false} is VALID [2022-02-20 23:43:46,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:43:46,560 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,560 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [124857] [2022-02-20 23:43:46,560 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [124857] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:46,560 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:46,561 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:46,561 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1893642537] [2022-02-20 23:43:46,561 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:46,561 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,562 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:46,562 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,581 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:43:46,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:46,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:46,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:46,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:46,583 INFO L87 Difference]: Start difference. First operand 44 states and 50 transitions. Second operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,707 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-20 23:43:46,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:46,707 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:46,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,709 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 23:43:46,709 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 74 transitions. [2022-02-20 23:43:46,711 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 74 transitions. [2022-02-20 23:43:46,767 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 74 edges. 74 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:46,768 INFO L225 Difference]: With dead ends: 64 [2022-02-20 23:43:46,768 INFO L226 Difference]: Without dead ends: 64 [2022-02-20 23:43:46,768 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:46,769 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 35 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 171 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:46,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 171 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:46,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2022-02-20 23:43:46,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 47. [2022-02-20 23:43:46,772 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:46,772 INFO L82 GeneralOperation]: Start isEquivalent. First operand 64 states. Second operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,772 INFO L74 IsIncluded]: Start isIncluded. First operand 64 states. Second operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,772 INFO L87 Difference]: Start difference. First operand 64 states. Second operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,774 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,774 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-20 23:43:46,775 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-20 23:43:46,775 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,775 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,775 INFO L74 IsIncluded]: Start isIncluded. First operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 64 states. [2022-02-20 23:43:46,776 INFO L87 Difference]: Start difference. First operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 64 states. [2022-02-20 23:43:46,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:46,777 INFO L93 Difference]: Finished difference Result 64 states and 73 transitions. [2022-02-20 23:43:46,778 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 73 transitions. [2022-02-20 23:43:46,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:46,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:46,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:46,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:46,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 47 states, 40 states have (on average 1.225) internal successors, (49), 45 states have internal predecessors, (49), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:46,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 53 transitions. [2022-02-20 23:43:46,780 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 53 transitions. Word has length 21 [2022-02-20 23:43:46,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:46,780 INFO L470 AbstractCegarLoop]: Abstraction has 47 states and 53 transitions. [2022-02-20 23:43:46,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.2) internal successors, (21), 5 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:43:46,781 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 53 transitions. [2022-02-20 23:43:46,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:43:46,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:46,782 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:46,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:43:46,782 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:46,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:46,782 INFO L85 PathProgramCache]: Analyzing trace with hash -309999949, now seen corresponding path program 1 times [2022-02-20 23:43:46,783 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:46,783 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [866121750] [2022-02-20 23:43:46,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:46,807 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,887 INFO L290 TraceCheckUtils]: 0: Hoare triple {2035#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); {2035#true} is VALID [2022-02-20 23:43:46,888 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,888 INFO L290 TraceCheckUtils]: 2: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,889 INFO L290 TraceCheckUtils]: 4: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,889 INFO L290 TraceCheckUtils]: 5: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,890 INFO L290 TraceCheckUtils]: 6: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,891 INFO L290 TraceCheckUtils]: 8: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,893 INFO L290 TraceCheckUtils]: 11: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,900 INFO L290 TraceCheckUtils]: 12: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:46,901 INFO L290 TraceCheckUtils]: 13: Hoare triple {2037#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:46,902 INFO L290 TraceCheckUtils]: 14: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:46,903 INFO L290 TraceCheckUtils]: 15: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:46,904 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:46,904 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:46,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:46,905 INFO L290 TraceCheckUtils]: 19: Hoare triple {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:46,906 INFO L290 TraceCheckUtils]: 20: Hoare triple {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:46,907 INFO L290 TraceCheckUtils]: 21: Hoare triple {2039#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (+ 64 (* 30 |ULTIMATE.start_Sum_~i~0#1|)) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {2036#false} is VALID [2022-02-20 23:43:46,907 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:46,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:46,907 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [866121750] [2022-02-20 23:43:46,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [866121750] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:46,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892970181] [2022-02-20 23:43:46,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:46,908 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:46,909 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:46,910 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:43:46,914 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:43:46,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:46,999 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:43:47,028 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:47,032 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:47,508 INFO L290 TraceCheckUtils]: 0: Hoare triple {2035#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); {2035#true} is VALID [2022-02-20 23:43:47,509 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {2046#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:43:47,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {2046#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2046#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:43:47,511 INFO L290 TraceCheckUtils]: 3: Hoare triple {2046#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,512 INFO L290 TraceCheckUtils]: 4: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,513 INFO L290 TraceCheckUtils]: 5: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,513 INFO L290 TraceCheckUtils]: 6: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,514 INFO L290 TraceCheckUtils]: 7: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,515 INFO L290 TraceCheckUtils]: 8: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,515 INFO L290 TraceCheckUtils]: 9: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,516 INFO L290 TraceCheckUtils]: 10: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,516 INFO L290 TraceCheckUtils]: 11: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,517 INFO L290 TraceCheckUtils]: 12: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:47,518 INFO L290 TraceCheckUtils]: 13: Hoare triple {2053#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {2084#(and (<= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:47,518 INFO L290 TraceCheckUtils]: 14: Hoare triple {2084#(and (<= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:47,519 INFO L290 TraceCheckUtils]: 15: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:47,520 INFO L290 TraceCheckUtils]: 16: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:47,523 INFO L290 TraceCheckUtils]: 17: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:47,523 INFO L290 TraceCheckUtils]: 18: Hoare triple {2038#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:47,524 INFO L290 TraceCheckUtils]: 19: Hoare triple {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:47,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:47,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {2100#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 94 (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (= |ULTIMATE.start_Sum_~i~0#1| 1))} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {2036#false} is VALID [2022-02-20 23:43:47,526 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:47,526 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:47,906 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:43:47,906 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 13 treesize of output 17 [2022-02-20 23:43:48,043 INFO L290 TraceCheckUtils]: 21: Hoare triple {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {2036#false} is VALID [2022-02-20 23:43:48,044 INFO L290 TraceCheckUtils]: 20: Hoare triple {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} is VALID [2022-02-20 23:43:48,044 INFO L290 TraceCheckUtils]: 19: Hoare triple {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} is VALID [2022-02-20 23:43:48,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {2110#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 18 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset| 10)))} is VALID [2022-02-20 23:43:48,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:48,046 INFO L290 TraceCheckUtils]: 16: Hoare triple {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:48,047 INFO L290 TraceCheckUtils]: 15: Hoare triple {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:48,048 INFO L290 TraceCheckUtils]: 14: Hoare triple {2133#(or (not (<= 0 |ULTIMATE.start_Sum_~instrs#1.offset|)) (and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|))))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2120#(and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:48,049 INFO L290 TraceCheckUtils]: 13: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {2133#(or (not (<= 0 |ULTIMATE.start_Sum_~instrs#1.offset|)) (and (<= (+ (* 30 |ULTIMATE.start_Sum_~i~0#1|) 48 |ULTIMATE.start_Sum_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum_~instrs#1.base|)) (<= 0 (+ 40 (* 30 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_~instrs#1.offset|))))} is VALID [2022-02-20 23:43:48,049 INFO L290 TraceCheckUtils]: 12: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,050 INFO L290 TraceCheckUtils]: 11: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,050 INFO L290 TraceCheckUtils]: 10: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,051 INFO L290 TraceCheckUtils]: 9: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,052 INFO L290 TraceCheckUtils]: 8: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,052 INFO L290 TraceCheckUtils]: 7: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,053 INFO L290 TraceCheckUtils]: 6: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,053 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,054 INFO L290 TraceCheckUtils]: 4: Hoare triple {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,055 INFO L290 TraceCheckUtils]: 3: Hoare triple {2168#(or (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {2137#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)))} is VALID [2022-02-20 23:43:48,055 INFO L290 TraceCheckUtils]: 2: Hoare triple {2168#(or (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2168#(or (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:48,067 INFO L290 TraceCheckUtils]: 1: Hoare triple {2035#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {2168#(or (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ |ULTIMATE.start_main_~p~0#1.offset| 48) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:48,068 INFO L290 TraceCheckUtils]: 0: Hoare triple {2035#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); {2035#true} is VALID [2022-02-20 23:43:48,068 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:48,068 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892970181] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:48,068 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:48,069 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 6, 6] total 13 [2022-02-20 23:43:48,069 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869031851] [2022-02-20 23:43:48,069 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:48,069 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:43:48,070 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:48,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:48,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:48,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2022-02-20 23:43:48,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:48,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2022-02-20 23:43:48,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=140, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:43:48,136 INFO L87 Difference]: Start difference. First operand 47 states and 53 transitions. Second operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:49,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,292 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 23:43:49,292 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:43:49,292 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have 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:43:49,293 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:49,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:49,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-02-20 23:43:49,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:49,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 132 transitions. [2022-02-20 23:43:49,297 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 132 transitions. [2022-02-20 23:43:49,432 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:43:49,433 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:43:49,433 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 23:43:49,434 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 33 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 32 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=86, Invalid=220, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:43:49,434 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 620 mSDsluCounter, 89 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 75 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 620 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 265 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 75 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:49,434 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [620 Valid, 133 Invalid, 265 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [75 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:49,435 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 23:43:49,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 57. [2022-02-20 23:43:49,437 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:49,438 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,438 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,438 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,440 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 23:43:49,440 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-02-20 23:43:49,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,441 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 111 states. [2022-02-20 23:43:49,442 INFO L87 Difference]: Start difference. First operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 111 states. [2022-02-20 23:43:49,444 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,444 INFO L93 Difference]: Finished difference Result 111 states and 130 transitions. [2022-02-20 23:43:49,444 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 130 transitions. [2022-02-20 23:43:49,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:49,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:49,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 50 states have (on average 1.22) internal successors, (61), 55 states have internal predecessors, (61), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,447 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2022-02-20 23:43:49,447 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 22 [2022-02-20 23:43:49,447 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:49,447 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2022-02-20 23:43:49,447 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 4.6923076923076925) internal successors, (61), 14 states have internal predecessors, (61), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:49,448 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2022-02-20 23:43:49,448 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:43:49,448 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:49,448 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] [2022-02-20 23:43:49,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:49,671 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,SelfDestructingSolverStorable9 [2022-02-20 23:43:49,672 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:49,672 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:49,672 INFO L85 PathProgramCache]: Analyzing trace with hash -612311662, now seen corresponding path program 1 times [2022-02-20 23:43:49,672 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:49,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1123606210] [2022-02-20 23:43:49,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:49,673 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:49,702 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:49,736 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 23:43:49,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:49,741 INFO L290 TraceCheckUtils]: 0: Hoare triple {2575#true} assume true; {2575#true} is VALID [2022-02-20 23:43:49,741 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2575#true} {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} #105#return; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,742 INFO L290 TraceCheckUtils]: 0: Hoare triple {2575#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); {2575#true} is VALID [2022-02-20 23:43:49,743 INFO L290 TraceCheckUtils]: 1: Hoare triple {2575#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,743 INFO L290 TraceCheckUtils]: 2: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,744 INFO L290 TraceCheckUtils]: 3: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,744 INFO L290 TraceCheckUtils]: 4: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,745 INFO L290 TraceCheckUtils]: 5: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,745 INFO L290 TraceCheckUtils]: 6: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,746 INFO L290 TraceCheckUtils]: 7: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,747 INFO L290 TraceCheckUtils]: 8: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,747 INFO L290 TraceCheckUtils]: 9: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,748 INFO L290 TraceCheckUtils]: 10: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,749 INFO L290 TraceCheckUtils]: 11: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,749 INFO L290 TraceCheckUtils]: 12: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,750 INFO L290 TraceCheckUtils]: 13: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,750 INFO L290 TraceCheckUtils]: 14: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,751 INFO L290 TraceCheckUtils]: 15: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,751 INFO L290 TraceCheckUtils]: 16: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,752 INFO L290 TraceCheckUtils]: 17: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,752 INFO L290 TraceCheckUtils]: 18: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 4311811859 != main_#t~ret14#1 % 18446744073709551616;havoc main_#t~ret14#1; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,753 INFO L272 TraceCheckUtils]: 19: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} call dummy_abort(); {2575#true} is VALID [2022-02-20 23:43:49,753 INFO L290 TraceCheckUtils]: 20: Hoare triple {2575#true} assume true; {2575#true} is VALID [2022-02-20 23:43:49,754 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2575#true} {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} #105#return; {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:49,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {2577#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {2580#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} is VALID [2022-02-20 23:43:49,755 INFO L290 TraceCheckUtils]: 23: Hoare triple {2580#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} assume !(4 + Sum2_~instrs#1.offset <= #length[Sum2_~instrs#1.base] && 0 <= Sum2_~instrs#1.offset); {2576#false} is VALID [2022-02-20 23:43:49,755 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:43:49,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:49,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1123606210] [2022-02-20 23:43:49,756 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1123606210] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:49,756 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:49,756 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:49,756 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363299962] [2022-02-20 23:43:49,756 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:49,757 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:43:49,757 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:49,757 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:49,776 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:49,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:49,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:49,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:49,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:49,777 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:49,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,874 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-20 23:43:49,874 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:49,875 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:43:49,875 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:49,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:49,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 23:43:49,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:49,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 46 transitions. [2022-02-20 23:43:49,877 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 46 transitions. [2022-02-20 23:43:49,913 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 46 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:49,914 INFO L225 Difference]: With dead ends: 56 [2022-02-20 23:43:49,914 INFO L226 Difference]: Without dead ends: 56 [2022-02-20 23:43:49,915 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:43:49,915 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 32 mSDsluCounter, 15 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:49,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 44 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:49,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2022-02-20 23:43:49,918 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 56. [2022-02-20 23:43:49,918 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:49,918 INFO L82 GeneralOperation]: Start isEquivalent. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,919 INFO L74 IsIncluded]: Start isIncluded. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,919 INFO L87 Difference]: Start difference. First operand 56 states. Second operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,920 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-20 23:43:49,920 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-02-20 23:43:49,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 56 states. [2022-02-20 23:43:49,921 INFO L87 Difference]: Start difference. First operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 56 states. [2022-02-20 23:43:49,922 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:49,922 INFO L93 Difference]: Finished difference Result 56 states and 64 transitions. [2022-02-20 23:43:49,922 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-02-20 23:43:49,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:49,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:49,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:49,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:49,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.2) internal successors, (60), 54 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:49,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 64 transitions. [2022-02-20 23:43:49,924 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 64 transitions. Word has length 24 [2022-02-20 23:43:49,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:49,925 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 64 transitions. [2022-02-20 23:43:49,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:49,925 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 64 transitions. [2022-02-20 23:43:49,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:43:49,926 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:49,926 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:43:49,926 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:43:49,926 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:49,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:49,927 INFO L85 PathProgramCache]: Analyzing trace with hash -20987021, now seen corresponding path program 1 times [2022-02-20 23:43:49,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:49,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403962329] [2022-02-20 23:43:49,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:49,927 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:49,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,019 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 23:43:50,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,030 INFO L290 TraceCheckUtils]: 0: Hoare triple {2809#true} assume true; {2809#true} is VALID [2022-02-20 23:43:50,030 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {2809#true} {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} #105#return; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,031 INFO L290 TraceCheckUtils]: 0: Hoare triple {2809#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); {2809#true} is VALID [2022-02-20 23:43:50,032 INFO L290 TraceCheckUtils]: 1: Hoare triple {2809#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,032 INFO L290 TraceCheckUtils]: 2: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,033 INFO L290 TraceCheckUtils]: 3: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,033 INFO L290 TraceCheckUtils]: 4: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,034 INFO L290 TraceCheckUtils]: 5: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,034 INFO L290 TraceCheckUtils]: 6: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,035 INFO L290 TraceCheckUtils]: 7: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,036 INFO L290 TraceCheckUtils]: 8: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,036 INFO L290 TraceCheckUtils]: 9: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,037 INFO L290 TraceCheckUtils]: 10: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,038 INFO L290 TraceCheckUtils]: 11: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,038 INFO L290 TraceCheckUtils]: 12: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,039 INFO L290 TraceCheckUtils]: 13: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,039 INFO L290 TraceCheckUtils]: 14: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,040 INFO L290 TraceCheckUtils]: 15: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,040 INFO L290 TraceCheckUtils]: 16: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,041 INFO L290 TraceCheckUtils]: 17: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,041 INFO L290 TraceCheckUtils]: 18: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume 4311811859 != main_#t~ret14#1 % 18446744073709551616;havoc main_#t~ret14#1; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,041 INFO L272 TraceCheckUtils]: 19: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} call dummy_abort(); {2809#true} is VALID [2022-02-20 23:43:50,042 INFO L290 TraceCheckUtils]: 20: Hoare triple {2809#true} assume true; {2809#true} is VALID [2022-02-20 23:43:50,042 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {2809#true} {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} #105#return; {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:50,043 INFO L290 TraceCheckUtils]: 22: Hoare triple {2811#(and (= (select |#length| |ULTIMATE.start_main_~p~0#1.base|) 94) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} is VALID [2022-02-20 23:43:50,044 INFO L290 TraceCheckUtils]: 23: Hoare triple {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} is VALID [2022-02-20 23:43:50,044 INFO L290 TraceCheckUtils]: 24: Hoare triple {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} is VALID [2022-02-20 23:43:50,045 INFO L290 TraceCheckUtils]: 25: Hoare triple {2814#(and (= (+ (- 94) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0))} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {2810#false} is VALID [2022-02-20 23:43:50,045 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:43:50,045 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:50,045 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403962329] [2022-02-20 23:43:50,046 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403962329] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:50,046 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:50,046 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:43:50,046 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1190320558] [2022-02-20 23:43:50,046 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:50,047 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:43:50,047 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:50,047 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,068 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:43:50,068 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:50,068 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:50,069 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:50,069 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:43:50,069 INFO L87 Difference]: Start difference. First operand 56 states and 64 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,208 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-02-20 23:43:50,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:50,208 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:43:50,208 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 23:43:50,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 60 transitions. [2022-02-20 23:43:50,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 60 transitions. [2022-02-20 23:43:50,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 60 edges. 60 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:50,266 INFO L225 Difference]: With dead ends: 68 [2022-02-20 23:43:50,266 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 23:43:50,267 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:43:50,267 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 37 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 47 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 49 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 47 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:50,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 49 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 47 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:50,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 23:43:50,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 59. [2022-02-20 23:43:50,270 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:50,270 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,270 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,271 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,272 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,272 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-02-20 23:43:50,272 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-02-20 23:43:50,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:50,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:50,273 INFO L74 IsIncluded]: Start isIncluded. First operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 68 states. [2022-02-20 23:43:50,273 INFO L87 Difference]: Start difference. First operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 68 states. [2022-02-20 23:43:50,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,274 INFO L93 Difference]: Finished difference Result 68 states and 78 transitions. [2022-02-20 23:43:50,274 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 78 transitions. [2022-02-20 23:43:50,275 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:50,275 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:50,275 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:50,275 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:50,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 53 states have (on average 1.2075471698113207) internal successors, (64), 57 states have internal predecessors, (64), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2022-02-20 23:43:50,276 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 26 [2022-02-20 23:43:50,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:50,276 INFO L470 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2022-02-20 23:43:50,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2022-02-20 23:43:50,277 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:43:50,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:50,277 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:50,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:43:50,278 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:50,278 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:50,278 INFO L85 PathProgramCache]: Analyzing trace with hash 1184799620, now seen corresponding path program 1 times [2022-02-20 23:43:50,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:50,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1975418324] [2022-02-20 23:43:50,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:50,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:50,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,322 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 23:43:50,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,333 INFO L290 TraceCheckUtils]: 0: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {3082#true} {3082#true} #105#return; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 0: Hoare triple {3082#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); {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 1: Hoare triple {3082#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 2: Hoare triple {3082#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 3: Hoare triple {3082#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 4: Hoare triple {3082#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 5: Hoare triple {3082#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {3082#true} is VALID [2022-02-20 23:43:50,334 INFO L290 TraceCheckUtils]: 6: Hoare triple {3082#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 7: Hoare triple {3082#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 8: Hoare triple {3082#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 9: Hoare triple {3082#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {3082#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 11: Hoare triple {3082#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 12: Hoare triple {3082#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 13: Hoare triple {3082#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 14: Hoare triple {3082#true} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3082#true} is VALID [2022-02-20 23:43:50,335 INFO L290 TraceCheckUtils]: 15: Hoare triple {3082#true} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L290 TraceCheckUtils]: 16: Hoare triple {3082#true} Sum_#res#1 := Sum_~count~0#1; {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L290 TraceCheckUtils]: 17: Hoare triple {3082#true} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L290 TraceCheckUtils]: 18: Hoare triple {3082#true} assume 4311811859 != main_#t~ret14#1 % 18446744073709551616;havoc main_#t~ret14#1; {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L272 TraceCheckUtils]: 19: Hoare triple {3082#true} call dummy_abort(); {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L290 TraceCheckUtils]: 20: Hoare triple {3082#true} assume true; {3082#true} is VALID [2022-02-20 23:43:50,336 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3082#true} {3082#true} #105#return; {3082#true} is VALID [2022-02-20 23:43:50,339 INFO L290 TraceCheckUtils]: 22: Hoare triple {3082#true} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} is VALID [2022-02-20 23:43:50,340 INFO L290 TraceCheckUtils]: 23: Hoare triple {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} is VALID [2022-02-20 23:43:50,340 INFO L290 TraceCheckUtils]: 24: Hoare triple {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} is VALID [2022-02-20 23:43:50,341 INFO L290 TraceCheckUtils]: 25: Hoare triple {3086#(= |ULTIMATE.start_Sum2_~count~1#1| 0)} Sum2_#res#1 := Sum2_~count~1#1; {3087#(= |ULTIMATE.start_Sum2_#res#1| 0)} is VALID [2022-02-20 23:43:50,341 INFO L290 TraceCheckUtils]: 26: Hoare triple {3087#(= |ULTIMATE.start_Sum2_#res#1| 0)} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {3088#(= |ULTIMATE.start_main_#t~ret15#1| 0)} is VALID [2022-02-20 23:43:50,342 INFO L290 TraceCheckUtils]: 27: Hoare triple {3088#(= |ULTIMATE.start_main_#t~ret15#1| 0)} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {3083#false} is VALID [2022-02-20 23:43:50,342 INFO L290 TraceCheckUtils]: 28: Hoare triple {3083#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {3083#false} is VALID [2022-02-20 23:43:50,342 INFO L290 TraceCheckUtils]: 29: Hoare triple {3083#false} assume !(#valid == main_old_#valid#1); {3083#false} is VALID [2022-02-20 23:43:50,342 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:43:50,343 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:50,343 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1975418324] [2022-02-20 23:43:50,343 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1975418324] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:50,343 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:50,343 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:50,343 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1934883035] [2022-02-20 23:43:50,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:50,344 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:43:50,344 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:50,344 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,364 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:50,364 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:50,364 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:50,364 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:50,364 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:50,365 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,486 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-20 23:43:50,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:50,487 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:43:50,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:50,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 23:43:50,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 58 transitions. [2022-02-20 23:43:50,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 58 transitions. [2022-02-20 23:43:50,538 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:50,539 INFO L225 Difference]: With dead ends: 67 [2022-02-20 23:43:50,539 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 23:43:50,539 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:50,540 INFO L933 BasicCegarLoop]: 44 mSDtfsCounter, 9 mSDsluCounter, 125 mSDsCounter, 0 mSdLazyCounter, 16 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 16 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:50,540 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 169 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 16 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:50,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 23:43:50,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 62. [2022-02-20 23:43:50,543 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:50,543 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,543 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,544 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,545 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-20 23:43:50,545 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-02-20 23:43:50,546 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:50,546 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:50,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 23:43:50,546 INFO L87 Difference]: Start difference. First operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 23:43:50,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:50,548 INFO L93 Difference]: Finished difference Result 67 states and 76 transitions. [2022-02-20 23:43:50,548 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 76 transitions. [2022-02-20 23:43:50,548 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:50,548 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:50,548 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:50,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:50,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 62 states, 56 states have (on average 1.1964285714285714) internal successors, (67), 60 states have internal predecessors, (67), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:50,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 71 transitions. [2022-02-20 23:43:50,549 INFO L78 Accepts]: Start accepts. Automaton has 62 states and 71 transitions. Word has length 30 [2022-02-20 23:43:50,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:50,549 INFO L470 AbstractCegarLoop]: Abstraction has 62 states and 71 transitions. [2022-02-20 23:43:50,550 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,550 INFO L276 IsEmpty]: Start isEmpty. Operand 62 states and 71 transitions. [2022-02-20 23:43:50,550 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:43:50,550 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:50,550 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:50,551 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:43:50,551 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:50,551 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:50,551 INFO L85 PathProgramCache]: Analyzing trace with hash -416344648, now seen corresponding path program 1 times [2022-02-20 23:43:50,551 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:50,551 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303082084] [2022-02-20 23:43:50,551 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:50,552 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:50,601 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,684 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 23:43:50,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:50,689 INFO L290 TraceCheckUtils]: 0: Hoare triple {3358#true} assume true; {3358#true} is VALID [2022-02-20 23:43:50,689 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {3358#true} {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} #105#return; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,690 INFO L290 TraceCheckUtils]: 0: Hoare triple {3358#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); {3358#true} is VALID [2022-02-20 23:43:50,690 INFO L290 TraceCheckUtils]: 1: Hoare triple {3358#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {3358#true} is VALID [2022-02-20 23:43:50,690 INFO L290 TraceCheckUtils]: 2: Hoare triple {3358#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3358#true} is VALID [2022-02-20 23:43:50,690 INFO L290 TraceCheckUtils]: 3: Hoare triple {3358#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {3358#true} is VALID [2022-02-20 23:43:50,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {3358#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3358#true} is VALID [2022-02-20 23:43:50,691 INFO L290 TraceCheckUtils]: 5: Hoare triple {3358#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {3358#true} is VALID [2022-02-20 23:43:50,691 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {3358#true} is VALID [2022-02-20 23:43:50,691 INFO L290 TraceCheckUtils]: 7: Hoare triple {3358#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {3358#true} is VALID [2022-02-20 23:43:50,691 INFO L290 TraceCheckUtils]: 8: Hoare triple {3358#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {3358#true} is VALID [2022-02-20 23:43:50,691 INFO L290 TraceCheckUtils]: 9: Hoare triple {3358#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {3358#true} is VALID [2022-02-20 23:43:50,692 INFO L290 TraceCheckUtils]: 10: Hoare triple {3358#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {3358#true} is VALID [2022-02-20 23:43:50,692 INFO L290 TraceCheckUtils]: 11: Hoare triple {3358#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {3358#true} is VALID [2022-02-20 23:43:50,692 INFO L290 TraceCheckUtils]: 12: Hoare triple {3358#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {3358#true} is VALID [2022-02-20 23:43:50,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {3358#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {3360#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:50,693 INFO L290 TraceCheckUtils]: 14: Hoare triple {3360#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:50,694 INFO L290 TraceCheckUtils]: 15: Hoare triple {3361#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,694 INFO L290 TraceCheckUtils]: 16: Hoare triple {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} Sum_#res#1 := Sum_~count~0#1; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,694 INFO L290 TraceCheckUtils]: 17: Hoare triple {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,695 INFO L290 TraceCheckUtils]: 18: Hoare triple {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} assume 4311811859 != main_#t~ret14#1 % 18446744073709551616;havoc main_#t~ret14#1; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,695 INFO L272 TraceCheckUtils]: 19: Hoare triple {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} call dummy_abort(); {3358#true} is VALID [2022-02-20 23:43:50,695 INFO L290 TraceCheckUtils]: 20: Hoare triple {3358#true} assume true; {3358#true} is VALID [2022-02-20 23:43:50,696 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3358#true} {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} #105#return; {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} is VALID [2022-02-20 23:43:50,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {3362#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 0)} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {3365#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:50,706 INFO L290 TraceCheckUtils]: 23: Hoare triple {3365#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {3366#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= |ULTIMATE.start_Sum2_#t~mem10#1| 0))} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 24: Hoare triple {3366#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= |ULTIMATE.start_Sum2_#t~mem10#1| 0))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {3359#false} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {3359#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {3359#false} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 26: Hoare triple {3359#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {3359#false} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 27: Hoare triple {3359#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {3359#false} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 28: Hoare triple {3359#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {3359#false} is VALID [2022-02-20 23:43:50,707 INFO L290 TraceCheckUtils]: 29: Hoare triple {3359#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {3359#false} is VALID [2022-02-20 23:43:50,708 INFO L290 TraceCheckUtils]: 30: Hoare triple {3359#false} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {3359#false} is VALID [2022-02-20 23:43:50,708 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:50,708 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:50,708 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303082084] [2022-02-20 23:43:50,709 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303082084] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:50,709 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:50,709 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:43:50,709 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [350608657] [2022-02-20 23:43:50,709 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:50,710 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 23:43:50,710 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:50,710 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:50,731 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:50,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:43:50,733 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:50,733 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:43:50,733 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:50,734 INFO L87 Difference]: Start difference. First operand 62 states and 71 transitions. Second operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:51,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,067 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:43:51,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:43:51,067 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 31 [2022-02-20 23:43:51,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:51,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-02-20 23:43:51,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:51,069 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 67 transitions. [2022-02-20 23:43:51,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 67 transitions. [2022-02-20 23:43:51,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,143 INFO L225 Difference]: With dead ends: 73 [2022-02-20 23:43:51,143 INFO L226 Difference]: Without dead ends: 73 [2022-02-20 23:43:51,143 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=77, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:43:51,144 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 22 mSDsluCounter, 134 mSDsCounter, 0 mSdLazyCounter, 111 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 111 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:51,144 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 175 Invalid, 120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 111 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:43:51,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2022-02-20 23:43:51,146 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 66. [2022-02-20 23:43:51,146 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:51,146 INFO L82 GeneralOperation]: Start isEquivalent. First operand 73 states. Second operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:43:51,146 INFO L74 IsIncluded]: Start isIncluded. First operand 73 states. Second operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:43:51,147 INFO L87 Difference]: Start difference. First operand 73 states. Second operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:43:51,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,149 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:43:51,149 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 23:43:51,149 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,150 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,150 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-02-20 23:43:51,150 INFO L87 Difference]: Start difference. First operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 73 states. [2022-02-20 23:43:51,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,153 INFO L93 Difference]: Finished difference Result 73 states and 83 transitions. [2022-02-20 23:43:51,153 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 83 transitions. [2022-02-20 23:43:51,153 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,153 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,153 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:51,153 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:51,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 59 states have (on average 1.1864406779661016) internal successors, (70), 63 states have internal predecessors, (70), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:43:51,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 76 transitions. [2022-02-20 23:43:51,154 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 76 transitions. Word has length 31 [2022-02-20 23:43:51,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:51,155 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 76 transitions. [2022-02-20 23:43:51,155 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.142857142857143) internal successors, (29), 7 states have internal predecessors, (29), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:43:51,155 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 76 transitions. [2022-02-20 23:43:51,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:43:51,155 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,156 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:51,156 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:43:51,156 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:51,156 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,156 INFO L85 PathProgramCache]: Analyzing trace with hash 241915192, now seen corresponding path program 1 times [2022-02-20 23:43:51,157 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,157 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1675333575] [2022-02-20 23:43:51,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,195 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,273 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 19 [2022-02-20 23:43:51,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {3662#true} assume true; {3662#true} is VALID [2022-02-20 23:43:51,277 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {3662#true} {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} #105#return; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,278 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 28 [2022-02-20 23:43:51,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {3662#true} assume true; {3662#true} is VALID [2022-02-20 23:43:51,281 INFO L284 TraceCheckUtils]: 1: Hoare quadruple {3662#true} {3663#false} #107#return; {3663#false} is VALID [2022-02-20 23:43:51,281 INFO L290 TraceCheckUtils]: 0: Hoare triple {3662#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); {3662#true} is VALID [2022-02-20 23:43:51,281 INFO L290 TraceCheckUtils]: 1: Hoare triple {3662#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {3662#true} is VALID [2022-02-20 23:43:51,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {3662#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3662#true} is VALID [2022-02-20 23:43:51,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {3662#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {3662#true} is VALID [2022-02-20 23:43:51,282 INFO L290 TraceCheckUtils]: 4: Hoare triple {3662#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3662#true} is VALID [2022-02-20 23:43:51,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {3662#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {3662#true} is VALID [2022-02-20 23:43:51,283 INFO L290 TraceCheckUtils]: 6: Hoare triple {3662#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,283 INFO L290 TraceCheckUtils]: 7: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,284 INFO L290 TraceCheckUtils]: 8: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,285 INFO L290 TraceCheckUtils]: 9: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,285 INFO L290 TraceCheckUtils]: 10: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,286 INFO L290 TraceCheckUtils]: 11: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,287 INFO L290 TraceCheckUtils]: 12: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,287 INFO L290 TraceCheckUtils]: 13: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,287 INFO L290 TraceCheckUtils]: 14: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,288 INFO L290 TraceCheckUtils]: 16: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#res#1 := Sum_~count~0#1; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,289 INFO L290 TraceCheckUtils]: 17: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,289 INFO L290 TraceCheckUtils]: 18: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume 4311811859 != main_#t~ret14#1 % 18446744073709551616;havoc main_#t~ret14#1; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,289 INFO L272 TraceCheckUtils]: 19: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} call dummy_abort(); {3662#true} is VALID [2022-02-20 23:43:51,289 INFO L290 TraceCheckUtils]: 20: Hoare triple {3662#true} assume true; {3662#true} is VALID [2022-02-20 23:43:51,290 INFO L284 TraceCheckUtils]: 21: Hoare quadruple {3662#true} {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} #105#return; {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:51,291 INFO L290 TraceCheckUtils]: 22: Hoare triple {3664#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {3667#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:51,291 INFO L290 TraceCheckUtils]: 23: Hoare triple {3667#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {3668#(and (<= 3 |ULTIMATE.start_Sum2_#t~mem10#1|) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:51,292 INFO L290 TraceCheckUtils]: 24: Hoare triple {3668#(and (<= 3 |ULTIMATE.start_Sum2_#t~mem10#1|) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {3663#false} is VALID [2022-02-20 23:43:51,292 INFO L290 TraceCheckUtils]: 25: Hoare triple {3663#false} Sum2_#res#1 := Sum2_~count~1#1; {3663#false} is VALID [2022-02-20 23:43:51,292 INFO L290 TraceCheckUtils]: 26: Hoare triple {3663#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {3663#false} is VALID [2022-02-20 23:43:51,292 INFO L290 TraceCheckUtils]: 27: Hoare triple {3663#false} assume 4311811859 != main_#t~ret15#1;havoc main_#t~ret15#1; {3663#false} is VALID [2022-02-20 23:43:51,292 INFO L272 TraceCheckUtils]: 28: Hoare triple {3663#false} call dummy_abort(); {3662#true} is VALID [2022-02-20 23:43:51,292 INFO L290 TraceCheckUtils]: 29: Hoare triple {3662#true} assume true; {3662#true} is VALID [2022-02-20 23:43:51,293 INFO L284 TraceCheckUtils]: 30: Hoare quadruple {3662#true} {3663#false} #107#return; {3663#false} is VALID [2022-02-20 23:43:51,293 INFO L290 TraceCheckUtils]: 31: Hoare triple {3663#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {3663#false} is VALID [2022-02-20 23:43:51,293 INFO L290 TraceCheckUtils]: 32: Hoare triple {3663#false} assume !(#valid == main_old_#valid#1); {3663#false} is VALID [2022-02-20 23:43:51,293 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:43:51,293 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,294 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1675333575] [2022-02-20 23:43:51,294 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1675333575] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,294 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:43:51,294 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:43:51,294 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [527281029] [2022-02-20 23:43:51,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,295 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-02-20 23:43:51,295 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,319 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,320 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:43:51,320 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,320 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:43:51,320 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:43:51,321 INFO L87 Difference]: Start difference. First operand 66 states and 76 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,468 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2022-02-20 23:43:51,468 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:43:51,469 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 33 [2022-02-20 23:43:51,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 23:43:51,470 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 51 transitions. [2022-02-20 23:43:51,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 51 transitions. [2022-02-20 23:43:51,523 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:51,525 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:43:51,525 INFO L226 Difference]: Without dead ends: 58 [2022-02-20 23:43:51,526 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:43:51,528 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 24 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 25 SdHoareTripleChecker+Valid, 88 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:51,528 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [25 Valid, 88 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:51,529 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 58 states. [2022-02-20 23:43:51,533 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 58 to 56. [2022-02-20 23:43:51,533 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:51,533 INFO L82 GeneralOperation]: Start isEquivalent. First operand 58 states. Second operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,535 INFO L74 IsIncluded]: Start isIncluded. First operand 58 states. Second operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,535 INFO L87 Difference]: Start difference. First operand 58 states. Second operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,537 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-02-20 23:43:51,537 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-02-20 23:43:51,537 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,537 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,537 INFO L74 IsIncluded]: Start isIncluded. First operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 58 states. [2022-02-20 23:43:51,538 INFO L87 Difference]: Start difference. First operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 58 states. [2022-02-20 23:43:51,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,539 INFO L93 Difference]: Finished difference Result 58 states and 65 transitions. [2022-02-20 23:43:51,539 INFO L276 IsEmpty]: Start isEmpty. Operand 58 states and 65 transitions. [2022-02-20 23:43:51,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:51,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:51,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:51,539 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:51,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 56 states, 50 states have (on average 1.18) internal successors, (59), 54 states have internal predecessors, (59), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 63 transitions. [2022-02-20 23:43:51,540 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 63 transitions. Word has length 33 [2022-02-20 23:43:51,540 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:51,540 INFO L470 AbstractCegarLoop]: Abstraction has 56 states and 63 transitions. [2022-02-20 23:43:51,541 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 5 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:51,541 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 63 transitions. [2022-02-20 23:43:51,541 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:43:51,541 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:51,541 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:51,542 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:43:51,542 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:51,542 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:51,542 INFO L85 PathProgramCache]: Analyzing trace with hash 701429363, now seen corresponding path program 2 times [2022-02-20 23:43:51,542 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:51,542 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2080567590] [2022-02-20 23:43:51,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:51,543 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:51,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,681 INFO L290 TraceCheckUtils]: 0: Hoare triple {3914#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); {3914#true} is VALID [2022-02-20 23:43:51,681 INFO L290 TraceCheckUtils]: 1: Hoare triple {3914#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {3914#true} is VALID [2022-02-20 23:43:51,681 INFO L290 TraceCheckUtils]: 2: Hoare triple {3914#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3914#true} is VALID [2022-02-20 23:43:51,682 INFO L290 TraceCheckUtils]: 3: Hoare triple {3914#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {3914#true} is VALID [2022-02-20 23:43:51,682 INFO L290 TraceCheckUtils]: 4: Hoare triple {3914#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3914#true} is VALID [2022-02-20 23:43:51,682 INFO L290 TraceCheckUtils]: 5: Hoare triple {3914#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {3914#true} is VALID [2022-02-20 23:43:51,682 INFO L290 TraceCheckUtils]: 6: Hoare triple {3914#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,683 INFO L290 TraceCheckUtils]: 7: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,683 INFO L290 TraceCheckUtils]: 8: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,684 INFO L290 TraceCheckUtils]: 9: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,685 INFO L290 TraceCheckUtils]: 10: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,685 INFO L290 TraceCheckUtils]: 11: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,686 INFO L290 TraceCheckUtils]: 12: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:51,687 INFO L290 TraceCheckUtils]: 13: Hoare triple {3916#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:51,687 INFO L290 TraceCheckUtils]: 14: Hoare triple {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3918#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:51,688 INFO L290 TraceCheckUtils]: 15: Hoare triple {3918#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:51,688 INFO L290 TraceCheckUtils]: 16: Hoare triple {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:51,689 INFO L290 TraceCheckUtils]: 17: Hoare triple {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:51,689 INFO L290 TraceCheckUtils]: 18: Hoare triple {3917#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:51,689 INFO L290 TraceCheckUtils]: 19: Hoare triple {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:51,690 INFO L290 TraceCheckUtils]: 20: Hoare triple {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:51,690 INFO L290 TraceCheckUtils]: 21: Hoare triple {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:51,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:51,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {3919#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:51,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:51,692 INFO L290 TraceCheckUtils]: 25: Hoare triple {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:51,692 INFO L290 TraceCheckUtils]: 26: Hoare triple {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:51,692 INFO L290 TraceCheckUtils]: 27: Hoare triple {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:51,693 INFO L290 TraceCheckUtils]: 28: Hoare triple {3920#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3921#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:51,693 INFO L290 TraceCheckUtils]: 29: Hoare triple {3921#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3922#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:51,694 INFO L290 TraceCheckUtils]: 30: Hoare triple {3922#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3915#false} is VALID [2022-02-20 23:43:51,694 INFO L290 TraceCheckUtils]: 31: Hoare triple {3915#false} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {3915#false} is VALID [2022-02-20 23:43:51,694 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:43:51,694 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:51,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2080567590] [2022-02-20 23:43:51,694 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2080567590] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:51,694 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2037822253] [2022-02-20 23:43:51,695 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:43:51,695 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:51,695 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:51,700 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:43:51,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:43:51,787 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 23:43:51,787 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:43:51,788 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:43:51,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:51,797 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:51,884 INFO L290 TraceCheckUtils]: 0: Hoare triple {3914#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); {3914#true} is VALID [2022-02-20 23:43:51,884 INFO L290 TraceCheckUtils]: 1: Hoare triple {3914#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {3929#(= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94)} is VALID [2022-02-20 23:43:51,885 INFO L290 TraceCheckUtils]: 2: Hoare triple {3929#(= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {3929#(= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94)} is VALID [2022-02-20 23:43:51,885 INFO L290 TraceCheckUtils]: 3: Hoare triple {3929#(= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {3936#(and (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0))} is VALID [2022-02-20 23:43:51,886 INFO L290 TraceCheckUtils]: 4: Hoare triple {3936#(and (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {3915#false} is VALID [2022-02-20 23:43:51,886 INFO L290 TraceCheckUtils]: 5: Hoare triple {3915#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {3915#false} is VALID [2022-02-20 23:43:51,886 INFO L290 TraceCheckUtils]: 6: Hoare triple {3915#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {3915#false} is VALID [2022-02-20 23:43:51,887 INFO L290 TraceCheckUtils]: 7: Hoare triple {3915#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {3915#false} is VALID [2022-02-20 23:43:51,887 INFO L290 TraceCheckUtils]: 8: Hoare triple {3915#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {3915#false} is VALID [2022-02-20 23:43:51,888 INFO L290 TraceCheckUtils]: 9: Hoare triple {3915#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {3915#false} is VALID [2022-02-20 23:43:51,888 INFO L290 TraceCheckUtils]: 10: Hoare triple {3915#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {3915#false} is VALID [2022-02-20 23:43:51,888 INFO L290 TraceCheckUtils]: 11: Hoare triple {3915#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {3915#false} is VALID [2022-02-20 23:43:51,888 INFO L290 TraceCheckUtils]: 12: Hoare triple {3915#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {3915#false} is VALID [2022-02-20 23:43:51,890 INFO L290 TraceCheckUtils]: 13: Hoare triple {3915#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {3915#false} is VALID [2022-02-20 23:43:51,891 INFO L290 TraceCheckUtils]: 14: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3915#false} is VALID [2022-02-20 23:43:51,897 INFO L290 TraceCheckUtils]: 15: Hoare triple {3915#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3915#false} is VALID [2022-02-20 23:43:51,898 INFO L290 TraceCheckUtils]: 16: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3915#false} is VALID [2022-02-20 23:43:51,898 INFO L290 TraceCheckUtils]: 17: Hoare triple {3915#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3915#false} is VALID [2022-02-20 23:43:51,898 INFO L290 TraceCheckUtils]: 18: Hoare triple {3915#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3915#false} is VALID [2022-02-20 23:43:51,898 INFO L290 TraceCheckUtils]: 19: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3915#false} is VALID [2022-02-20 23:43:51,898 INFO L290 TraceCheckUtils]: 20: Hoare triple {3915#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3915#false} is VALID [2022-02-20 23:43:51,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3915#false} is VALID [2022-02-20 23:43:51,899 INFO L290 TraceCheckUtils]: 22: Hoare triple {3915#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3915#false} is VALID [2022-02-20 23:43:51,899 INFO L290 TraceCheckUtils]: 23: Hoare triple {3915#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3915#false} is VALID [2022-02-20 23:43:51,899 INFO L290 TraceCheckUtils]: 24: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3915#false} is VALID [2022-02-20 23:43:51,903 INFO L290 TraceCheckUtils]: 25: Hoare triple {3915#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3915#false} is VALID [2022-02-20 23:43:51,903 INFO L290 TraceCheckUtils]: 26: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {3915#false} is VALID [2022-02-20 23:43:51,903 INFO L290 TraceCheckUtils]: 27: Hoare triple {3915#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {3915#false} is VALID [2022-02-20 23:43:51,903 INFO L290 TraceCheckUtils]: 28: Hoare triple {3915#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {3915#false} is VALID [2022-02-20 23:43:51,903 INFO L290 TraceCheckUtils]: 29: Hoare triple {3915#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {3915#false} is VALID [2022-02-20 23:43:51,904 INFO L290 TraceCheckUtils]: 30: Hoare triple {3915#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {3915#false} is VALID [2022-02-20 23:43:51,904 INFO L290 TraceCheckUtils]: 31: Hoare triple {3915#false} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {3915#false} is VALID [2022-02-20 23:43:51,904 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 24 trivial. 0 not checked. [2022-02-20 23:43:51,904 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:43:51,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2037822253] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:43:51,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:43:51,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [9] total 11 [2022-02-20 23:43:51,905 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434309422] [2022-02-20 23:43:51,905 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:43:51,905 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 32 [2022-02-20 23:43:51,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:51,906 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:43:51,920 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:43:51,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:43:51,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:51,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:43:51,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:43:51,922 INFO L87 Difference]: Start difference. First operand 56 states and 63 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:43:51,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:51,983 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-02-20 23:43:51,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:43:51,984 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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 32 [2022-02-20 23:43:51,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:51,984 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:43:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 23:43:51,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:43:51,985 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 47 transitions. [2022-02-20 23:43:51,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 47 transitions. [2022-02-20 23:43:52,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 47 edges. 47 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:52,023 INFO L225 Difference]: With dead ends: 57 [2022-02-20 23:43:52,024 INFO L226 Difference]: Without dead ends: 57 [2022-02-20 23:43:52,024 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=24, Invalid=86, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:43:52,024 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 37 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 39 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 9 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:52,025 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [39 Valid, 81 Invalid, 9 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:43:52,025 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2022-02-20 23:43:52,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2022-02-20 23:43:52,027 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:52,027 INFO L82 GeneralOperation]: Start isEquivalent. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:52,027 INFO L74 IsIncluded]: Start isIncluded. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:52,027 INFO L87 Difference]: Start difference. First operand 57 states. Second operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:52,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,029 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-02-20 23:43:52,029 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:43:52,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,029 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 23:43:52,030 INFO L87 Difference]: Start difference. First operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 57 states. [2022-02-20 23:43:52,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:52,031 INFO L93 Difference]: Finished difference Result 57 states and 64 transitions. [2022-02-20 23:43:52,031 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:43:52,031 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:52,031 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:52,031 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:52,031 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:52,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 51 states have (on average 1.1764705882352942) internal successors, (60), 55 states have internal predecessors, (60), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:52,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 64 transitions. [2022-02-20 23:43:52,033 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 64 transitions. Word has length 32 [2022-02-20 23:43:52,033 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:52,033 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 64 transitions. [2022-02-20 23:43:52,033 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 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:43:52,033 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 64 transitions. [2022-02-20 23:43:52,034 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:43:52,034 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:52,034 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:52,060 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:52,257 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2022-02-20 23:43:52,258 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:52,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:52,258 INFO L85 PathProgramCache]: Analyzing trace with hash 1203352596, now seen corresponding path program 1 times [2022-02-20 23:43:52,258 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:52,258 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [148127523] [2022-02-20 23:43:52,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:52,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,381 INFO L290 TraceCheckUtils]: 0: Hoare triple {4248#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); {4248#true} is VALID [2022-02-20 23:43:52,381 INFO L290 TraceCheckUtils]: 1: Hoare triple {4248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {4248#true} is VALID [2022-02-20 23:43:52,381 INFO L290 TraceCheckUtils]: 2: Hoare triple {4248#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4248#true} is VALID [2022-02-20 23:43:52,382 INFO L290 TraceCheckUtils]: 3: Hoare triple {4248#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4248#true} is VALID [2022-02-20 23:43:52,382 INFO L290 TraceCheckUtils]: 4: Hoare triple {4248#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4248#true} is VALID [2022-02-20 23:43:52,382 INFO L290 TraceCheckUtils]: 5: Hoare triple {4248#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4248#true} is VALID [2022-02-20 23:43:52,382 INFO L290 TraceCheckUtils]: 6: Hoare triple {4248#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4248#true} is VALID [2022-02-20 23:43:52,383 INFO L290 TraceCheckUtils]: 7: Hoare triple {4248#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,384 INFO L290 TraceCheckUtils]: 8: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,384 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,385 INFO L290 TraceCheckUtils]: 10: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,386 INFO L290 TraceCheckUtils]: 11: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,387 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,387 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:52,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,388 INFO L290 TraceCheckUtils]: 15: Hoare triple {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4252#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {4252#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,390 INFO L290 TraceCheckUtils]: 17: Hoare triple {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,390 INFO L290 TraceCheckUtils]: 18: Hoare triple {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:52,391 INFO L290 TraceCheckUtils]: 19: Hoare triple {4251#(and (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:52,391 INFO L290 TraceCheckUtils]: 20: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:52,392 INFO L290 TraceCheckUtils]: 21: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:52,392 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:52,393 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:52,393 INFO L290 TraceCheckUtils]: 24: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:52,394 INFO L290 TraceCheckUtils]: 25: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:52,394 INFO L290 TraceCheckUtils]: 26: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:52,394 INFO L290 TraceCheckUtils]: 27: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:52,395 INFO L290 TraceCheckUtils]: 28: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:52,395 INFO L290 TraceCheckUtils]: 29: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4255#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:52,396 INFO L290 TraceCheckUtils]: 30: Hoare triple {4255#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4256#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:52,396 INFO L290 TraceCheckUtils]: 31: Hoare triple {4256#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4249#false} is VALID [2022-02-20 23:43:52,396 INFO L290 TraceCheckUtils]: 32: Hoare triple {4249#false} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {4249#false} is VALID [2022-02-20 23:43:52,397 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:52,397 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:52,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [148127523] [2022-02-20 23:43:52,397 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [148127523] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:52,397 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1570547660] [2022-02-20 23:43:52,397 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:52,398 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:52,398 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:52,400 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:43:52,428 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:43:52,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,499 INFO L263 TraceCheckSpWp]: Trace formula consists of 189 conjuncts, 33 conjunts are in the unsatisfiable core [2022-02-20 23:43:52,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:52,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:52,583 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:43:52,638 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,639 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:43:52,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,666 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:43:52,692 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,693 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:43:52,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:43:52,770 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,771 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:43:52,804 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:43:52,805 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:43:53,141 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:43:53,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {4248#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); {4248#true} is VALID [2022-02-20 23:43:53,178 INFO L290 TraceCheckUtils]: 1: Hoare triple {4248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,178 INFO L290 TraceCheckUtils]: 2: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,178 INFO L290 TraceCheckUtils]: 3: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,179 INFO L290 TraceCheckUtils]: 4: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,179 INFO L290 TraceCheckUtils]: 5: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:53,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {4263#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,181 INFO L290 TraceCheckUtils]: 8: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,182 INFO L290 TraceCheckUtils]: 9: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,183 INFO L290 TraceCheckUtils]: 10: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,183 INFO L290 TraceCheckUtils]: 11: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,184 INFO L290 TraceCheckUtils]: 12: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,185 INFO L290 TraceCheckUtils]: 13: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:53,185 INFO L290 TraceCheckUtils]: 14: Hoare triple {4282#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,186 INFO L290 TraceCheckUtils]: 15: Hoare triple {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,186 INFO L290 TraceCheckUtils]: 16: Hoare triple {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {4304#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 0 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,189 INFO L290 TraceCheckUtils]: 20: Hoare triple {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,189 INFO L290 TraceCheckUtils]: 21: Hoare triple {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,190 INFO L290 TraceCheckUtils]: 22: Hoare triple {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,190 INFO L290 TraceCheckUtils]: 23: Hoare triple {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,191 INFO L290 TraceCheckUtils]: 24: Hoare triple {4320#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,191 INFO L290 TraceCheckUtils]: 25: Hoare triple {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,192 INFO L290 TraceCheckUtils]: 26: Hoare triple {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,192 INFO L290 TraceCheckUtils]: 27: Hoare triple {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,193 INFO L290 TraceCheckUtils]: 28: Hoare triple {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,194 INFO L290 TraceCheckUtils]: 29: Hoare triple {4336#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4352#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 3 |ULTIMATE.start_Sum_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} is VALID [2022-02-20 23:43:53,194 INFO L290 TraceCheckUtils]: 30: Hoare triple {4352#(and (= |ULTIMATE.start_Sum_~instrs#1.offset| 0) (<= 3 |ULTIMATE.start_Sum_~i~0#1|) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) 0) 3))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4356#(and (<= 3 |ULTIMATE.start_Sum_~i~0#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3))} is VALID [2022-02-20 23:43:53,195 INFO L290 TraceCheckUtils]: 31: Hoare triple {4356#(and (<= 3 |ULTIMATE.start_Sum_~i~0#1|) (<= |ULTIMATE.start_Sum_#t~mem7#1| 3))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4249#false} is VALID [2022-02-20 23:43:53,195 INFO L290 TraceCheckUtils]: 32: Hoare triple {4249#false} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {4249#false} is VALID [2022-02-20 23:43:53,195 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:53,195 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:53,529 INFO L290 TraceCheckUtils]: 32: Hoare triple {4249#false} assume !(8 + (6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)) <= #length[Sum_~instrs#1.base] && 0 <= 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1)); {4249#false} is VALID [2022-02-20 23:43:53,529 INFO L290 TraceCheckUtils]: 31: Hoare triple {4256#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4249#false} is VALID [2022-02-20 23:43:53,530 INFO L290 TraceCheckUtils]: 30: Hoare triple {4255#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4256#(<= |ULTIMATE.start_Sum_#t~mem7#1| |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:53,530 INFO L290 TraceCheckUtils]: 29: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4255#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|)} is VALID [2022-02-20 23:43:53,531 INFO L290 TraceCheckUtils]: 28: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:53,531 INFO L290 TraceCheckUtils]: 27: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:53,532 INFO L290 TraceCheckUtils]: 26: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:53,532 INFO L290 TraceCheckUtils]: 25: Hoare triple {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:53,532 INFO L290 TraceCheckUtils]: 24: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4254#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1))} is VALID [2022-02-20 23:43:53,533 INFO L290 TraceCheckUtils]: 23: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,534 INFO L290 TraceCheckUtils]: 21: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,534 INFO L290 TraceCheckUtils]: 20: Hoare triple {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4253#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,544 INFO L290 TraceCheckUtils]: 17: Hoare triple {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,545 INFO L290 TraceCheckUtils]: 16: Hoare triple {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,546 INFO L290 TraceCheckUtils]: 15: Hoare triple {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,546 INFO L290 TraceCheckUtils]: 14: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4402#(<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 3 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:53,547 INFO L290 TraceCheckUtils]: 13: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,547 INFO L290 TraceCheckUtils]: 12: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,548 INFO L290 TraceCheckUtils]: 11: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,549 INFO L290 TraceCheckUtils]: 10: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,550 INFO L290 TraceCheckUtils]: 9: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,550 INFO L290 TraceCheckUtils]: 8: Hoare triple {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 7: Hoare triple {4248#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4250#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 6: Hoare triple {4248#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4248#true} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 5: Hoare triple {4248#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4248#true} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 4: Hoare triple {4248#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4248#true} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 3: Hoare triple {4248#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4248#true} is VALID [2022-02-20 23:43:53,551 INFO L290 TraceCheckUtils]: 2: Hoare triple {4248#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4248#true} is VALID [2022-02-20 23:43:53,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {4248#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {4248#true} is VALID [2022-02-20 23:43:53,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {4248#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); {4248#true} is VALID [2022-02-20 23:43:53,552 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:53,552 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1570547660] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:53,552 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:53,552 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 17 [2022-02-20 23:43:53,552 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1799613190] [2022-02-20 23:43:53,553 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:53,553 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:43:53,553 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:53,553 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:53,618 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:53,618 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:43:53,618 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:53,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:43:53,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=213, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:43:53,619 INFO L87 Difference]: Start difference. First operand 57 states and 64 transitions. Second operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,457 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:43:54,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:43:54,458 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2022-02-20 23:43:54,458 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:54,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2022-02-20 23:43:54,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 102 transitions. [2022-02-20 23:43:54,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 102 transitions. [2022-02-20 23:43:54,556 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 102 edges. 102 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:54,557 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:43:54,557 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:43:54,558 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 57 SyntacticMatches, 7 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 126 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=170, Invalid=480, Unknown=0, NotChecked=0, Total=650 [2022-02-20 23:43:54,558 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 173 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 235 mSolverCounterSat, 54 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 173 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 54 IncrementalHoareTripleChecker+Valid, 235 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:54,558 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [173 Valid, 325 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [54 Valid, 235 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:43:54,559 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:43:54,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 55. [2022-02-20 23:43:54,560 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:54,560 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:54,560 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:54,561 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:54,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,562 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:43:54,562 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-02-20 23:43:54,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 97 states. [2022-02-20 23:43:54,563 INFO L87 Difference]: Start difference. First operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 97 states. [2022-02-20 23:43:54,573 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:54,573 INFO L93 Difference]: Finished difference Result 97 states and 111 transitions. [2022-02-20 23:43:54,573 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 111 transitions. [2022-02-20 23:43:54,573 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:54,574 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:54,574 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:54,574 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:54,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 50 states have (on average 1.14) internal successors, (57), 53 states have internal predecessors, (57), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:54,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 61 transitions. [2022-02-20 23:43:54,576 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 61 transitions. Word has length 33 [2022-02-20 23:43:54,576 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:54,576 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 61 transitions. [2022-02-20 23:43:54,576 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 4.117647058823529) internal successors, (70), 17 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:54,576 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 61 transitions. [2022-02-20 23:43:54,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:43:54,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:54,577 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:54,596 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:54,787 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:54,788 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:54,788 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:54,788 INFO L85 PathProgramCache]: Analyzing trace with hash -149943807, now seen corresponding path program 1 times [2022-02-20 23:43:54,788 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:54,788 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1451384279] [2022-02-20 23:43:54,788 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:54,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:54,956 INFO L290 TraceCheckUtils]: 0: Hoare triple {4823#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); {4823#true} is VALID [2022-02-20 23:43:54,956 INFO L290 TraceCheckUtils]: 1: Hoare triple {4823#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {4823#true} is VALID [2022-02-20 23:43:54,956 INFO L290 TraceCheckUtils]: 2: Hoare triple {4823#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4823#true} is VALID [2022-02-20 23:43:54,956 INFO L290 TraceCheckUtils]: 3: Hoare triple {4823#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4823#true} is VALID [2022-02-20 23:43:54,957 INFO L290 TraceCheckUtils]: 4: Hoare triple {4823#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4823#true} is VALID [2022-02-20 23:43:54,957 INFO L290 TraceCheckUtils]: 5: Hoare triple {4823#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4823#true} is VALID [2022-02-20 23:43:54,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {4823#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4823#true} is VALID [2022-02-20 23:43:54,958 INFO L290 TraceCheckUtils]: 7: Hoare triple {4823#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,961 INFO L290 TraceCheckUtils]: 10: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,965 INFO L290 TraceCheckUtils]: 13: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:54,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {4825#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4826#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:54,966 INFO L290 TraceCheckUtils]: 15: Hoare triple {4826#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4827#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:54,966 INFO L290 TraceCheckUtils]: 16: Hoare triple {4827#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:54,967 INFO L290 TraceCheckUtils]: 17: Hoare triple {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:54,967 INFO L290 TraceCheckUtils]: 18: Hoare triple {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:54,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {4828#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4829#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:54,968 INFO L290 TraceCheckUtils]: 20: Hoare triple {4829#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4830#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_#t~mem7#1|)} is VALID [2022-02-20 23:43:54,968 INFO L290 TraceCheckUtils]: 21: Hoare triple {4830#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) |ULTIMATE.start_Sum_#t~mem7#1|)} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4824#false} is VALID [2022-02-20 23:43:54,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {4824#false} Sum_#res#1 := Sum_~count~0#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 23: Hoare triple {4824#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 24: Hoare triple {4824#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {4824#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {4824#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 27: Hoare triple {4824#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 28: Hoare triple {4824#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 29: Hoare triple {4824#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 30: Hoare triple {4824#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 31: Hoare triple {4824#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 32: Hoare triple {4824#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L290 TraceCheckUtils]: 33: Hoare triple {4824#false} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {4824#false} is VALID [2022-02-20 23:43:54,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:43:54,970 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:54,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1451384279] [2022-02-20 23:43:54,970 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1451384279] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:54,970 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [396126049] [2022-02-20 23:43:54,970 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:54,970 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:54,970 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:54,971 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:43:54,972 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:43:55,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,053 INFO L263 TraceCheckSpWp]: Trace formula consists of 197 conjuncts, 18 conjunts are in the unsatisfiable core [2022-02-20 23:43:55,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:55,066 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:55,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {4823#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); {4823#true} is VALID [2022-02-20 23:43:55,532 INFO L290 TraceCheckUtils]: 1: Hoare triple {4823#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {4837#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:43:55,533 INFO L290 TraceCheckUtils]: 2: Hoare triple {4837#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {4837#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:43:55,533 INFO L290 TraceCheckUtils]: 3: Hoare triple {4837#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,534 INFO L290 TraceCheckUtils]: 4: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,535 INFO L290 TraceCheckUtils]: 6: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,536 INFO L290 TraceCheckUtils]: 7: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,536 INFO L290 TraceCheckUtils]: 8: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,537 INFO L290 TraceCheckUtils]: 9: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,537 INFO L290 TraceCheckUtils]: 10: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,538 INFO L290 TraceCheckUtils]: 11: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,539 INFO L290 TraceCheckUtils]: 12: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,539 INFO L290 TraceCheckUtils]: 13: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,540 INFO L290 TraceCheckUtils]: 14: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,540 INFO L290 TraceCheckUtils]: 15: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,541 INFO L290 TraceCheckUtils]: 16: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,541 INFO L290 TraceCheckUtils]: 17: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,542 INFO L290 TraceCheckUtils]: 18: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,542 INFO L290 TraceCheckUtils]: 19: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,543 INFO L290 TraceCheckUtils]: 20: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,543 INFO L290 TraceCheckUtils]: 21: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,544 INFO L290 TraceCheckUtils]: 22: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,544 INFO L290 TraceCheckUtils]: 23: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,545 INFO L290 TraceCheckUtils]: 24: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:55,545 INFO L290 TraceCheckUtils]: 25: Hoare triple {4844#(and (<= 94 (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (<= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {4911#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:55,546 INFO L290 TraceCheckUtils]: 26: Hoare triple {4911#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:55,546 INFO L290 TraceCheckUtils]: 27: Hoare triple {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:55,547 INFO L290 TraceCheckUtils]: 28: Hoare triple {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:55,547 INFO L290 TraceCheckUtils]: 29: Hoare triple {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:55,548 INFO L290 TraceCheckUtils]: 30: Hoare triple {4915#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:43:55,549 INFO L290 TraceCheckUtils]: 31: Hoare triple {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:43:55,552 INFO L290 TraceCheckUtils]: 32: Hoare triple {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:43:55,553 INFO L290 TraceCheckUtils]: 33: Hoare triple {4928#(and (<= 94 (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|) (= |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {4824#false} is VALID [2022-02-20 23:43:55,554 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:43:55,555 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:55,994 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 23:43:55,995 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 13 treesize of output 17 [2022-02-20 23:43:56,114 INFO L290 TraceCheckUtils]: 33: Hoare triple {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {4824#false} is VALID [2022-02-20 23:43:56,114 INFO L290 TraceCheckUtils]: 32: Hoare triple {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} is VALID [2022-02-20 23:43:56,115 INFO L290 TraceCheckUtils]: 31: Hoare triple {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} is VALID [2022-02-20 23:43:56,118 INFO L290 TraceCheckUtils]: 30: Hoare triple {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {4938#(and (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 18 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset| 26) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)))} is VALID [2022-02-20 23:43:56,118 INFO L290 TraceCheckUtils]: 29: Hoare triple {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:56,119 INFO L290 TraceCheckUtils]: 28: Hoare triple {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:56,119 INFO L290 TraceCheckUtils]: 27: Hoare triple {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:56,120 INFO L290 TraceCheckUtils]: 26: Hoare triple {4961#(or (not (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|))))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {4948#(and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:43:56,121 INFO L290 TraceCheckUtils]: 25: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {4961#(or (not (<= 0 |ULTIMATE.start_Sum2_~instrs#1.offset|)) (and (<= (+ 56 (* 30 |ULTIMATE.start_Sum2_~i~1#1|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (select |#length| |ULTIMATE.start_Sum2_~instrs#1.base|)) (<= 0 (+ (* 30 |ULTIMATE.start_Sum2_~i~1#1|) 48 |ULTIMATE.start_Sum2_~instrs#1.offset|))))} is VALID [2022-02-20 23:43:56,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,122 INFO L290 TraceCheckUtils]: 20: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,123 INFO L290 TraceCheckUtils]: 19: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,123 INFO L290 TraceCheckUtils]: 18: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,123 INFO L290 TraceCheckUtils]: 16: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,124 INFO L290 TraceCheckUtils]: 15: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,124 INFO L290 TraceCheckUtils]: 14: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,124 INFO L290 TraceCheckUtils]: 13: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,125 INFO L290 TraceCheckUtils]: 12: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,125 INFO L290 TraceCheckUtils]: 11: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,125 INFO L290 TraceCheckUtils]: 10: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,126 INFO L290 TraceCheckUtils]: 9: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,126 INFO L290 TraceCheckUtils]: 8: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,126 INFO L290 TraceCheckUtils]: 7: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,126 INFO L290 TraceCheckUtils]: 6: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,127 INFO L290 TraceCheckUtils]: 5: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {5032#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {4965#(or (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) (select |#length| |ULTIMATE.start_main_~p~0#1.base|)) (< |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:56,131 INFO L290 TraceCheckUtils]: 2: Hoare triple {5032#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5032#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)))} is VALID [2022-02-20 23:43:56,131 INFO L290 TraceCheckUtils]: 1: Hoare triple {4823#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5032#(or (< |ULTIMATE.start_main_~p~0#1.offset| 0) (and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |ULTIMATE.start_main_~p~0#1.base|) (<= (+ 56 |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|)))} is VALID [2022-02-20 23:43:56,131 INFO L290 TraceCheckUtils]: 0: Hoare triple {4823#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); {4823#true} is VALID [2022-02-20 23:43:56,132 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:43:56,132 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [396126049] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:56,132 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:56,132 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 6, 6] total 18 [2022-02-20 23:43:56,132 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [515167581] [2022-02-20 23:43:56,132 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:56,133 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:43:56,133 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:56,133 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:56,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 96 edges. 96 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:56,215 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:43:56,215 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:56,219 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:43:56,219 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=255, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:43:56,219 INFO L87 Difference]: Start difference. First operand 55 states and 61 transitions. Second operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,174 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-02-20 23:43:57,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:43:57,175 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-02-20 23:43:57,175 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:57,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-02-20 23:43:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,178 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 88 transitions. [2022-02-20 23:43:57,178 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 88 transitions. [2022-02-20 23:43:57,264 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:57,266 INFO L225 Difference]: With dead ends: 79 [2022-02-20 23:43:57,266 INFO L226 Difference]: Without dead ends: 79 [2022-02-20 23:43:57,266 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 65 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 95 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=168, Invalid=588, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:43:57,267 INFO L933 BasicCegarLoop]: 23 mSDtfsCounter, 283 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 281 mSolverCounterSat, 72 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 283 SdHoareTripleChecker+Valid, 146 SdHoareTripleChecker+Invalid, 353 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 72 IncrementalHoareTripleChecker+Valid, 281 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:57,267 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [283 Valid, 146 Invalid, 353 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [72 Valid, 281 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:57,267 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2022-02-20 23:43:57,268 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 65. [2022-02-20 23:43:57,269 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:57,269 INFO L82 GeneralOperation]: Start isEquivalent. First operand 79 states. Second operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:57,269 INFO L74 IsIncluded]: Start isIncluded. First operand 79 states. Second operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:57,269 INFO L87 Difference]: Start difference. First operand 79 states. Second operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:57,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,272 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-02-20 23:43:57,272 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-02-20 23:43:57,272 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:57,272 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:57,272 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:43:57,272 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 79 states. [2022-02-20 23:43:57,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:57,274 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2022-02-20 23:43:57,274 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 88 transitions. [2022-02-20 23:43:57,274 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:57,274 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:57,274 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:57,274 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:57,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1333333333333333) internal successors, (68), 63 states have internal predecessors, (68), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:57,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 72 transitions. [2022-02-20 23:43:57,276 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 72 transitions. Word has length 34 [2022-02-20 23:43:57,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:57,276 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 72 transitions. [2022-02-20 23:43:57,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 5.333333333333333) internal successors, (96), 18 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:57,276 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 72 transitions. [2022-02-20 23:43:57,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 23:43:57,277 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:57,277 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:57,297 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:57,487 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2022-02-20 23:43:57,487 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:57,488 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:57,488 INFO L85 PathProgramCache]: Analyzing trace with hash 1336889422, now seen corresponding path program 1 times [2022-02-20 23:43:57,488 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:57,488 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [343243714] [2022-02-20 23:43:57,488 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:57,488 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:43:57,520 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 0: Hoare triple {5363#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); {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 1: Hoare triple {5363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 2: Hoare triple {5363#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {5363#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {5363#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 5: Hoare triple {5363#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5363#true} is VALID [2022-02-20 23:43:57,601 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5363#true} is VALID [2022-02-20 23:43:57,602 INFO L290 TraceCheckUtils]: 7: Hoare triple {5363#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,603 INFO L290 TraceCheckUtils]: 9: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,603 INFO L290 TraceCheckUtils]: 10: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,604 INFO L290 TraceCheckUtils]: 11: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,604 INFO L290 TraceCheckUtils]: 12: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,605 INFO L290 TraceCheckUtils]: 13: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:43:57,605 INFO L290 TraceCheckUtils]: 14: Hoare triple {5365#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {5366#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:57,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {5366#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5367#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:57,606 INFO L290 TraceCheckUtils]: 16: Hoare triple {5367#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:57,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:57,609 INFO L290 TraceCheckUtils]: 18: Hoare triple {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:43:57,609 INFO L290 TraceCheckUtils]: 19: Hoare triple {5368#(and (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,610 INFO L290 TraceCheckUtils]: 20: Hoare triple {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,610 INFO L290 TraceCheckUtils]: 21: Hoare triple {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,611 INFO L290 TraceCheckUtils]: 22: Hoare triple {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,611 INFO L290 TraceCheckUtils]: 23: Hoare triple {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,611 INFO L290 TraceCheckUtils]: 24: Hoare triple {5369#(<= (+ 2 |ULTIMATE.start_Sum_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5370#(<= (+ |ULTIMATE.start_Sum_~i~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:43:57,612 INFO L290 TraceCheckUtils]: 25: Hoare triple {5370#(<= (+ |ULTIMATE.start_Sum_~i~0#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5371#(<= (+ |ULTIMATE.start_Sum_~i~0#1| 1) |ULTIMATE.start_Sum_#t~mem7#1|)} is VALID [2022-02-20 23:43:57,612 INFO L290 TraceCheckUtils]: 26: Hoare triple {5371#(<= (+ |ULTIMATE.start_Sum_~i~0#1| 1) |ULTIMATE.start_Sum_#t~mem7#1|)} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5364#false} is VALID [2022-02-20 23:43:57,612 INFO L290 TraceCheckUtils]: 27: Hoare triple {5364#false} Sum_#res#1 := Sum_~count~0#1; {5364#false} is VALID [2022-02-20 23:43:57,612 INFO L290 TraceCheckUtils]: 28: Hoare triple {5364#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {5364#false} is VALID [2022-02-20 23:43:57,612 INFO L290 TraceCheckUtils]: 29: Hoare triple {5364#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 30: Hoare triple {5364#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 31: Hoare triple {5364#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 32: Hoare triple {5364#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 33: Hoare triple {5364#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 34: Hoare triple {5364#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 35: Hoare triple {5364#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 36: Hoare triple {5364#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 37: Hoare triple {5364#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 38: Hoare triple {5364#false} Sum2_#res#1 := Sum2_~count~1#1; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 39: Hoare triple {5364#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5364#false} is VALID [2022-02-20 23:43:57,613 INFO L290 TraceCheckUtils]: 40: Hoare triple {5364#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5364#false} is VALID [2022-02-20 23:43:57,614 INFO L290 TraceCheckUtils]: 41: Hoare triple {5364#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5364#false} is VALID [2022-02-20 23:43:57,614 INFO L290 TraceCheckUtils]: 42: Hoare triple {5364#false} assume !(#valid == main_old_#valid#1); {5364#false} is VALID [2022-02-20 23:43:57,614 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:43:57,614 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:43:57,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [343243714] [2022-02-20 23:43:57,614 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [343243714] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:43:57,614 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [862751237] [2022-02-20 23:43:57,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:57,615 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:57,615 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:43:57,617 INFO L229 MonitoredProcess]: Starting monitored process 6 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:43:57,618 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-02-20 23:43:57,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:57,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 23:43:57,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:43:57,714 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:43:57,761 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 6 treesize of output 5 [2022-02-20 23:43:58,133 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:43:58,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {5363#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); {5363#true} is VALID [2022-02-20 23:43:58,171 INFO L290 TraceCheckUtils]: 1: Hoare triple {5363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,172 INFO L290 TraceCheckUtils]: 3: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,173 INFO L290 TraceCheckUtils]: 6: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,173 INFO L290 TraceCheckUtils]: 7: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,173 INFO L290 TraceCheckUtils]: 8: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,174 INFO L290 TraceCheckUtils]: 9: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,174 INFO L290 TraceCheckUtils]: 10: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,174 INFO L290 TraceCheckUtils]: 11: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,175 INFO L290 TraceCheckUtils]: 12: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,175 INFO L290 TraceCheckUtils]: 13: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:43:58,175 INFO L290 TraceCheckUtils]: 14: Hoare triple {5378#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,176 INFO L290 TraceCheckUtils]: 15: Hoare triple {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,176 INFO L290 TraceCheckUtils]: 16: Hoare triple {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,177 INFO L290 TraceCheckUtils]: 17: Hoare triple {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {5418#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5434#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:58,179 INFO L290 TraceCheckUtils]: 20: Hoare triple {5434#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5438#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= |ULTIMATE.start_Sum_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:43:58,179 INFO L290 TraceCheckUtils]: 21: Hoare triple {5438#(and (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= |ULTIMATE.start_Sum_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,180 INFO L290 TraceCheckUtils]: 22: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,180 INFO L290 TraceCheckUtils]: 23: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,181 INFO L290 TraceCheckUtils]: 24: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,181 INFO L290 TraceCheckUtils]: 25: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,182 INFO L290 TraceCheckUtils]: 26: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,182 INFO L290 TraceCheckUtils]: 27: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,183 INFO L290 TraceCheckUtils]: 28: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,183 INFO L290 TraceCheckUtils]: 29: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:43:58,184 INFO L290 TraceCheckUtils]: 30: Hoare triple {5442#(and (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:58,184 INFO L290 TraceCheckUtils]: 31: Hoare triple {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:58,185 INFO L290 TraceCheckUtils]: 32: Hoare triple {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:58,185 INFO L290 TraceCheckUtils]: 33: Hoare triple {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:58,186 INFO L290 TraceCheckUtils]: 34: Hoare triple {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:43:58,187 INFO L290 TraceCheckUtils]: 35: Hoare triple {5470#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5486#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:43:58,187 INFO L290 TraceCheckUtils]: 36: Hoare triple {5486#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 1 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5490#(and (< 1 |ULTIMATE.start_Sum2_#t~mem10#1|) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 37: Hoare triple {5490#(and (< 1 |ULTIMATE.start_Sum2_#t~mem10#1|) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5364#false} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 38: Hoare triple {5364#false} Sum2_#res#1 := Sum2_~count~1#1; {5364#false} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 39: Hoare triple {5364#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5364#false} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 40: Hoare triple {5364#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5364#false} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 41: Hoare triple {5364#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5364#false} is VALID [2022-02-20 23:43:58,188 INFO L290 TraceCheckUtils]: 42: Hoare triple {5364#false} assume !(#valid == main_old_#valid#1); {5364#false} is VALID [2022-02-20 23:43:58,189 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 1 proven. 10 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:58,189 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:43:58,514 INFO L290 TraceCheckUtils]: 42: Hoare triple {5364#false} assume !(#valid == main_old_#valid#1); {5364#false} is VALID [2022-02-20 23:43:58,515 INFO L290 TraceCheckUtils]: 41: Hoare triple {5364#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5364#false} is VALID [2022-02-20 23:43:58,515 INFO L290 TraceCheckUtils]: 40: Hoare triple {5364#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5364#false} is VALID [2022-02-20 23:43:58,515 INFO L290 TraceCheckUtils]: 39: Hoare triple {5364#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5364#false} is VALID [2022-02-20 23:43:58,515 INFO L290 TraceCheckUtils]: 38: Hoare triple {5364#false} Sum2_#res#1 := Sum2_~count~1#1; {5364#false} is VALID [2022-02-20 23:43:58,516 INFO L290 TraceCheckUtils]: 37: Hoare triple {5524#(< |ULTIMATE.start_Sum2_~i~1#1| |ULTIMATE.start_Sum2_#t~mem10#1|)} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5364#false} is VALID [2022-02-20 23:43:58,516 INFO L290 TraceCheckUtils]: 36: Hoare triple {5528#(< |ULTIMATE.start_Sum2_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5524#(< |ULTIMATE.start_Sum2_~i~1#1| |ULTIMATE.start_Sum2_#t~mem10#1|)} is VALID [2022-02-20 23:43:58,517 INFO L290 TraceCheckUtils]: 35: Hoare triple {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5528#(< |ULTIMATE.start_Sum2_~i~1#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,518 INFO L290 TraceCheckUtils]: 34: Hoare triple {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,518 INFO L290 TraceCheckUtils]: 33: Hoare triple {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,518 INFO L290 TraceCheckUtils]: 32: Hoare triple {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,520 INFO L290 TraceCheckUtils]: 31: Hoare triple {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,521 INFO L290 TraceCheckUtils]: 30: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {5532#(< (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:43:58,521 INFO L290 TraceCheckUtils]: 29: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,521 INFO L290 TraceCheckUtils]: 28: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,522 INFO L290 TraceCheckUtils]: 27: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#res#1 := Sum_~count~0#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,522 INFO L290 TraceCheckUtils]: 26: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,523 INFO L290 TraceCheckUtils]: 25: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,523 INFO L290 TraceCheckUtils]: 24: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,524 INFO L290 TraceCheckUtils]: 23: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,524 INFO L290 TraceCheckUtils]: 22: Hoare triple {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,525 INFO L290 TraceCheckUtils]: 21: Hoare triple {5576#(or (not (< |ULTIMATE.start_Sum_~i~0#1| |ULTIMATE.start_Sum_#t~mem7#1|)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5548#(< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:43:58,525 INFO L290 TraceCheckUtils]: 20: Hoare triple {5580#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5576#(or (not (< |ULTIMATE.start_Sum_~i~0#1| |ULTIMATE.start_Sum_#t~mem7#1|)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,526 INFO L290 TraceCheckUtils]: 19: Hoare triple {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5580#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,527 INFO L290 TraceCheckUtils]: 18: Hoare triple {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,528 INFO L290 TraceCheckUtils]: 16: Hoare triple {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,529 INFO L290 TraceCheckUtils]: 14: Hoare triple {5363#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {5584#(or (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)) (< 1 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:43:58,529 INFO L290 TraceCheckUtils]: 13: Hoare triple {5363#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5363#true} is VALID [2022-02-20 23:43:58,529 INFO L290 TraceCheckUtils]: 12: Hoare triple {5363#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {5363#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {5363#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {5363#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {5363#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {5363#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 6: Hoare triple {5363#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5363#true} is VALID [2022-02-20 23:43:58,530 INFO L290 TraceCheckUtils]: 5: Hoare triple {5363#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5363#true} is VALID [2022-02-20 23:43:58,531 INFO L290 TraceCheckUtils]: 4: Hoare triple {5363#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5363#true} is VALID [2022-02-20 23:43:58,531 INFO L290 TraceCheckUtils]: 3: Hoare triple {5363#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5363#true} is VALID [2022-02-20 23:43:58,531 INFO L290 TraceCheckUtils]: 2: Hoare triple {5363#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5363#true} is VALID [2022-02-20 23:43:58,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {5363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5363#true} is VALID [2022-02-20 23:43:58,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {5363#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); {5363#true} is VALID [2022-02-20 23:43:58,532 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 8 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:43:58,532 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [862751237] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:43:58,532 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:43:58,532 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 24 [2022-02-20 23:43:58,533 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2140750956] [2022-02-20 23:43:58,533 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:43:58,535 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 23:43:58,535 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:43:58,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:58,617 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:43:58,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2022-02-20 23:43:58,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:43:58,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2022-02-20 23:43:58,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=469, Unknown=0, NotChecked=0, Total=552 [2022-02-20 23:43:58,618 INFO L87 Difference]: Start difference. First operand 65 states and 72 transitions. Second operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:59,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:59,698 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-02-20 23:43:59,698 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:43:59,698 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2022-02-20 23:43:59,698 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:43:59,699 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:59,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-02-20 23:43:59,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:59,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 67 transitions. [2022-02-20 23:43:59,701 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 67 transitions. [2022-02-20 23:43:59,759 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 67 edges. 67 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:43:59,759 INFO L225 Difference]: With dead ends: 65 [2022-02-20 23:43:59,759 INFO L226 Difference]: Without dead ends: 65 [2022-02-20 23:43:59,760 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 77 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 236 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=293, Invalid=1039, Unknown=0, NotChecked=0, Total=1332 [2022-02-20 23:43:59,760 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 140 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 250 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 216 SdHoareTripleChecker+Invalid, 332 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 250 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:43:59,761 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [140 Valid, 216 Invalid, 332 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 250 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:43:59,761 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2022-02-20 23:43:59,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2022-02-20 23:43:59,763 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:43:59,763 INFO L82 GeneralOperation]: Start isEquivalent. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:59,763 INFO L74 IsIncluded]: Start isIncluded. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:59,763 INFO L87 Difference]: Start difference. First operand 65 states. Second operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:59,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:59,764 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-02-20 23:43:59,764 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-02-20 23:43:59,764 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:59,764 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:59,765 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 23:43:59,765 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 65 states. [2022-02-20 23:43:59,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:43:59,766 INFO L93 Difference]: Finished difference Result 65 states and 70 transitions. [2022-02-20 23:43:59,766 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-02-20 23:43:59,766 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:43:59,766 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:43:59,766 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:43:59,766 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:43:59,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.1) internal successors, (66), 63 states have internal predecessors, (66), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:43:59,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 70 transitions. [2022-02-20 23:43:59,767 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 70 transitions. Word has length 43 [2022-02-20 23:43:59,767 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:43:59,767 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 70 transitions. [2022-02-20 23:43:59,768 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 4.583333333333333) internal successors, (110), 24 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:43:59,768 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 70 transitions. [2022-02-20 23:43:59,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2022-02-20 23:43:59,768 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:43:59,768 INFO L514 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:43:59,789 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:43:59,983 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:43:59,984 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:43:59,984 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:43:59,984 INFO L85 PathProgramCache]: Analyzing trace with hash -990509317, now seen corresponding path program 2 times [2022-02-20 23:43:59,984 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:43:59,984 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353908065] [2022-02-20 23:43:59,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:43:59,985 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:00,016 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:00,156 INFO L290 TraceCheckUtils]: 0: Hoare triple {5927#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); {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 1: Hoare triple {5927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 2: Hoare triple {5927#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 3: Hoare triple {5927#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 4: Hoare triple {5927#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 5: Hoare triple {5927#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5927#true} is VALID [2022-02-20 23:44:00,157 INFO L290 TraceCheckUtils]: 6: Hoare triple {5927#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5927#true} is VALID [2022-02-20 23:44:00,158 INFO L290 TraceCheckUtils]: 7: Hoare triple {5927#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,158 INFO L290 TraceCheckUtils]: 8: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,159 INFO L290 TraceCheckUtils]: 9: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,160 INFO L290 TraceCheckUtils]: 10: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,160 INFO L290 TraceCheckUtils]: 11: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,161 INFO L290 TraceCheckUtils]: 12: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,162 INFO L290 TraceCheckUtils]: 13: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:00,162 INFO L290 TraceCheckUtils]: 14: Hoare triple {5929#(= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {5930#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,163 INFO L290 TraceCheckUtils]: 15: Hoare triple {5930#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) 3) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5931#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,163 INFO L290 TraceCheckUtils]: 16: Hoare triple {5931#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= (+ (- 3) |ULTIMATE.start_Sum_#t~mem7#1|) 0) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,164 INFO L290 TraceCheckUtils]: 17: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,166 INFO L290 TraceCheckUtils]: 20: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,166 INFO L290 TraceCheckUtils]: 21: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,167 INFO L290 TraceCheckUtils]: 22: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,167 INFO L290 TraceCheckUtils]: 23: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,168 INFO L290 TraceCheckUtils]: 24: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,168 INFO L290 TraceCheckUtils]: 25: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,169 INFO L290 TraceCheckUtils]: 26: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,169 INFO L290 TraceCheckUtils]: 27: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,170 INFO L290 TraceCheckUtils]: 28: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,170 INFO L290 TraceCheckUtils]: 29: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,171 INFO L290 TraceCheckUtils]: 30: Hoare triple {5932#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:00,171 INFO L290 TraceCheckUtils]: 31: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:00,171 INFO L290 TraceCheckUtils]: 32: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#res#1 := Sum_~count~0#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:00,172 INFO L290 TraceCheckUtils]: 33: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:00,172 INFO L290 TraceCheckUtils]: 34: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:00,173 INFO L290 TraceCheckUtils]: 35: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,173 INFO L290 TraceCheckUtils]: 36: Hoare triple {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5935#(and (<= 3 |ULTIMATE.start_Sum2_#t~mem10#1|) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,174 INFO L290 TraceCheckUtils]: 37: Hoare triple {5935#(and (<= 3 |ULTIMATE.start_Sum2_#t~mem10#1|) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,174 INFO L290 TraceCheckUtils]: 38: Hoare triple {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,174 INFO L290 TraceCheckUtils]: 39: Hoare triple {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:00,175 INFO L290 TraceCheckUtils]: 40: Hoare triple {5934#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= 3 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,175 INFO L290 TraceCheckUtils]: 41: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,176 INFO L290 TraceCheckUtils]: 42: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,176 INFO L290 TraceCheckUtils]: 43: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,176 INFO L290 TraceCheckUtils]: 44: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,177 INFO L290 TraceCheckUtils]: 45: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5937#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:00,177 INFO L290 TraceCheckUtils]: 46: Hoare triple {5937#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5938#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) |ULTIMATE.start_Sum2_#t~mem10#1|)} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 47: Hoare triple {5938#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) |ULTIMATE.start_Sum2_#t~mem10#1|)} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5928#false} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 48: Hoare triple {5928#false} Sum2_#res#1 := Sum2_~count~1#1; {5928#false} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 49: Hoare triple {5928#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5928#false} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 50: Hoare triple {5928#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5928#false} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 51: Hoare triple {5928#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5928#false} is VALID [2022-02-20 23:44:00,178 INFO L290 TraceCheckUtils]: 52: Hoare triple {5928#false} assume !(#valid == main_old_#valid#1); {5928#false} is VALID [2022-02-20 23:44:00,179 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 14 trivial. 0 not checked. [2022-02-20 23:44:00,179 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:00,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353908065] [2022-02-20 23:44:00,179 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353908065] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:00,179 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [468391580] [2022-02-20 23:44:00,179 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:44:00,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:00,179 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:00,180 INFO L229 MonitoredProcess]: Starting monitored process 7 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:44:00,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-02-20 23:44:00,306 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:44:00,307 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:00,308 INFO L263 TraceCheckSpWp]: Trace formula consists of 262 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:44:00,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:00,326 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:00,373 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 6 treesize of output 5 [2022-02-20 23:44:00,925 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:44:00,983 INFO L290 TraceCheckUtils]: 0: Hoare triple {5927#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); {5927#true} is VALID [2022-02-20 23:44:00,984 INFO L290 TraceCheckUtils]: 1: Hoare triple {5927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,984 INFO L290 TraceCheckUtils]: 2: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,984 INFO L290 TraceCheckUtils]: 3: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,985 INFO L290 TraceCheckUtils]: 4: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,985 INFO L290 TraceCheckUtils]: 5: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,986 INFO L290 TraceCheckUtils]: 6: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,986 INFO L290 TraceCheckUtils]: 7: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,986 INFO L290 TraceCheckUtils]: 8: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,987 INFO L290 TraceCheckUtils]: 9: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,987 INFO L290 TraceCheckUtils]: 10: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,988 INFO L290 TraceCheckUtils]: 11: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,988 INFO L290 TraceCheckUtils]: 12: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,988 INFO L290 TraceCheckUtils]: 13: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:00,989 INFO L290 TraceCheckUtils]: 14: Hoare triple {5945#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,990 INFO L290 TraceCheckUtils]: 15: Hoare triple {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,991 INFO L290 TraceCheckUtils]: 17: Hoare triple {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,991 INFO L290 TraceCheckUtils]: 18: Hoare triple {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,992 INFO L290 TraceCheckUtils]: 19: Hoare triple {5985#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (<= 0 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:00,993 INFO L290 TraceCheckUtils]: 20: Hoare triple {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:00,993 INFO L290 TraceCheckUtils]: 21: Hoare triple {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:00,994 INFO L290 TraceCheckUtils]: 22: Hoare triple {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:00,994 INFO L290 TraceCheckUtils]: 23: Hoare triple {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:00,995 INFO L290 TraceCheckUtils]: 24: Hoare triple {6001#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= 1 |ULTIMATE.start_Sum_~i~0#1|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6017#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,996 INFO L290 TraceCheckUtils]: 25: Hoare triple {6017#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6021#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= |ULTIMATE.start_Sum_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:44:00,996 INFO L290 TraceCheckUtils]: 26: Hoare triple {6021#(and (<= 2 |ULTIMATE.start_Sum_~i~0#1|) (= |ULTIMATE.start_main_~p~0#1.offset| 0) (<= |ULTIMATE.start_Sum_#t~mem7#1| (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,997 INFO L290 TraceCheckUtils]: 27: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,998 INFO L290 TraceCheckUtils]: 28: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,998 INFO L290 TraceCheckUtils]: 29: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,999 INFO L290 TraceCheckUtils]: 30: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,999 INFO L290 TraceCheckUtils]: 31: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:00,999 INFO L290 TraceCheckUtils]: 32: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:01,000 INFO L290 TraceCheckUtils]: 33: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:01,000 INFO L290 TraceCheckUtils]: 34: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:01,001 INFO L290 TraceCheckUtils]: 35: Hoare triple {6025#(and (< 2 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:44:01,001 INFO L290 TraceCheckUtils]: 36: Hoare triple {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:44:01,002 INFO L290 TraceCheckUtils]: 37: Hoare triple {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:44:01,002 INFO L290 TraceCheckUtils]: 38: Hoare triple {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:44:01,003 INFO L290 TraceCheckUtils]: 39: Hoare triple {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} is VALID [2022-02-20 23:44:01,003 INFO L290 TraceCheckUtils]: 40: Hoare triple {6053#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 0))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:01,004 INFO L290 TraceCheckUtils]: 41: Hoare triple {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:01,004 INFO L290 TraceCheckUtils]: 42: Hoare triple {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:01,004 INFO L290 TraceCheckUtils]: 43: Hoare triple {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:01,005 INFO L290 TraceCheckUtils]: 44: Hoare triple {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:01,005 INFO L290 TraceCheckUtils]: 45: Hoare triple {6069#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6085#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 2))} is VALID [2022-02-20 23:44:01,006 INFO L290 TraceCheckUtils]: 46: Hoare triple {6085#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (< 2 (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)) (<= |ULTIMATE.start_Sum2_~i~1#1| 2))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6089#(and (< 2 |ULTIMATE.start_Sum2_#t~mem10#1|) (<= |ULTIMATE.start_Sum2_~i~1#1| 2))} is VALID [2022-02-20 23:44:01,006 INFO L290 TraceCheckUtils]: 47: Hoare triple {6089#(and (< 2 |ULTIMATE.start_Sum2_#t~mem10#1|) (<= |ULTIMATE.start_Sum2_~i~1#1| 2))} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5928#false} is VALID [2022-02-20 23:44:01,006 INFO L290 TraceCheckUtils]: 48: Hoare triple {5928#false} Sum2_#res#1 := Sum2_~count~1#1; {5928#false} is VALID [2022-02-20 23:44:01,006 INFO L290 TraceCheckUtils]: 49: Hoare triple {5928#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5928#false} is VALID [2022-02-20 23:44:01,007 INFO L290 TraceCheckUtils]: 50: Hoare triple {5928#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5928#false} is VALID [2022-02-20 23:44:01,007 INFO L290 TraceCheckUtils]: 51: Hoare triple {5928#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5928#false} is VALID [2022-02-20 23:44:01,007 INFO L290 TraceCheckUtils]: 52: Hoare triple {5928#false} assume !(#valid == main_old_#valid#1); {5928#false} is VALID [2022-02-20 23:44:01,007 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 7 proven. 23 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:44:01,007 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:01,491 INFO L290 TraceCheckUtils]: 52: Hoare triple {5928#false} assume !(#valid == main_old_#valid#1); {5928#false} is VALID [2022-02-20 23:44:01,491 INFO L290 TraceCheckUtils]: 51: Hoare triple {5928#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {5928#false} is VALID [2022-02-20 23:44:01,491 INFO L290 TraceCheckUtils]: 50: Hoare triple {5928#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {5928#false} is VALID [2022-02-20 23:44:01,491 INFO L290 TraceCheckUtils]: 49: Hoare triple {5928#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {5928#false} is VALID [2022-02-20 23:44:01,491 INFO L290 TraceCheckUtils]: 48: Hoare triple {5928#false} Sum2_#res#1 := Sum2_~count~1#1; {5928#false} is VALID [2022-02-20 23:44:01,492 INFO L290 TraceCheckUtils]: 47: Hoare triple {5938#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) |ULTIMATE.start_Sum2_#t~mem10#1|)} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5928#false} is VALID [2022-02-20 23:44:01,492 INFO L290 TraceCheckUtils]: 46: Hoare triple {5937#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5938#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) |ULTIMATE.start_Sum2_#t~mem10#1|)} is VALID [2022-02-20 23:44:01,493 INFO L290 TraceCheckUtils]: 45: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5937#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 1) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,493 INFO L290 TraceCheckUtils]: 44: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,494 INFO L290 TraceCheckUtils]: 43: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,494 INFO L290 TraceCheckUtils]: 42: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,495 INFO L290 TraceCheckUtils]: 41: Hoare triple {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,495 INFO L290 TraceCheckUtils]: 40: Hoare triple {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {5936#(<= (+ 2 |ULTIMATE.start_Sum2_~i~1#1|) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,496 INFO L290 TraceCheckUtils]: 39: Hoare triple {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,496 INFO L290 TraceCheckUtils]: 38: Hoare triple {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,496 INFO L290 TraceCheckUtils]: 37: Hoare triple {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,497 INFO L290 TraceCheckUtils]: 36: Hoare triple {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,497 INFO L290 TraceCheckUtils]: 35: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {6144#(<= (+ |ULTIMATE.start_Sum2_~i~1#1| 3) (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|))} is VALID [2022-02-20 23:44:01,498 INFO L290 TraceCheckUtils]: 34: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,498 INFO L290 TraceCheckUtils]: 33: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,498 INFO L290 TraceCheckUtils]: 32: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#res#1 := Sum_~count~0#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,499 INFO L290 TraceCheckUtils]: 31: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,499 INFO L290 TraceCheckUtils]: 30: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,499 INFO L290 TraceCheckUtils]: 29: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,500 INFO L290 TraceCheckUtils]: 28: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,500 INFO L290 TraceCheckUtils]: 27: Hoare triple {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {6187#(or (not (< |ULTIMATE.start_Sum_~i~0#1| |ULTIMATE.start_Sum_#t~mem7#1|)) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {5933#(<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|))} is VALID [2022-02-20 23:44:01,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {6191#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6187#(or (not (< |ULTIMATE.start_Sum_~i~0#1| |ULTIMATE.start_Sum_#t~mem7#1|)) (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)))} is VALID [2022-02-20 23:44:01,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6191#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_~i~0#1|))} is VALID [2022-02-20 23:44:01,502 INFO L290 TraceCheckUtils]: 23: Hoare triple {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} is VALID [2022-02-20 23:44:01,503 INFO L290 TraceCheckUtils]: 22: Hoare triple {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} is VALID [2022-02-20 23:44:01,504 INFO L290 TraceCheckUtils]: 21: Hoare triple {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} is VALID [2022-02-20 23:44:01,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} is VALID [2022-02-20 23:44:01,505 INFO L290 TraceCheckUtils]: 19: Hoare triple {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6195#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ |ULTIMATE.start_Sum_~i~0#1| 1)))} is VALID [2022-02-20 23:44:01,505 INFO L290 TraceCheckUtils]: 18: Hoare triple {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} is VALID [2022-02-20 23:44:01,506 INFO L290 TraceCheckUtils]: 17: Hoare triple {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} is VALID [2022-02-20 23:44:01,506 INFO L290 TraceCheckUtils]: 16: Hoare triple {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} is VALID [2022-02-20 23:44:01,507 INFO L290 TraceCheckUtils]: 15: Hoare triple {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 14: Hoare triple {5927#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {6211#(or (<= 3 (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|)) (<= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum_~i~0#1|)))} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 13: Hoare triple {5927#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {5927#true} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 12: Hoare triple {5927#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {5927#true} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 11: Hoare triple {5927#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {5927#true} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 10: Hoare triple {5927#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {5927#true} is VALID [2022-02-20 23:44:01,508 INFO L290 TraceCheckUtils]: 9: Hoare triple {5927#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {5927#true} is VALID [2022-02-20 23:44:01,509 INFO L290 TraceCheckUtils]: 8: Hoare triple {5927#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {5927#true} is VALID [2022-02-20 23:44:01,509 INFO L290 TraceCheckUtils]: 7: Hoare triple {5927#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {5927#true} is VALID [2022-02-20 23:44:01,509 INFO L290 TraceCheckUtils]: 6: Hoare triple {5927#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 5: Hoare triple {5927#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 4: Hoare triple {5927#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 3: Hoare triple {5927#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 2: Hoare triple {5927#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 1: Hoare triple {5927#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {5927#true} is VALID [2022-02-20 23:44:01,510 INFO L290 TraceCheckUtils]: 0: Hoare triple {5927#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); {5927#true} is VALID [2022-02-20 23:44:01,511 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 19 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:44:01,511 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [468391580] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:01,511 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:01,511 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 11] total 27 [2022-02-20 23:44:01,514 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245642596] [2022-02-20 23:44:01,514 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:01,516 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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) Word has length 53 [2022-02-20 23:44:01,517 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:01,517 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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:44:01,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:01,620 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2022-02-20 23:44:01,620 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:01,621 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2022-02-20 23:44:01,621 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=577, Unknown=0, NotChecked=0, Total=702 [2022-02-20 23:44:01,621 INFO L87 Difference]: Start difference. First operand 65 states and 70 transitions. Second operand has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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:44:02,717 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:02,717 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 23:44:02,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:44:02,717 INFO L78 Accepts]: Start accepts. Automaton has has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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) Word has length 53 [2022-02-20 23:44:02,718 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:02,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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:44:02,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-02-20 23:44:02,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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:44:02,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 70 transitions. [2022-02-20 23:44:02,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 70 transitions. [2022-02-20 23:44:02,785 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:02,785 INFO L225 Difference]: With dead ends: 67 [2022-02-20 23:44:02,786 INFO L226 Difference]: Without dead ends: 67 [2022-02-20 23:44:02,786 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 96 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=421, Invalid=1219, Unknown=0, NotChecked=0, Total=1640 [2022-02-20 23:44:02,787 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 184 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 101 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 378 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 101 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:02,787 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 208 Invalid, 378 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [101 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:44:02,788 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2022-02-20 23:44:02,789 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 65. [2022-02-20 23:44:02,789 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:02,789 INFO L82 GeneralOperation]: Start isEquivalent. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:02,790 INFO L74 IsIncluded]: Start isIncluded. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:02,790 INFO L87 Difference]: Start difference. First operand 67 states. Second operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:02,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:02,791 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 23:44:02,791 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 23:44:02,791 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:02,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:02,792 INFO L74 IsIncluded]: Start isIncluded. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 23:44:02,792 INFO L87 Difference]: Start difference. First operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 67 states. [2022-02-20 23:44:02,793 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:02,793 INFO L93 Difference]: Finished difference Result 67 states and 71 transitions. [2022-02-20 23:44:02,793 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 71 transitions. [2022-02-20 23:44:02,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:02,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:02,794 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:02,794 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:02,794 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 60 states have (on average 1.0833333333333333) internal successors, (65), 63 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:02,795 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 69 transitions. [2022-02-20 23:44:02,795 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 69 transitions. Word has length 53 [2022-02-20 23:44:02,796 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:02,796 INFO L470 AbstractCegarLoop]: Abstraction has 65 states and 69 transitions. [2022-02-20 23:44:02,796 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 27 states have (on average 4.518518518518518) internal successors, (122), 27 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:44:02,796 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 69 transitions. [2022-02-20 23:44:02,796 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2022-02-20 23:44:02,796 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:02,797 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 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:44:02,823 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:03,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:03,012 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:44:03,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:03,012 INFO L85 PathProgramCache]: Analyzing trace with hash 868555041, now seen corresponding path program 2 times [2022-02-20 23:44:03,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:03,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877410269] [2022-02-20 23:44:03,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:03,012 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:03,069 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:03,302 INFO L290 TraceCheckUtils]: 0: Hoare triple {6562#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); {6562#true} is VALID [2022-02-20 23:44:03,302 INFO L290 TraceCheckUtils]: 1: Hoare triple {6562#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {6562#true} is VALID [2022-02-20 23:44:03,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {6562#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 3: Hoare triple {6562#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 4: Hoare triple {6562#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {6562#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {6562#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {6562#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {6562#true} is VALID [2022-02-20 23:44:03,303 INFO L290 TraceCheckUtils]: 8: Hoare triple {6562#true} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {6562#true} is VALID [2022-02-20 23:44:03,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {6562#true} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {6562#true} is VALID [2022-02-20 23:44:03,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {6562#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {6562#true} is VALID [2022-02-20 23:44:03,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {6562#true} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {6562#true} is VALID [2022-02-20 23:44:03,304 INFO L290 TraceCheckUtils]: 12: Hoare triple {6562#true} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {6562#true} is VALID [2022-02-20 23:44:03,304 INFO L290 TraceCheckUtils]: 13: Hoare triple {6562#true} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {6562#true} is VALID [2022-02-20 23:44:03,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {6562#true} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:44:03,305 INFO L290 TraceCheckUtils]: 15: Hoare triple {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6565#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:44:03,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {6565#(and (= (select (select |#memory_int| |ULTIMATE.start_Sum_~instrs#1.base|) |ULTIMATE.start_Sum_~instrs#1.offset|) |ULTIMATE.start_Sum_#t~mem7#1|) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:44:03,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:44:03,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} is VALID [2022-02-20 23:44:03,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {6564#(and (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|) (= |ULTIMATE.start_Sum_~i~0#1| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,309 INFO L290 TraceCheckUtils]: 21: Hoare triple {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,309 INFO L290 TraceCheckUtils]: 22: Hoare triple {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,310 INFO L290 TraceCheckUtils]: 23: Hoare triple {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,310 INFO L290 TraceCheckUtils]: 24: Hoare triple {6566#(and (<= |ULTIMATE.start_Sum_~i~0#1| 1) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,311 INFO L290 TraceCheckUtils]: 25: Hoare triple {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,313 INFO L290 TraceCheckUtils]: 28: Hoare triple {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,313 INFO L290 TraceCheckUtils]: 29: Hoare triple {6567#(and (<= |ULTIMATE.start_Sum_~i~0#1| 2) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6568#(and (<= |ULTIMATE.start_Sum_~i~0#1| 3) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} is VALID [2022-02-20 23:44:03,314 INFO L290 TraceCheckUtils]: 30: Hoare triple {6568#(and (<= |ULTIMATE.start_Sum_~i~0#1| 3) (= |ULTIMATE.start_Sum_~instrs#1.base| |ULTIMATE.start_main_~p~0#1.base|) (= |ULTIMATE.start_main_~p~0#1.offset| |ULTIMATE.start_Sum_~instrs#1.offset|))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6569#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_Sum_~i~0#1|) (+ 3 |ULTIMATE.start_Sum_#t~mem7#1|))} is VALID [2022-02-20 23:44:03,315 INFO L290 TraceCheckUtils]: 31: Hoare triple {6569#(<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) |ULTIMATE.start_Sum_~i~0#1|) (+ 3 |ULTIMATE.start_Sum_#t~mem7#1|))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:03,315 INFO L290 TraceCheckUtils]: 32: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_#res#1 := Sum_~count~0#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:03,315 INFO L290 TraceCheckUtils]: 33: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:03,316 INFO L290 TraceCheckUtils]: 34: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:03,316 INFO L290 TraceCheckUtils]: 35: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:03,317 INFO L290 TraceCheckUtils]: 36: Hoare triple {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6572#(and (<= |ULTIMATE.start_Sum2_#t~mem10#1| 3) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} is VALID [2022-02-20 23:44:03,318 INFO L290 TraceCheckUtils]: 37: Hoare triple {6572#(and (<= |ULTIMATE.start_Sum2_#t~mem10#1| 3) (= |ULTIMATE.start_Sum2_~i~1#1| 0) (= |ULTIMATE.start_Sum2_#t~mem10#1| (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|)))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:03,318 INFO L290 TraceCheckUtils]: 38: Hoare triple {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:03,319 INFO L290 TraceCheckUtils]: 39: Hoare triple {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:03,319 INFO L290 TraceCheckUtils]: 40: Hoare triple {6571#(and (= |ULTIMATE.start_Sum2_~i~1#1| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:03,320 INFO L290 TraceCheckUtils]: 41: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:03,320 INFO L290 TraceCheckUtils]: 42: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:03,321 INFO L290 TraceCheckUtils]: 43: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:03,321 INFO L290 TraceCheckUtils]: 44: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:03,322 INFO L290 TraceCheckUtils]: 45: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:03,322 INFO L290 TraceCheckUtils]: 46: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:03,322 INFO L290 TraceCheckUtils]: 47: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:03,323 INFO L290 TraceCheckUtils]: 48: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:03,323 INFO L290 TraceCheckUtils]: 49: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:03,324 INFO L290 TraceCheckUtils]: 50: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6575#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) |ULTIMATE.start_Sum2_~i~1#1|)} is VALID [2022-02-20 23:44:03,324 INFO L290 TraceCheckUtils]: 51: Hoare triple {6575#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) |ULTIMATE.start_Sum2_~i~1#1|)} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6576#(<= |ULTIMATE.start_Sum2_#t~mem10#1| |ULTIMATE.start_Sum2_~i~1#1|)} is VALID [2022-02-20 23:44:03,325 INFO L290 TraceCheckUtils]: 52: Hoare triple {6576#(<= |ULTIMATE.start_Sum2_#t~mem10#1| |ULTIMATE.start_Sum2_~i~1#1|)} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6563#false} is VALID [2022-02-20 23:44:03,325 INFO L290 TraceCheckUtils]: 53: Hoare triple {6563#false} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {6563#false} is VALID [2022-02-20 23:44:03,326 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 10 proven. 35 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:44:03,327 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:03,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877410269] [2022-02-20 23:44:03,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877410269] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:03,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [848595719] [2022-02-20 23:44:03,327 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 23:44:03,327 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:03,328 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:03,332 INFO L229 MonitoredProcess]: Starting monitored process 8 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:44:03,359 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-02-20 23:44:03,470 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 23:44:03,470 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:03,472 INFO L263 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:44:03,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:03,495 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:03,551 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:44:03,587 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,588 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:44:03,619 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,620 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:44:03,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,648 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:44:03,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,672 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:44:03,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,698 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:44:03,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:44:03,723 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 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:44:04,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:44:04,236 INFO L290 TraceCheckUtils]: 0: Hoare triple {6562#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); {6562#true} is VALID [2022-02-20 23:44:04,236 INFO L290 TraceCheckUtils]: 1: Hoare triple {6562#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,237 INFO L290 TraceCheckUtils]: 2: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,237 INFO L290 TraceCheckUtils]: 3: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,237 INFO L290 TraceCheckUtils]: 4: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,238 INFO L290 TraceCheckUtils]: 5: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,238 INFO L290 TraceCheckUtils]: 6: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} is VALID [2022-02-20 23:44:04,239 INFO L290 TraceCheckUtils]: 7: Hoare triple {6583#(= |ULTIMATE.start_main_~p~0#1.offset| 0)} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,240 INFO L290 TraceCheckUtils]: 9: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,242 INFO L290 TraceCheckUtils]: 11: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,242 INFO L290 TraceCheckUtils]: 12: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,243 INFO L290 TraceCheckUtils]: 13: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,244 INFO L290 TraceCheckUtils]: 15: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,245 INFO L290 TraceCheckUtils]: 16: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,246 INFO L290 TraceCheckUtils]: 18: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,246 INFO L290 TraceCheckUtils]: 19: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,247 INFO L290 TraceCheckUtils]: 20: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,247 INFO L290 TraceCheckUtils]: 21: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,248 INFO L290 TraceCheckUtils]: 22: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,248 INFO L290 TraceCheckUtils]: 23: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,249 INFO L290 TraceCheckUtils]: 24: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,249 INFO L290 TraceCheckUtils]: 25: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,251 INFO L290 TraceCheckUtils]: 28: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,251 INFO L290 TraceCheckUtils]: 29: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,252 INFO L290 TraceCheckUtils]: 30: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,252 INFO L290 TraceCheckUtils]: 31: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,253 INFO L290 TraceCheckUtils]: 32: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} Sum_#res#1 := Sum_~count~0#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,253 INFO L290 TraceCheckUtils]: 33: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,254 INFO L290 TraceCheckUtils]: 34: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} is VALID [2022-02-20 23:44:04,254 INFO L290 TraceCheckUtils]: 35: Hoare triple {6602#(and (<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3) (= |ULTIMATE.start_main_~p~0#1.offset| 0))} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,255 INFO L290 TraceCheckUtils]: 36: Hoare triple {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,256 INFO L290 TraceCheckUtils]: 37: Hoare triple {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,256 INFO L290 TraceCheckUtils]: 38: Hoare triple {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,257 INFO L290 TraceCheckUtils]: 39: Hoare triple {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,257 INFO L290 TraceCheckUtils]: 40: Hoare triple {6687#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3) (<= 0 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 41: Hoare triple {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,258 INFO L290 TraceCheckUtils]: 42: Hoare triple {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 43: Hoare triple {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,259 INFO L290 TraceCheckUtils]: 44: Hoare triple {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,260 INFO L290 TraceCheckUtils]: 45: Hoare triple {6703#(and (<= 1 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,261 INFO L290 TraceCheckUtils]: 46: Hoare triple {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,261 INFO L290 TraceCheckUtils]: 47: Hoare triple {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,262 INFO L290 TraceCheckUtils]: 48: Hoare triple {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,262 INFO L290 TraceCheckUtils]: 49: Hoare triple {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,263 INFO L290 TraceCheckUtils]: 50: Hoare triple {6719#(and (<= 2 |ULTIMATE.start_Sum2_~i~1#1|) (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6735#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 3 |ULTIMATE.start_Sum2_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} is VALID [2022-02-20 23:44:04,263 INFO L290 TraceCheckUtils]: 51: Hoare triple {6735#(and (= |ULTIMATE.start_Sum2_~instrs#1.offset| 0) (<= 3 |ULTIMATE.start_Sum2_~i~1#1|) (<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) 3))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6739#(and (<= |ULTIMATE.start_Sum2_#t~mem10#1| 3) (<= 3 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 52: Hoare triple {6739#(and (<= |ULTIMATE.start_Sum2_#t~mem10#1| 3) (<= 3 |ULTIMATE.start_Sum2_~i~1#1|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6563#false} is VALID [2022-02-20 23:44:04,264 INFO L290 TraceCheckUtils]: 53: Hoare triple {6563#false} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {6563#false} is VALID [2022-02-20 23:44:04,264 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 23:44:04,264 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:04,663 INFO L290 TraceCheckUtils]: 53: Hoare triple {6563#false} assume !(8 + (14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)) <= #length[Sum2_~instrs#1.base] && 0 <= 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1)); {6563#false} is VALID [2022-02-20 23:44:04,664 INFO L290 TraceCheckUtils]: 52: Hoare triple {6576#(<= |ULTIMATE.start_Sum2_#t~mem10#1| |ULTIMATE.start_Sum2_~i~1#1|)} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6563#false} is VALID [2022-02-20 23:44:04,664 INFO L290 TraceCheckUtils]: 51: Hoare triple {6575#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) |ULTIMATE.start_Sum2_~i~1#1|)} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6576#(<= |ULTIMATE.start_Sum2_#t~mem10#1| |ULTIMATE.start_Sum2_~i~1#1|)} is VALID [2022-02-20 23:44:04,665 INFO L290 TraceCheckUtils]: 50: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6575#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) |ULTIMATE.start_Sum2_~i~1#1|)} is VALID [2022-02-20 23:44:04,665 INFO L290 TraceCheckUtils]: 49: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:04,665 INFO L290 TraceCheckUtils]: 48: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:04,666 INFO L290 TraceCheckUtils]: 47: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:04,666 INFO L290 TraceCheckUtils]: 46: Hoare triple {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:04,666 INFO L290 TraceCheckUtils]: 45: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6574#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 1))} is VALID [2022-02-20 23:44:04,667 INFO L290 TraceCheckUtils]: 44: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,667 INFO L290 TraceCheckUtils]: 43: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,667 INFO L290 TraceCheckUtils]: 42: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,668 INFO L290 TraceCheckUtils]: 41: Hoare triple {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,668 INFO L290 TraceCheckUtils]: 40: Hoare triple {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {6573#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ 2 |ULTIMATE.start_Sum2_~i~1#1|))} is VALID [2022-02-20 23:44:04,668 INFO L290 TraceCheckUtils]: 39: Hoare triple {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} is VALID [2022-02-20 23:44:04,669 INFO L290 TraceCheckUtils]: 38: Hoare triple {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} is VALID [2022-02-20 23:44:04,669 INFO L290 TraceCheckUtils]: 37: Hoare triple {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} is VALID [2022-02-20 23:44:04,669 INFO L290 TraceCheckUtils]: 36: Hoare triple {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} is VALID [2022-02-20 23:44:04,670 INFO L290 TraceCheckUtils]: 35: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {6785#(<= (select (select |#memory_int| |ULTIMATE.start_Sum2_~instrs#1.base|) |ULTIMATE.start_Sum2_~instrs#1.offset|) (+ |ULTIMATE.start_Sum2_~i~1#1| 3))} is VALID [2022-02-20 23:44:04,670 INFO L290 TraceCheckUtils]: 34: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,670 INFO L290 TraceCheckUtils]: 33: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,671 INFO L290 TraceCheckUtils]: 32: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_#res#1 := Sum_~count~0#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,671 INFO L290 TraceCheckUtils]: 31: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,671 INFO L290 TraceCheckUtils]: 30: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,672 INFO L290 TraceCheckUtils]: 29: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,672 INFO L290 TraceCheckUtils]: 28: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,674 INFO L290 TraceCheckUtils]: 27: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,676 INFO L290 TraceCheckUtils]: 26: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,677 INFO L290 TraceCheckUtils]: 25: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,677 INFO L290 TraceCheckUtils]: 24: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,678 INFO L290 TraceCheckUtils]: 23: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,678 INFO L290 TraceCheckUtils]: 22: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,679 INFO L290 TraceCheckUtils]: 21: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,679 INFO L290 TraceCheckUtils]: 20: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,680 INFO L290 TraceCheckUtils]: 19: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,681 INFO L290 TraceCheckUtils]: 16: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,681 INFO L290 TraceCheckUtils]: 15: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,682 INFO L290 TraceCheckUtils]: 13: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,683 INFO L290 TraceCheckUtils]: 12: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,683 INFO L290 TraceCheckUtils]: 11: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,684 INFO L290 TraceCheckUtils]: 10: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,685 INFO L290 TraceCheckUtils]: 9: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,685 INFO L290 TraceCheckUtils]: 8: Hoare triple {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 7: Hoare triple {6562#true} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {6570#(<= (select (select |#memory_int| |ULTIMATE.start_main_~p~0#1.base|) |ULTIMATE.start_main_~p~0#1.offset|) 3)} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 6: Hoare triple {6562#true} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 5: Hoare triple {6562#true} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 4: Hoare triple {6562#true} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 3: Hoare triple {6562#true} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 2: Hoare triple {6562#true} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 1: Hoare triple {6562#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L290 TraceCheckUtils]: 0: Hoare triple {6562#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); {6562#true} is VALID [2022-02-20 23:44:04,686 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 21 proven. 3 refuted. 0 times theorem prover too weak. 22 trivial. 0 not checked. [2022-02-20 23:44:04,687 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [848595719] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:04,687 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:04,687 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 9, 8] total 23 [2022-02-20 23:44:04,687 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1629583606] [2022-02-20 23:44:04,687 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:04,688 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 23:44:04,688 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:04,688 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:04,776 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:44:04,776 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 23:44:04,776 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:04,777 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 23:44:04,777 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=82, Invalid=424, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:44:04,777 INFO L87 Difference]: Start difference. First operand 65 states and 69 transitions. Second operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,633 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:05,633 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-02-20 23:44:05,633 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 23:44:05,633 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 54 [2022-02-20 23:44:05,633 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:05,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-02-20 23:44:05,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 66 transitions. [2022-02-20 23:44:05,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 66 transitions. [2022-02-20 23:44:05,705 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 66 edges. 66 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:05,706 INFO L225 Difference]: With dead ends: 63 [2022-02-20 23:44:05,706 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 23:44:05,706 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 137 GetRequests, 94 SyntacticMatches, 7 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 368 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=266, Invalid=1140, Unknown=0, NotChecked=0, Total=1406 [2022-02-20 23:44:05,707 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 76 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 266 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 175 SdHoareTripleChecker+Invalid, 310 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 266 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:05,707 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [76 Valid, 175 Invalid, 310 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 266 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:44:05,707 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 23:44:05,708 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 63. [2022-02-20 23:44:05,708 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:05,709 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:05,709 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:05,709 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:05,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:05,710 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-02-20 23:44:05,710 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-02-20 23:44:05,710 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:05,710 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:05,710 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-02-20 23:44:05,711 INFO L87 Difference]: Start difference. First operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 63 states. [2022-02-20 23:44:05,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:05,712 INFO L93 Difference]: Finished difference Result 63 states and 66 transitions. [2022-02-20 23:44:05,712 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-02-20 23:44:05,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:05,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:05,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:05,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:05,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 59 states have (on average 1.0508474576271187) internal successors, (62), 61 states have internal predecessors, (62), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:05,713 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 66 transitions. [2022-02-20 23:44:05,714 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 66 transitions. Word has length 54 [2022-02-20 23:44:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:05,714 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 66 transitions. [2022-02-20 23:44:05,714 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 5.0) internal successors, (115), 23 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 66 transitions. [2022-02-20 23:44:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2022-02-20 23:44:05,715 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:05,715 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:05,737 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:05,924 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:05,924 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:44:05,925 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:05,925 INFO L85 PathProgramCache]: Analyzing trace with hash 679832114, now seen corresponding path program 3 times [2022-02-20 23:44:05,925 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:05,925 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1251242428] [2022-02-20 23:44:05,925 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:05,925 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,023 INFO L290 TraceCheckUtils]: 0: Hoare triple {7187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); {7187#true} is VALID [2022-02-20 23:44:06,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {7187#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,025 INFO L290 TraceCheckUtils]: 3: Hoare triple {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {7190#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {7190#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7191#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,026 INFO L290 TraceCheckUtils]: 5: Hoare triple {7191#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7188#false} is VALID [2022-02-20 23:44:06,026 INFO L290 TraceCheckUtils]: 6: Hoare triple {7188#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 12: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7188#false} is VALID [2022-02-20 23:44:06,027 INFO L290 TraceCheckUtils]: 13: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 14: Hoare triple {7188#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 15: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 16: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 17: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 18: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,028 INFO L290 TraceCheckUtils]: 19: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 20: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 21: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 22: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 23: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 24: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 25: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,029 INFO L290 TraceCheckUtils]: 26: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 27: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 28: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 29: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 30: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 31: Hoare triple {7188#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#false} Sum_#res#1 := Sum_~count~0#1; {7188#false} is VALID [2022-02-20 23:44:06,030 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 34: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 35: Hoare triple {7188#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 36: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 37: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 38: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 39: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,031 INFO L290 TraceCheckUtils]: 40: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 41: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 42: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 43: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 44: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 45: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 46: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,032 INFO L290 TraceCheckUtils]: 47: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 48: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 49: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 50: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 51: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 52: Hoare triple {7188#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,033 INFO L290 TraceCheckUtils]: 53: Hoare triple {7188#false} Sum2_#res#1 := Sum2_~count~1#1; {7188#false} is VALID [2022-02-20 23:44:06,034 INFO L290 TraceCheckUtils]: 54: Hoare triple {7188#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7188#false} is VALID [2022-02-20 23:44:06,034 INFO L290 TraceCheckUtils]: 55: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7188#false} is VALID [2022-02-20 23:44:06,034 INFO L290 TraceCheckUtils]: 56: Hoare triple {7188#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,034 INFO L290 TraceCheckUtils]: 57: Hoare triple {7188#false} assume !(#valid == main_old_#valid#1); {7188#false} is VALID [2022-02-20 23:44:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:06,034 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:06,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1251242428] [2022-02-20 23:44:06,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1251242428] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:06,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158953649] [2022-02-20 23:44:06,035 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 23:44:06,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:06,035 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:06,037 INFO L229 MonitoredProcess]: Starting monitored process 9 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:44:06,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-02-20 23:44:06,269 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-02-20 23:44:06,270 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:06,271 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:44:06,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:06,292 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:06,621 INFO L290 TraceCheckUtils]: 0: Hoare triple {7187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); {7187#true} is VALID [2022-02-20 23:44:06,622 INFO L290 TraceCheckUtils]: 1: Hoare triple {7187#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,623 INFO L290 TraceCheckUtils]: 2: Hoare triple {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,623 INFO L290 TraceCheckUtils]: 3: Hoare triple {7189#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {7190#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:06,624 INFO L290 TraceCheckUtils]: 4: Hoare triple {7190#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7207#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} is VALID [2022-02-20 23:44:06,624 INFO L290 TraceCheckUtils]: 5: Hoare triple {7207#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7188#false} is VALID [2022-02-20 23:44:06,624 INFO L290 TraceCheckUtils]: 6: Hoare triple {7188#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7188#false} is VALID [2022-02-20 23:44:06,624 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7188#false} is VALID [2022-02-20 23:44:06,624 INFO L290 TraceCheckUtils]: 8: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 10: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 11: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 12: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 13: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 14: Hoare triple {7188#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 15: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 16: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 17: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 18: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 19: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 20: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 21: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,625 INFO L290 TraceCheckUtils]: 22: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 23: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 24: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 28: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 29: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 30: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 31: Hoare triple {7188#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#false} Sum_#res#1 := Sum_~count~0#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 34: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 35: Hoare triple {7188#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,626 INFO L290 TraceCheckUtils]: 36: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 37: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 38: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 39: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 40: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 41: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 42: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 43: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 44: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 45: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 46: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 47: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 48: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 49: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,627 INFO L290 TraceCheckUtils]: 50: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 51: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 52: Hoare triple {7188#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 53: Hoare triple {7188#false} Sum2_#res#1 := Sum2_~count~1#1; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 54: Hoare triple {7188#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 55: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 56: Hoare triple {7188#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L290 TraceCheckUtils]: 57: Hoare triple {7188#false} assume !(#valid == main_old_#valid#1); {7188#false} is VALID [2022-02-20 23:44:06,628 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:06,628 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:06,791 INFO L290 TraceCheckUtils]: 57: Hoare triple {7188#false} assume !(#valid == main_old_#valid#1); {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 56: Hoare triple {7188#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 55: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 54: Hoare triple {7188#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 53: Hoare triple {7188#false} Sum2_#res#1 := Sum2_~count~1#1; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 52: Hoare triple {7188#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 51: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 50: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 49: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 48: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,792 INFO L290 TraceCheckUtils]: 47: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 46: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 45: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {7188#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {7188#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7188#false} is VALID [2022-02-20 23:44:06,793 INFO L290 TraceCheckUtils]: 38: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 37: Hoare triple {7188#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 36: Hoare triple {7188#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 35: Hoare triple {7188#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 34: Hoare triple {7188#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 33: Hoare triple {7188#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 32: Hoare triple {7188#false} Sum_#res#1 := Sum_~count~0#1; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 31: Hoare triple {7188#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 27: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 26: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 25: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 24: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 23: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 22: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 21: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,795 INFO L290 TraceCheckUtils]: 20: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {7188#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {7188#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 16: Hoare triple {7188#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {7188#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 14: Hoare triple {7188#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7188#false} is VALID [2022-02-20 23:44:06,796 INFO L290 TraceCheckUtils]: 13: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 12: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {7188#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {7188#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 8: Hoare triple {7188#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7188#false} is VALID [2022-02-20 23:44:06,797 INFO L290 TraceCheckUtils]: 7: Hoare triple {7188#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7188#false} is VALID [2022-02-20 23:44:06,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {7188#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7188#false} is VALID [2022-02-20 23:44:06,798 INFO L290 TraceCheckUtils]: 5: Hoare triple {7523#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7188#false} is VALID [2022-02-20 23:44:06,799 INFO L290 TraceCheckUtils]: 4: Hoare triple {7527#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7523#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:06,800 INFO L290 TraceCheckUtils]: 3: Hoare triple {7531#(< 1 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {7527#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:06,800 INFO L290 TraceCheckUtils]: 2: Hoare triple {7531#(< 1 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7531#(< 1 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:06,801 INFO L290 TraceCheckUtils]: 1: Hoare triple {7187#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {7531#(< 1 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:06,801 INFO L290 TraceCheckUtils]: 0: Hoare triple {7187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(13, 2); {7187#true} is VALID [2022-02-20 23:44:06,801 INFO L134 CoverageAnalysis]: Checked inductivity of 43 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:06,802 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158953649] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:06,802 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:06,802 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2022-02-20 23:44:06,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216728253] [2022-02-20 23:44:06,802 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:06,803 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:44:06,803 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:06,803 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:06,837 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:06,838 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:44:06,838 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:06,838 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:44:06,838 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:44:06,838 INFO L87 Difference]: Start difference. First operand 63 states and 66 transitions. Second operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:07,009 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:07,009 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:44:07,009 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:44:07,009 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 58 [2022-02-20 23:44:07,009 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:07,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-20 23:44:07,010 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:07,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 50 transitions. [2022-02-20 23:44:07,011 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 50 transitions. [2022-02-20 23:44:07,056 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:07,056 INFO L225 Difference]: With dead ends: 66 [2022-02-20 23:44:07,057 INFO L226 Difference]: Without dead ends: 66 [2022-02-20 23:44:07,057 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 16 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:44:07,057 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 35 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:07,057 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [37 Valid, 122 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:44:07,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2022-02-20 23:44:07,059 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2022-02-20 23:44:07,059 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:07,059 INFO L82 GeneralOperation]: Start isEquivalent. First operand 66 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:07,059 INFO L74 IsIncluded]: Start isIncluded. First operand 66 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:07,059 INFO L87 Difference]: Start difference. First operand 66 states. Second operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:07,060 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:07,061 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:44:07,061 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:44:07,061 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:07,061 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:07,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-02-20 23:44:07,061 INFO L87 Difference]: Start difference. First operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 66 states. [2022-02-20 23:44:07,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:07,063 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2022-02-20 23:44:07,063 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:44:07,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:07,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:07,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:07,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:07,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 62 states have (on average 1.0483870967741935) internal successors, (65), 64 states have internal predecessors, (65), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:07,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2022-02-20 23:44:07,064 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 58 [2022-02-20 23:44:07,065 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:07,065 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2022-02-20 23:44:07,065 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 4.777777777777778) internal successors, (43), 9 states have internal predecessors, (43), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:07,065 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2022-02-20 23:44:07,065 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2022-02-20 23:44:07,066 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:07,066 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:07,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:07,285 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2022-02-20 23:44:07,286 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:44:07,286 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:07,286 INFO L85 PathProgramCache]: Analyzing trace with hash -220059533, now seen corresponding path program 4 times [2022-02-20 23:44:07,286 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:07,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879634508] [2022-02-20 23:44:07,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:07,286 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:07,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:07,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {7808#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); {7808#true} is VALID [2022-02-20 23:44:07,462 INFO L290 TraceCheckUtils]: 1: Hoare triple {7808#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:07,463 INFO L290 TraceCheckUtils]: 2: Hoare triple {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:07,463 INFO L290 TraceCheckUtils]: 3: Hoare triple {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {7811#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:07,464 INFO L290 TraceCheckUtils]: 4: Hoare triple {7811#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7812#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:07,465 INFO L290 TraceCheckUtils]: 5: Hoare triple {7812#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7813#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:07,466 INFO L290 TraceCheckUtils]: 6: Hoare triple {7813#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7814#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:07,467 INFO L290 TraceCheckUtils]: 7: Hoare triple {7814#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7815#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:07,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {7815#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7809#false} is VALID [2022-02-20 23:44:07,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {7809#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7809#false} is VALID [2022-02-20 23:44:07,468 INFO L290 TraceCheckUtils]: 10: Hoare triple {7809#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7809#false} is VALID [2022-02-20 23:44:07,468 INFO L290 TraceCheckUtils]: 11: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 12: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 13: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 14: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 15: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7809#false} is VALID [2022-02-20 23:44:07,469 INFO L290 TraceCheckUtils]: 18: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 19: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 20: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 21: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 22: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:07,470 INFO L290 TraceCheckUtils]: 24: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 25: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 26: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 27: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 28: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 29: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 30: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:07,471 INFO L290 TraceCheckUtils]: 31: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 32: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 33: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 34: Hoare triple {7809#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 35: Hoare triple {7809#false} Sum_#res#1 := Sum_~count~0#1; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 36: Hoare triple {7809#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 37: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7809#false} is VALID [2022-02-20 23:44:07,472 INFO L290 TraceCheckUtils]: 38: Hoare triple {7809#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 39: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 40: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 41: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 42: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 43: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 44: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:07,473 INFO L290 TraceCheckUtils]: 45: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 46: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 47: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 48: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 49: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 51: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:07,474 INFO L290 TraceCheckUtils]: 52: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 53: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 54: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 55: Hoare triple {7809#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 56: Hoare triple {7809#false} Sum2_#res#1 := Sum2_~count~1#1; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 57: Hoare triple {7809#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 58: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7809#false} is VALID [2022-02-20 23:44:07,475 INFO L290 TraceCheckUtils]: 59: Hoare triple {7809#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7809#false} is VALID [2022-02-20 23:44:07,476 INFO L290 TraceCheckUtils]: 60: Hoare triple {7809#false} assume !(#valid == main_old_#valid#1); {7809#false} is VALID [2022-02-20 23:44:07,476 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:07,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:07,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879634508] [2022-02-20 23:44:07,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879634508] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:07,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1598225324] [2022-02-20 23:44:07,477 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 23:44:07,477 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:07,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:07,480 INFO L229 MonitoredProcess]: Starting monitored process 10 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:44:07,481 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-02-20 23:44:07,910 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 23:44:07,910 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:07,911 INFO L263 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 23:44:07,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:07,926 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:08,305 INFO L290 TraceCheckUtils]: 0: Hoare triple {7808#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); {7808#true} is VALID [2022-02-20 23:44:08,306 INFO L290 TraceCheckUtils]: 1: Hoare triple {7808#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,306 INFO L290 TraceCheckUtils]: 2: Hoare triple {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {7810#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {7811#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {7811#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7831#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} is VALID [2022-02-20 23:44:08,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {7831#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7835#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,309 INFO L290 TraceCheckUtils]: 6: Hoare triple {7835#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7839#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,309 INFO L290 TraceCheckUtils]: 7: Hoare triple {7839#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {7843#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:08,310 INFO L290 TraceCheckUtils]: 8: Hoare triple {7843#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7809#false} is VALID [2022-02-20 23:44:08,310 INFO L290 TraceCheckUtils]: 9: Hoare triple {7809#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7809#false} is VALID [2022-02-20 23:44:08,310 INFO L290 TraceCheckUtils]: 10: Hoare triple {7809#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 11: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 12: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 13: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 14: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 18: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 19: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 20: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 21: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,311 INFO L290 TraceCheckUtils]: 22: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 23: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 24: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 25: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 26: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 27: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 28: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 29: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 30: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,312 INFO L290 TraceCheckUtils]: 31: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 32: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 33: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 34: Hoare triple {7809#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 35: Hoare triple {7809#false} Sum_#res#1 := Sum_~count~0#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 36: Hoare triple {7809#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 37: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 38: Hoare triple {7809#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 39: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 40: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 41: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 42: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,313 INFO L290 TraceCheckUtils]: 43: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 44: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 45: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 46: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 47: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 48: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 49: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 51: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 52: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,314 INFO L290 TraceCheckUtils]: 53: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 54: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 55: Hoare triple {7809#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 56: Hoare triple {7809#false} Sum2_#res#1 := Sum2_~count~1#1; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 57: Hoare triple {7809#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 58: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 59: Hoare triple {7809#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,315 INFO L290 TraceCheckUtils]: 60: Hoare triple {7809#false} assume !(#valid == main_old_#valid#1); {7809#false} is VALID [2022-02-20 23:44:08,316 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:08,316 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:08,580 INFO L290 TraceCheckUtils]: 60: Hoare triple {7809#false} assume !(#valid == main_old_#valid#1); {7809#false} is VALID [2022-02-20 23:44:08,580 INFO L290 TraceCheckUtils]: 59: Hoare triple {7809#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,580 INFO L290 TraceCheckUtils]: 58: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {7809#false} is VALID [2022-02-20 23:44:08,580 INFO L290 TraceCheckUtils]: 57: Hoare triple {7809#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {7809#false} is VALID [2022-02-20 23:44:08,580 INFO L290 TraceCheckUtils]: 56: Hoare triple {7809#false} Sum2_#res#1 := Sum2_~count~1#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 55: Hoare triple {7809#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 54: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 53: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 52: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 51: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 50: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 49: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 48: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 47: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 46: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 45: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 44: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,581 INFO L290 TraceCheckUtils]: 43: Hoare triple {7809#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 42: Hoare triple {7809#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 41: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 40: Hoare triple {7809#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 39: Hoare triple {7809#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 38: Hoare triple {7809#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,582 INFO L290 TraceCheckUtils]: 37: Hoare triple {7809#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 36: Hoare triple {7809#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 35: Hoare triple {7809#false} Sum_#res#1 := Sum_~count~0#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 34: Hoare triple {7809#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 33: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 32: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 31: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 30: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 29: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 28: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 27: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 26: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 25: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 24: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,583 INFO L290 TraceCheckUtils]: 23: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 22: Hoare triple {7809#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 21: Hoare triple {7809#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 20: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 19: Hoare triple {7809#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 18: Hoare triple {7809#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 17: Hoare triple {7809#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 16: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 15: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {7809#false} is VALID [2022-02-20 23:44:08,584 INFO L290 TraceCheckUtils]: 14: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 13: Hoare triple {7809#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 12: Hoare triple {7809#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 11: Hoare triple {7809#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 10: Hoare triple {7809#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 9: Hoare triple {7809#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {7809#false} is VALID [2022-02-20 23:44:08,585 INFO L290 TraceCheckUtils]: 8: Hoare triple {8159#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {7809#false} is VALID [2022-02-20 23:44:08,586 INFO L290 TraceCheckUtils]: 7: Hoare triple {8163#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8159#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {8167#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8163#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {8171#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8167#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,589 INFO L290 TraceCheckUtils]: 4: Hoare triple {8175#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8171#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,590 INFO L290 TraceCheckUtils]: 3: Hoare triple {8179#(< 4 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {8175#(< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,590 INFO L290 TraceCheckUtils]: 2: Hoare triple {8179#(< 4 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8179#(< 4 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,591 INFO L290 TraceCheckUtils]: 1: Hoare triple {7808#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {8179#(< 4 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:08,591 INFO L290 TraceCheckUtils]: 0: Hoare triple {7808#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); {7808#true} is VALID [2022-02-20 23:44:08,591 INFO L134 CoverageAnalysis]: Checked inductivity of 52 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:08,591 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1598225324] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:08,591 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:08,592 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 18 [2022-02-20 23:44:08,592 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1485611437] [2022-02-20 23:44:08,592 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:08,592 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:44:08,592 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:08,592 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:08,635 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:08,635 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 23:44:08,635 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:08,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 23:44:08,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=202, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:44:08,636 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:09,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:09,409 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:44:09,409 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 23:44:09,410 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 61 [2022-02-20 23:44:09,410 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:09,410 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:09,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-02-20 23:44:09,411 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:09,411 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 59 transitions. [2022-02-20 23:44:09,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 59 transitions. [2022-02-20 23:44:09,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 59 edges. 59 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:09,468 INFO L225 Difference]: With dead ends: 72 [2022-02-20 23:44:09,468 INFO L226 Difference]: Without dead ends: 72 [2022-02-20 23:44:09,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 133 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 103 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=174, Invalid=332, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:44:09,469 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 70 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 71 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 71 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:09,469 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 266 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 71 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:44:09,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2022-02-20 23:44:09,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2022-02-20 23:44:09,471 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:09,471 INFO L82 GeneralOperation]: Start isEquivalent. First operand 72 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:09,472 INFO L74 IsIncluded]: Start isIncluded. First operand 72 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:09,472 INFO L87 Difference]: Start difference. First operand 72 states. Second operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:09,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:09,473 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:44:09,473 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:44:09,473 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:09,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:09,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-02-20 23:44:09,474 INFO L87 Difference]: Start difference. First operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 72 states. [2022-02-20 23:44:09,475 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:09,475 INFO L93 Difference]: Finished difference Result 72 states and 75 transitions. [2022-02-20 23:44:09,475 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:44:09,476 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:09,476 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:09,476 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:09,476 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:09,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 68 states have (on average 1.0441176470588236) internal successors, (71), 70 states have internal predecessors, (71), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:09,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 75 transitions. [2022-02-20 23:44:09,477 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 75 transitions. Word has length 61 [2022-02-20 23:44:09,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:09,478 INFO L470 AbstractCegarLoop]: Abstraction has 72 states and 75 transitions. [2022-02-20 23:44:09,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.888888888888889) internal successors, (52), 18 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:09,478 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 75 transitions. [2022-02-20 23:44:09,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2022-02-20 23:44:09,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:09,479 INFO L514 BasicCegarLoop]: trace histogram [10, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:09,501 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:44:09,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:09,696 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:44:09,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:09,696 INFO L85 PathProgramCache]: Analyzing trace with hash -179470317, now seen corresponding path program 5 times [2022-02-20 23:44:09,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:09,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [780233668] [2022-02-20 23:44:09,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:09,696 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:09,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:10,010 INFO L290 TraceCheckUtils]: 0: Hoare triple {8486#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); {8486#true} is VALID [2022-02-20 23:44:10,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {8486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,012 INFO L290 TraceCheckUtils]: 3: Hoare triple {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {8489#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {8489#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8490#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {8490#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8491#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,015 INFO L290 TraceCheckUtils]: 6: Hoare triple {8491#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8492#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {8492#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8493#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 4 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,016 INFO L290 TraceCheckUtils]: 8: Hoare triple {8493#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 4 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8494#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 89) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 5 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,017 INFO L290 TraceCheckUtils]: 9: Hoare triple {8494#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 89) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 5 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8495#(and (<= 6 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 88) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {8495#(and (<= 6 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 88) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8496#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 87) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 7 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,019 INFO L290 TraceCheckUtils]: 11: Hoare triple {8496#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 87) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 7 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8497#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 86) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 8 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:10,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {8497#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 86) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 8 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8498#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 9 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 85) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {8498#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 9 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 85) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8499#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 84) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 14: Hoare triple {8499#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 84) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {8487#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {8487#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 22: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {8487#false} is VALID [2022-02-20 23:44:10,022 INFO L290 TraceCheckUtils]: 23: Hoare triple {8487#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 24: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 25: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 26: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 30: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 31: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 32: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:10,023 INFO L290 TraceCheckUtils]: 33: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 34: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 35: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 36: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 37: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 38: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 39: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 40: Hoare triple {8487#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 41: Hoare triple {8487#false} Sum_#res#1 := Sum_~count~0#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 42: Hoare triple {8487#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 43: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {8487#false} is VALID [2022-02-20 23:44:10,024 INFO L290 TraceCheckUtils]: 44: Hoare triple {8487#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 45: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 46: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 47: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 48: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 49: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 50: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 51: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 52: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 53: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 54: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 55: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 56: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:10,025 INFO L290 TraceCheckUtils]: 57: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 58: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 59: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 60: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 61: Hoare triple {8487#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 62: Hoare triple {8487#false} Sum2_#res#1 := Sum2_~count~1#1; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 63: Hoare triple {8487#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 64: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 65: Hoare triple {8487#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {8487#false} is VALID [2022-02-20 23:44:10,026 INFO L290 TraceCheckUtils]: 66: Hoare triple {8487#false} assume !(#valid == main_old_#valid#1); {8487#false} is VALID [2022-02-20 23:44:10,027 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:10,027 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:10,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [780233668] [2022-02-20 23:44:10,027 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [780233668] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:10,027 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1720577075] [2022-02-20 23:44:10,027 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 23:44:10,027 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:10,028 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:10,032 INFO L229 MonitoredProcess]: Starting monitored process 11 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:44:10,059 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2022-02-20 23:44:10,473 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 6 check-sat command(s) [2022-02-20 23:44:10,473 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 23:44:10,476 INFO L263 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 27 conjunts are in the unsatisfiable core [2022-02-20 23:44:10,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:10,490 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:44:11,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {8486#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); {8486#true} is VALID [2022-02-20 23:44:11,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {8486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {8488#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {8489#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {8489#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8515#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} is VALID [2022-02-20 23:44:11,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {8515#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8519#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {8519#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8523#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3))} is VALID [2022-02-20 23:44:11,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {8523#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8527#(and (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 3) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {8527#(and (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 3) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8531#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {8531#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8535#(and (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 5) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {8535#(and (= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| (- 1)) 5) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8539#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,140 INFO L290 TraceCheckUtils]: 11: Hoare triple {8539#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8543#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,141 INFO L290 TraceCheckUtils]: 12: Hoare triple {8543#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8547#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,142 INFO L290 TraceCheckUtils]: 13: Hoare triple {8547#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8551#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 10) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:11,142 INFO L290 TraceCheckUtils]: 14: Hoare triple {8551#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 10) (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {8487#false} is VALID [2022-02-20 23:44:11,142 INFO L290 TraceCheckUtils]: 15: Hoare triple {8487#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 16: Hoare triple {8487#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 17: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 18: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 19: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 22: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 23: Hoare triple {8487#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 24: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 25: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 26: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:11,143 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 28: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 29: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 30: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 31: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 32: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 33: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 34: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:11,144 INFO L290 TraceCheckUtils]: 35: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 36: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 37: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 38: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 39: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 40: Hoare triple {8487#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 41: Hoare triple {8487#false} Sum_#res#1 := Sum_~count~0#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 42: Hoare triple {8487#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 43: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 44: Hoare triple {8487#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 45: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 46: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 47: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:11,145 INFO L290 TraceCheckUtils]: 48: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 49: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 50: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 51: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 52: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 53: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 54: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 55: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 56: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:11,146 INFO L290 TraceCheckUtils]: 57: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 58: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 59: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 60: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 61: Hoare triple {8487#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 62: Hoare triple {8487#false} Sum2_#res#1 := Sum2_~count~1#1; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 63: Hoare triple {8487#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 64: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 65: Hoare triple {8487#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {8487#false} is VALID [2022-02-20 23:44:11,147 INFO L290 TraceCheckUtils]: 66: Hoare triple {8487#false} assume !(#valid == main_old_#valid#1); {8487#false} is VALID [2022-02-20 23:44:11,148 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:11,148 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:44:12,085 INFO L290 TraceCheckUtils]: 66: Hoare triple {8487#false} assume !(#valid == main_old_#valid#1); {8487#false} is VALID [2022-02-20 23:44:12,085 INFO L290 TraceCheckUtils]: 65: Hoare triple {8487#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 64: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 63: Hoare triple {8487#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 62: Hoare triple {8487#false} Sum2_#res#1 := Sum2_~count~1#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 61: Hoare triple {8487#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 60: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 59: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 58: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 57: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 56: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:12,086 INFO L290 TraceCheckUtils]: 55: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 54: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 53: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 52: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 51: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 50: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 49: Hoare triple {8487#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 48: Hoare triple {8487#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 47: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {8487#false} is VALID [2022-02-20 23:44:12,087 INFO L290 TraceCheckUtils]: 46: Hoare triple {8487#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 45: Hoare triple {8487#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 44: Hoare triple {8487#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 43: Hoare triple {8487#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 42: Hoare triple {8487#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 41: Hoare triple {8487#false} Sum_#res#1 := Sum_~count~0#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 40: Hoare triple {8487#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 39: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 38: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 37: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:12,088 INFO L290 TraceCheckUtils]: 36: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 35: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 34: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 33: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 32: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 31: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 30: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 29: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 28: Hoare triple {8487#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 27: Hoare triple {8487#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {8487#false} is VALID [2022-02-20 23:44:12,089 INFO L290 TraceCheckUtils]: 26: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 25: Hoare triple {8487#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 24: Hoare triple {8487#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 23: Hoare triple {8487#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 22: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 21: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {8487#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {8487#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {8487#false} is VALID [2022-02-20 23:44:12,090 INFO L290 TraceCheckUtils]: 17: Hoare triple {8487#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {8487#false} is VALID [2022-02-20 23:44:12,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {8487#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {8487#false} is VALID [2022-02-20 23:44:12,091 INFO L290 TraceCheckUtils]: 15: Hoare triple {8487#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {8487#false} is VALID [2022-02-20 23:44:12,091 INFO L290 TraceCheckUtils]: 14: Hoare triple {8867#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {8487#false} is VALID [2022-02-20 23:44:12,092 INFO L290 TraceCheckUtils]: 13: Hoare triple {8871#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8867#(< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))} is VALID [2022-02-20 23:44:12,093 INFO L290 TraceCheckUtils]: 12: Hoare triple {8875#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8871#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,094 INFO L290 TraceCheckUtils]: 11: Hoare triple {8879#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8875#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,095 INFO L290 TraceCheckUtils]: 10: Hoare triple {8883#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8879#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 1) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,096 INFO L290 TraceCheckUtils]: 9: Hoare triple {8887#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8883#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 2) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} is VALID [2022-02-20 23:44:12,098 INFO L290 TraceCheckUtils]: 8: Hoare triple {8891#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8887#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 3) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,099 INFO L290 TraceCheckUtils]: 7: Hoare triple {8895#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8891#(or (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,100 INFO L290 TraceCheckUtils]: 6: Hoare triple {8899#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8895#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 5) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {8903#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8899#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 6) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} is VALID [2022-02-20 23:44:12,102 INFO L290 TraceCheckUtils]: 4: Hoare triple {8907#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 10) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {8903#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 7) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))))} is VALID [2022-02-20 23:44:12,103 INFO L290 TraceCheckUtils]: 3: Hoare triple {8911#(or (< 10 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 9))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {8907#(or (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 9) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (not (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 8) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296))) (< (mod (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 10) 4294967296) (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)))} is VALID [2022-02-20 23:44:12,103 INFO L290 TraceCheckUtils]: 2: Hoare triple {8911#(or (< 10 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 9))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {8911#(or (< 10 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 9))} is VALID [2022-02-20 23:44:12,103 INFO L290 TraceCheckUtils]: 1: Hoare triple {8486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {8911#(or (< 10 (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296)) (<= (mod |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 9))} is VALID [2022-02-20 23:44:12,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {8486#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); {8486#true} is VALID [2022-02-20 23:44:12,104 INFO L134 CoverageAnalysis]: Checked inductivity of 97 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:12,104 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1720577075] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:44:12,104 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:44:12,104 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 36 [2022-02-20 23:44:12,104 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603640972] [2022-02-20 23:44:12,104 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:44:12,105 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 23:44:12,106 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:44:12,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:12,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 70 edges. 70 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:12,212 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2022-02-20 23:44:12,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:44:12,213 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2022-02-20 23:44:12,213 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=362, Invalid=898, Unknown=0, NotChecked=0, Total=1260 [2022-02-20 23:44:12,213 INFO L87 Difference]: Start difference. First operand 72 states and 75 transitions. Second operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:30,685 WARN L228 SmtUtils]: Spent 7.87s on a formula simplification. DAG size of input: 70 DAG size of output: 46 (called from [L 360] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-02-20 23:44:39,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:39,630 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-02-20 23:44:39,630 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 23:44:39,630 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 67 [2022-02-20 23:44:39,630 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:44:39,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-02-20 23:44:39,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:39,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 77 transitions. [2022-02-20 23:44:39,633 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 77 transitions. [2022-02-20 23:44:40,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:44:40,202 INFO L225 Difference]: With dead ends: 84 [2022-02-20 23:44:40,202 INFO L226 Difference]: Without dead ends: 84 [2022-02-20 23:44:40,203 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 111 SyntacticMatches, 1 SemanticMatches, 46 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 514 ImplicationChecksByTransitivity, 18.4s TimeCoverageRelationStatistics Valid=674, Invalid=1582, Unknown=0, NotChecked=0, Total=2256 [2022-02-20 23:44:40,203 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 355 mSDsluCounter, 479 mSDsCounter, 0 mSdLazyCounter, 229 mSolverCounterSat, 85 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 355 SdHoareTripleChecker+Valid, 519 SdHoareTripleChecker+Invalid, 314 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 85 IncrementalHoareTripleChecker+Valid, 229 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:44:40,203 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [355 Valid, 519 Invalid, 314 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [85 Valid, 229 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2022-02-20 23:44:40,204 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2022-02-20 23:44:40,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 84. [2022-02-20 23:44:40,205 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:44:40,206 INFO L82 GeneralOperation]: Start isEquivalent. First operand 84 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:40,206 INFO L74 IsIncluded]: Start isIncluded. First operand 84 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:40,206 INFO L87 Difference]: Start difference. First operand 84 states. Second operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:40,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,208 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-02-20 23:44:40,208 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-02-20 23:44:40,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-02-20 23:44:40,218 INFO L87 Difference]: Start difference. First operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 84 states. [2022-02-20 23:44:40,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:44:40,219 INFO L93 Difference]: Finished difference Result 84 states and 87 transitions. [2022-02-20 23:44:40,219 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-02-20 23:44:40,220 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:44:40,220 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:44:40,220 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:44:40,220 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:44:40,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 80 states have (on average 1.0375) internal successors, (83), 82 states have internal predecessors, (83), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:44:40,222 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 87 transitions. [2022-02-20 23:44:40,222 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 87 transitions. Word has length 67 [2022-02-20 23:44:40,222 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:44:40,222 INFO L470 AbstractCegarLoop]: Abstraction has 84 states and 87 transitions. [2022-02-20 23:44:40,222 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 1.9444444444444444) internal successors, (70), 36 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:44:40,223 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 87 transitions. [2022-02-20 23:44:40,227 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2022-02-20 23:44:40,228 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:44:40,228 INFO L514 BasicCegarLoop]: trace histogram [22, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 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:44:40,236 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2022-02-20 23:44:40,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2022-02-20 23:44:40,434 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATION (and 22 more)] === [2022-02-20 23:44:40,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:44:40,434 INFO L85 PathProgramCache]: Analyzing trace with hash -595228845, now seen corresponding path program 6 times [2022-02-20 23:44:40,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:44:40,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1476886753] [2022-02-20 23:44:40,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:44:40,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:44:40,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:44:41,189 INFO L290 TraceCheckUtils]: 0: Hoare triple {9280#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); {9280#true} is VALID [2022-02-20 23:44:41,189 INFO L290 TraceCheckUtils]: 1: Hoare triple {9280#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset, main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset, main_#t~ret14#1, main_#t~ret15#1, main_~p~0#1.base, main_~p~0#1.offset;call main_#t~malloc12#1.base, main_#t~malloc12#1.offset := #Ultimate.allocOnHeap(94);main_~p~0#1.base, main_~p~0#1.offset := main_#t~malloc12#1.base, main_#t~malloc12#1.offset;havoc main_#t~malloc12#1.base, main_#t~malloc12#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := main_~p~0#1.base, main_~p~0#1.offset, 0, 94; {9282#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {9282#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {9282#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {9282#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr17#1;#Ultimate.C_memset_#t~loopctr17#1 := 0; {9283#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,191 INFO L290 TraceCheckUtils]: 4: Hoare triple {9283#(and (<= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 94) (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 0) (<= 94 |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9284#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {9284#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 93) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 1 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9285#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,192 INFO L290 TraceCheckUtils]: 6: Hoare triple {9285#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 2 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 92) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9286#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {9286#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ 91 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 3 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9287#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 4 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {9287#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 90) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 4 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9288#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 89) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 5 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {9288#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 89) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 5 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9289#(and (<= 6 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 88) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {9289#(and (<= 6 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 88) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9290#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 87) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 7 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {9290#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 87) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 7 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9291#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 86) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 8 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {9291#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 86) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 8 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9292#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 9 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 85) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {9292#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 9 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 85) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9293#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 10 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 84) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,198 INFO L290 TraceCheckUtils]: 14: Hoare triple {9293#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 10 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 84) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9294#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 83) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 11 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,198 INFO L290 TraceCheckUtils]: 15: Hoare triple {9294#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 83) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 11 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9295#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 82) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 12 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,199 INFO L290 TraceCheckUtils]: 16: Hoare triple {9295#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 82) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 12 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9296#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 81) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 13 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,200 INFO L290 TraceCheckUtils]: 17: Hoare triple {9296#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 81) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 13 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9297#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 14 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 80) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {9297#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 14 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 80) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9298#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 15 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 79) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {9298#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 15 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 79) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9299#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 16 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 78) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,202 INFO L290 TraceCheckUtils]: 20: Hoare triple {9299#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 16 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 78) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9300#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 17 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ 77 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {9300#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 17 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ 77 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9301#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 76) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 18 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {9301#(and (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 76) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 18 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9302#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 19 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 75) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,204 INFO L290 TraceCheckUtils]: 23: Hoare triple {9302#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= 19 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 75) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9303#(and (<= 20 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 74) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,205 INFO L290 TraceCheckUtils]: 24: Hoare triple {9303#(and (<= 20 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|) (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 74) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9304#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 73) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 21 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {9304#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) 0) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 73) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|) (<= 21 |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1|))} assume #Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr17#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr17#1 := 1 + #Ultimate.C_memset_#t~loopctr17#1; {9305#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) 1) 0)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 72) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 26: Hoare triple {9305#(and (<= (div |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 4294967296) (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296)) (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 4294967296) 1) 0)) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr17#1| 72) |ULTIMATE.start_#Ultimate.C_memset_#amount#1|))} assume !(#Ultimate.C_memset_#t~loopctr17#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {9281#false} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 27: Hoare triple {9281#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc main_#t~memset~res13#1.base, main_#t~memset~res13#1.offset; {9281#false} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 28: Hoare triple {9281#false} SUMMARY for call write~int(3, main_~p~0#1.base, main_~p~0#1.offset, 4); srcloc: L577 {9281#false} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 29: Hoare triple {9281#false} SUMMARY for call write~int(555, main_~p~0#1.base, 10 + main_~p~0#1.offset, 8); srcloc: L577-1 {9281#false} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 30: Hoare triple {9281#false} SUMMARY for call write~int(999, main_~p~0#1.base, 40 + main_~p~0#1.offset, 8); srcloc: L578 {9281#false} is VALID [2022-02-20 23:44:41,206 INFO L290 TraceCheckUtils]: 31: Hoare triple {9281#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 70 + main_~p~0#1.offset, 8); srcloc: L579 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 32: Hoare triple {9281#false} SUMMARY for call write~int(555, main_~p~0#1.base, 18 + main_~p~0#1.offset, 8); srcloc: L580 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 33: Hoare triple {9281#false} SUMMARY for call write~int(999, main_~p~0#1.base, 48 + main_~p~0#1.offset, 8); srcloc: L581 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 34: Hoare triple {9281#false} SUMMARY for call write~int(4311810305, main_~p~0#1.base, 78 + main_~p~0#1.offset, 8); srcloc: L582 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 35: Hoare triple {9281#false} assume { :begin_inline_Sum } true;Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum_#res#1;havoc Sum_#t~mem8#1, Sum_#t~post6#1, Sum_#t~mem7#1, Sum_~instrs#1.base, Sum_~instrs#1.offset, Sum_~count~0#1, Sum_~i~0#1;Sum_~instrs#1.base, Sum_~instrs#1.offset := Sum_#in~instrs#1.base, Sum_#in~instrs#1.offset;Sum_~count~0#1 := 0;havoc Sum_~i~0#1;Sum_~i~0#1 := 0; {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 36: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 37: Hoare triple {9281#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 38: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 39: Hoare triple {9281#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 40: Hoare triple {9281#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 41: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 42: Hoare triple {9281#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 43: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {9281#false} is VALID [2022-02-20 23:44:41,207 INFO L290 TraceCheckUtils]: 44: Hoare triple {9281#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 45: Hoare triple {9281#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 46: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 47: Hoare triple {9281#false} assume !!(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 48: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem8#1 := read~int(Sum_~instrs#1.base, 6 + (4 + Sum_~instrs#1.offset + 30 * Sum_~i~0#1), 8); srcloc: L557 {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 49: Hoare triple {9281#false} Sum_~count~0#1 := Sum_~count~0#1 + Sum_#t~mem8#1;havoc Sum_#t~mem8#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 50: Hoare triple {9281#false} Sum_#t~post6#1 := Sum_~i~0#1;Sum_~i~0#1 := 1 + Sum_#t~post6#1;havoc Sum_#t~post6#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 51: Hoare triple {9281#false} SUMMARY for call Sum_#t~mem7#1 := read~int(Sum_~instrs#1.base, Sum_~instrs#1.offset, 4); srcloc: L556-4 {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 52: Hoare triple {9281#false} assume !(Sum_~i~0#1 < Sum_#t~mem7#1);havoc Sum_#t~mem7#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 53: Hoare triple {9281#false} Sum_#res#1 := Sum_~count~0#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 54: Hoare triple {9281#false} main_#t~ret14#1 := Sum_#res#1;assume { :end_inline_Sum } true; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 55: Hoare triple {9281#false} assume !(4311811859 != main_#t~ret14#1 % 18446744073709551616);havoc main_#t~ret14#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 56: Hoare triple {9281#false} assume { :begin_inline_Sum2 } true;Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset := main_~p~0#1.base, main_~p~0#1.offset;havoc Sum2_#res#1;havoc Sum2_#t~mem11#1, Sum2_#t~post9#1, Sum2_#t~mem10#1, Sum2_~instrs#1.base, Sum2_~instrs#1.offset, Sum2_~count~1#1, Sum2_~i~1#1;Sum2_~instrs#1.base, Sum2_~instrs#1.offset := Sum2_#in~instrs#1.base, Sum2_#in~instrs#1.offset;Sum2_~count~1#1 := 0;havoc Sum2_~i~1#1;Sum2_~i~1#1 := 0; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 57: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 58: Hoare triple {9281#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {9281#false} is VALID [2022-02-20 23:44:41,208 INFO L290 TraceCheckUtils]: 59: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 60: Hoare triple {9281#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 61: Hoare triple {9281#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 62: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 63: Hoare triple {9281#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 64: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 65: Hoare triple {9281#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 66: Hoare triple {9281#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 67: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 68: Hoare triple {9281#false} assume !!(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 69: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem11#1 := read~int(Sum2_~instrs#1.base, 14 + (4 + Sum2_~instrs#1.offset + 30 * Sum2_~i~1#1), 8); srcloc: L567 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 70: Hoare triple {9281#false} Sum2_~count~1#1 := Sum2_~count~1#1 + Sum2_#t~mem11#1;havoc Sum2_#t~mem11#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 71: Hoare triple {9281#false} Sum2_#t~post9#1 := Sum2_~i~1#1;Sum2_~i~1#1 := 1 + Sum2_#t~post9#1;havoc Sum2_#t~post9#1; {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 72: Hoare triple {9281#false} SUMMARY for call Sum2_#t~mem10#1 := read~int(Sum2_~instrs#1.base, Sum2_~instrs#1.offset, 4); srcloc: L566-4 {9281#false} is VALID [2022-02-20 23:44:41,209 INFO L290 TraceCheckUtils]: 73: Hoare triple {9281#false} assume !(Sum2_~i~1#1 < Sum2_#t~mem10#1);havoc Sum2_#t~mem10#1; {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L290 TraceCheckUtils]: 74: Hoare triple {9281#false} Sum2_#res#1 := Sum2_~count~1#1; {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L290 TraceCheckUtils]: 75: Hoare triple {9281#false} main_#t~ret15#1 := Sum2_#res#1;assume { :end_inline_Sum2 } true;assume -9223372036854775808 <= main_#t~ret15#1 && main_#t~ret15#1 <= 9223372036854775807; {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L290 TraceCheckUtils]: 76: Hoare triple {9281#false} assume !(4311811859 != main_#t~ret15#1);havoc main_#t~ret15#1; {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L290 TraceCheckUtils]: 77: Hoare triple {9281#false} main_~p~0#1.base, main_~p~0#1.offset := 0, 0;main_#res#1 := 0; {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L290 TraceCheckUtils]: 78: Hoare triple {9281#false} assume !(#valid == main_old_#valid#1); {9281#false} is VALID [2022-02-20 23:44:41,210 INFO L134 CoverageAnalysis]: Checked inductivity of 295 backedges. 0 proven. 253 refuted. 0 times theorem prover too weak. 42 trivial. 0 not checked. [2022-02-20 23:44:41,210 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:44:41,210 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1476886753] [2022-02-20 23:44:41,210 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1476886753] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:44:41,211 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6803563] [2022-02-20 23:44:41,211 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 23:44:41,211 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:44:41,211 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:44:41,212 INFO L229 MonitoredProcess]: Starting monitored process 12 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:44:41,212 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process