./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn5.c --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/ifeqn5.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:29:25,003 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:29:25,005 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:29:25,046 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:29:25,047 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:29:25,050 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:29:25,051 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:29:25,054 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:29:25,056 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:29:25,060 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:29:25,061 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:29:25,062 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:29:25,062 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:29:25,065 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:29:25,066 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:29:25,069 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:29:25,070 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:29:25,071 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:29:25,073 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:29:25,078 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:29:25,079 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:29:25,080 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:29:25,082 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:29:25,082 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:29:25,088 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:29:25,089 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:29:25,089 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:29:25,091 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:29:25,091 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:29:25,092 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:29:25,092 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:29:25,093 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:29:25,095 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:29:25,095 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:29:25,097 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:29:25,097 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:29:25,097 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:29:25,098 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:29:25,099 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:29:25,099 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:29:25,100 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:29:25,101 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 14:29:25,129 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:29:25,129 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:29:25,130 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:29:25,130 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:29:25,131 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:29:25,131 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:29:25,132 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:29:25,132 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:29:25,132 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:29:25,132 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:29:25,133 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:29:25,133 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:29:25,133 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:29:25,134 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:29:25,134 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:29:25,134 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:29:25,134 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:29:25,134 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:29:25,135 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:29:25,135 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:29:25,135 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:29:25,135 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:29:25,135 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:29:25,135 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:29:25,136 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:25,136 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:29:25,136 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:29:25,137 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:29:25,137 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:29:25,138 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:29:25,138 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:29:25,138 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:29:25,138 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:29:25,138 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 ! call(reach_error())) ) 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 -> 2e5b1d71ba93ce7431f315c72529ea116ea643f5eb9195d392455a202e45b249 [2022-02-20 14:29:25,379 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:29:25,402 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:29:25,405 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:29:25,406 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:29:25,407 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:29:25,408 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn5.c [2022-02-20 14:29:25,460 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009695423/4f8a25e6d12141bfae29a4c561c2dc30/FLAG7b3be07d4 [2022-02-20 14:29:25,855 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:29:25,855 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c [2022-02-20 14:29:25,864 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009695423/4f8a25e6d12141bfae29a4c561c2dc30/FLAG7b3be07d4 [2022-02-20 14:29:25,877 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/009695423/4f8a25e6d12141bfae29a4c561c2dc30 [2022-02-20 14:29:25,879 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:29:25,880 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:29:25,882 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:25,884 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:29:25,887 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:29:25,888 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:25" (1/1) ... [2022-02-20 14:29:25,889 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4f5124fd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:25, skipping insertion in model container [2022-02-20 14:29:25,889 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:25" (1/1) ... [2022-02-20 14:29:25,895 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:29:25,907 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:29:26,044 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c[589,602] [2022-02-20 14:29:26,065 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:26,074 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:29:26,085 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn5.c[589,602] [2022-02-20 14:29:26,094 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:26,107 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:29:26,108 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26 WrapperNode [2022-02-20 14:29:26,108 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:26,109 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:26,109 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:29:26,109 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:29:26,116 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,122 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,146 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-02-20 14:29:26,156 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:26,157 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:29:26,158 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:29:26,158 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:29:26,165 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,165 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,170 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,170 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,183 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,193 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,195 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,196 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:29:26,197 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:29:26,198 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:29:26,198 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:29:26,199 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (1/1) ... [2022-02-20 14:29:26,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:26,212 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:26,224 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 14:29:26,228 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 14:29:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:29:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:29:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:29:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:29:26,259 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:29:26,259 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:29:26,260 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:29:26,309 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:29:26,311 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:29:26,522 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:29:26,527 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:29:26,527 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:29:26,528 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:26 BoogieIcfgContainer [2022-02-20 14:29:26,529 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:29:26,530 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:29:26,530 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:29:26,546 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:29:26,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:29:25" (1/3) ... [2022-02-20 14:29:26,547 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c872a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:26, skipping insertion in model container [2022-02-20 14:29:26,547 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:26" (2/3) ... [2022-02-20 14:29:26,548 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79c872a9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:26, skipping insertion in model container [2022-02-20 14:29:26,548 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:26" (3/3) ... [2022-02-20 14:29:26,549 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn5.c [2022-02-20 14:29:26,554 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:29:26,555 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:29:26,617 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:29:26,627 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 14:29:26,627 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:29:26,658 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:26,663 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:26,663 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:26,664 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:26,665 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:26,670 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:26,671 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-02-20 14:29:26,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:26,681 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2134706387] [2022-02-20 14:29:26,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:26,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:26,830 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:26,900 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {26#true} is VALID [2022-02-20 14:29:26,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {26#true} is VALID [2022-02-20 14:29:26,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 14:29:26,904 INFO L290 TraceCheckUtils]: 3: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 14:29:26,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:26,905 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume !(main_~i~0#1 < ~N~0); {27#false} is VALID [2022-02-20 14:29:26,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:26,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:29:26,906 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:26,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {27#false} is VALID [2022-02-20 14:29:26,907 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:29:26,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:29:26,908 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 14:29:26,909 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:26,909 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2134706387] [2022-02-20 14:29:26,911 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2134706387] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:26,911 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:26,911 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:29:26,915 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1382800616] [2022-02-20 14:29:26,916 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:26,921 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:26,923 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:26,927 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:26,959 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:26,960 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:29:26,961 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:26,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:29:26,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:29:26,990 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.5714285714285714) internal successors, (33), 22 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,049 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,049 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-02-20 14:29:27,050 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:29:27,050 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:27,050 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:27,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,059 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:27,059 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:27,067 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 14:29:27,143 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 14:29:27,154 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:29:27,154 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:29:27,157 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:29:27,162 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:27,163 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:27,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:29:27,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:29:27,191 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:27,193 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,194 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,195 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,199 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:27,200 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:27,200 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,201 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:29:27,202 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:29:27,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,204 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:27,205 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:27,205 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,205 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,205 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:27,206 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:27,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2777777777777777) internal successors, (23), 18 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,211 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:29:27,212 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-02-20 14:29:27,213 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:27,213 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:29:27,214 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 6.0) internal successors, (12), 2 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,214 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:27,214 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:27,215 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:27,215 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:27,216 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:29:27,217 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:27,223 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:27,223 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-02-20 14:29:27,224 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:27,224 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1173207219] [2022-02-20 14:29:27,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:27,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:27,305 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:27,382 INFO L290 TraceCheckUtils]: 0: Hoare triple {140#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {140#true} is VALID [2022-02-20 14:29:27,383 INFO L290 TraceCheckUtils]: 1: Hoare triple {140#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {140#true} is VALID [2022-02-20 14:29:27,389 INFO L290 TraceCheckUtils]: 2: Hoare triple {140#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {142#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:27,389 INFO L290 TraceCheckUtils]: 3: Hoare triple {142#(<= 1 ~N~0)} assume !(0 == assume_abort_if_not_~cond#1); {142#(<= 1 ~N~0)} is VALID [2022-02-20 14:29:27,390 INFO L290 TraceCheckUtils]: 4: Hoare triple {142#(<= 1 ~N~0)} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} is VALID [2022-02-20 14:29:27,392 INFO L290 TraceCheckUtils]: 5: Hoare triple {143#(and (= |ULTIMATE.start_main_~i~0#1| 0) (<= 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {141#false} is VALID [2022-02-20 14:29:27,392 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:27,392 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#false} assume !(main_~i~0#1 < ~N~0); {141#false} is VALID [2022-02-20 14:29:27,392 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:27,393 INFO L290 TraceCheckUtils]: 9: Hoare triple {141#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {141#false} is VALID [2022-02-20 14:29:27,394 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond#1; {141#false} is VALID [2022-02-20 14:29:27,394 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 14:29:27,394 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 14:29:27,395 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:27,395 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1173207219] [2022-02-20 14:29:27,395 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1173207219] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:27,396 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:27,396 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:29:27,396 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138435483] [2022-02-20 14:29:27,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:27,398 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:27,398 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:27,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,413 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:27,414 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:29:27,414 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:27,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:29:27,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:27,415 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,536 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,536 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:29:27,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:29:27,537 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 14:29:27,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:27,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:27,541 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 14:29:27,592 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:27,596 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:29:27,596 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:29:27,600 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:27,603 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 26 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 26 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:27,604 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 17 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 26 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:27,605 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:29:27,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-02-20 14:29:27,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:27,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,620 INFO L74 IsIncluded]: Start isIncluded. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,621 INFO L87 Difference]: Start difference. First operand 31 states. Second operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,622 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,623 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:27,623 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:27,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,624 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:29:27,626 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 31 states. [2022-02-20 14:29:27,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:27,628 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:27,628 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:27,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:27,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:27,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:27,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:27,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:29:27,633 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-02-20 14:29:27,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:27,634 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:29:27,634 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.0) internal successors, (12), 4 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:27,636 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:27,636 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:29:27,637 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:27,637 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:27,637 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:29:27,637 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:27,639 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:27,639 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-02-20 14:29:27,639 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:27,639 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1925310253] [2022-02-20 14:29:27,640 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:27,640 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:27,697 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:27,697 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [926829995] [2022-02-20 14:29:27,697 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:27,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:27,698 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:27,700 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 14:29:27,701 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 14:29:27,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:27,763 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:29:27,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:27,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:27,888 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 14:29:28,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {290#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {290#true} is VALID [2022-02-20 14:29:28,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {290#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {290#true} is VALID [2022-02-20 14:29:28,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {290#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {290#true} is VALID [2022-02-20 14:29:28,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {290#true} assume !(0 == assume_abort_if_not_~cond#1); {290#true} is VALID [2022-02-20 14:29:28,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {290#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {290#true} is VALID [2022-02-20 14:29:28,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:28,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#true} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {290#true} is VALID [2022-02-20 14:29:28,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {290#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {290#true} is VALID [2022-02-20 14:29:28,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#true} assume !(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:28,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#true} main_~i~0#1 := 0; {290#true} is VALID [2022-02-20 14:29:28,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:28,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {290#true} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:28,079 INFO L290 TraceCheckUtils]: 12: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:28,079 INFO L290 TraceCheckUtils]: 13: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:28,080 INFO L290 TraceCheckUtils]: 14: Hoare triple {328#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:28,081 INFO L290 TraceCheckUtils]: 15: Hoare triple {338#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {342#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:28,081 INFO L290 TraceCheckUtils]: 16: Hoare triple {342#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {291#false} is VALID [2022-02-20 14:29:28,081 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-02-20 14:29:28,082 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:29:28,082 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:28,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:28,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1925310253] [2022-02-20 14:29:28,082 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:28,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [926829995] [2022-02-20 14:29:28,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [926829995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:28,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:28,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:28,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1616058741] [2022-02-20 14:29:28,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:28,084 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:29:28,084 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:28,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,127 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:28,128 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:28,128 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:28,129 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:28,129 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:28,129 INFO L87 Difference]: Start difference. First operand 23 states and 27 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,382 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:28,382 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 14:29:28,382 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:29:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 14:29:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:28,384 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,384 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:28,385 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 14:29:28,440 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 42 edges. 42 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:28,442 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:29:28,443 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:29:28,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:29:28,446 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 68 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:28,447 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 68 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:28,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:29:28,462 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 14:29:28,462 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:28,463 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,464 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,464 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:28,468 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:28,468 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:28,469 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:28,469 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:28,469 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:29:28,469 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 38 states. [2022-02-20 14:29:28,470 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:28,471 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:28,471 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:28,471 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:28,471 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:28,471 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:28,471 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:28,471 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2222222222222223) internal successors, (33), 27 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 14:29:28,472 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-02-20 14:29:28,472 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:28,473 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 14:29:28,473 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:28,473 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 14:29:28,473 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:29:28,473 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:28,474 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:28,507 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 14:29:28,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:28,703 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:28,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:28,704 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-02-20 14:29:28,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:28,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [125993234] [2022-02-20 14:29:28,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:28,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:28,738 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:28,738 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [619922183] [2022-02-20 14:29:28,738 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:28,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:28,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:28,740 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 14:29:28,742 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 14:29:28,799 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:28,800 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:29:28,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:28,817 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:28,990 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {512#true} is VALID [2022-02-20 14:29:28,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {512#true} is VALID [2022-02-20 14:29:28,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {512#true} is VALID [2022-02-20 14:29:28,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume !(0 == assume_abort_if_not_~cond#1); {512#true} is VALID [2022-02-20 14:29:28,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:28,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:28,997 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:29,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:29,002 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {543#(<= ~N~0 1)} is VALID [2022-02-20 14:29:29,003 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(<= ~N~0 1)} main_~i~0#1 := 0; {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:29,003 INFO L290 TraceCheckUtils]: 10: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0); {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:29,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:29,006 INFO L290 TraceCheckUtils]: 12: Hoare triple {547#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {557#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:29:29,006 INFO L290 TraceCheckUtils]: 13: Hoare triple {557#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {513#false} is VALID [2022-02-20 14:29:29,007 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:29,008 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:29,008 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:29,008 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:29,177 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 18: Hoare triple {513#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 15: Hoare triple {513#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {513#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {513#false} is VALID [2022-02-20 14:29:29,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {603#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:29,179 INFO L290 TraceCheckUtils]: 12: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {603#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:29,179 INFO L290 TraceCheckUtils]: 11: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:29,184 INFO L290 TraceCheckUtils]: 10: Hoare triple {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:29,184 INFO L290 TraceCheckUtils]: 9: Hoare triple {543#(<= ~N~0 1)} main_~i~0#1 := 0; {607#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:29,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {543#(<= ~N~0 1)} is VALID [2022-02-20 14:29:29,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {539#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:29,186 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:29,186 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:29,187 INFO L290 TraceCheckUtils]: 4: Hoare triple {512#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:29,187 INFO L290 TraceCheckUtils]: 3: Hoare triple {512#true} assume !(0 == assume_abort_if_not_~cond#1); {512#true} is VALID [2022-02-20 14:29:29,187 INFO L290 TraceCheckUtils]: 2: Hoare triple {512#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {512#true} is VALID [2022-02-20 14:29:29,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {512#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {512#true} is VALID [2022-02-20 14:29:29,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {512#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {512#true} is VALID [2022-02-20 14:29:29,187 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:29,187 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:29,187 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [125993234] [2022-02-20 14:29:29,188 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:29,188 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [619922183] [2022-02-20 14:29:29,188 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [619922183] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:29,188 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:29,188 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:29:29,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918590726] [2022-02-20 14:29:29,189 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:29,189 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:29:29,189 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:29,189 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,213 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 14:29:29,213 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:29:29,213 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:29,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:29:29,214 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:29:29,214 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,557 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:29,557 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-02-20 14:29:29,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:29:29,558 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:29:29,558 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:29,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:29,559 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:29,561 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-02-20 14:29:29,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:29,632 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:29:29,632 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 14:29:29,633 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:29,635 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 41 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 42 SdHoareTripleChecker+Invalid, 113 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:29,636 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 42 Invalid, 113 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:29,637 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 14:29:29,650 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-02-20 14:29:29,650 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:29,650 INFO L82 GeneralOperation]: Start isEquivalent. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,650 INFO L74 IsIncluded]: Start isIncluded. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,651 INFO L87 Difference]: Start difference. First operand 43 states. Second operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,652 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:29,652 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:29,652 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:29,653 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:29,653 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:29,653 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 14:29:29,654 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 43 states. [2022-02-20 14:29:29,655 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:29,655 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:29,655 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:29,656 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:29,656 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:29,656 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:29,656 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:29,656 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.1923076923076923) internal successors, (31), 26 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 14:29:29,658 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-02-20 14:29:29,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:29,658 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 14:29:29,658 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:29,658 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:29:29,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:29:29,659 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:29,659 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:29,687 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 14:29:29,879 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,SelfDestructingSolverStorable3 [2022-02-20 14:29:29,880 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:29,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:29,880 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-02-20 14:29:29,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:29,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881992173] [2022-02-20 14:29:29,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:29,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:29,925 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:29,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [185757478] [2022-02-20 14:29:29,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:29,926 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:29,926 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:29,928 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 14:29:29,941 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 14:29:30,007 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:30,008 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 14:29:30,018 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:30,019 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:30,074 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 14:29:30,152 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 14:29:30,153 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:29:30,278 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {856#true} is VALID [2022-02-20 14:29:30,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {856#true} is VALID [2022-02-20 14:29:30,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {856#true} is VALID [2022-02-20 14:29:30,278 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#true} assume !(0 == assume_abort_if_not_~cond#1); {856#true} is VALID [2022-02-20 14:29:30,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:30,279 INFO L290 TraceCheckUtils]: 5: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:30,279 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:30,280 INFO L290 TraceCheckUtils]: 7: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:30,280 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:30,280 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {856#true} is VALID [2022-02-20 14:29:30,280 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:30,280 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:30,288 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#true} main_~i~0#1 := 0; {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:30,288 INFO L290 TraceCheckUtils]: 13: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:30,289 INFO L290 TraceCheckUtils]: 14: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:30,290 INFO L290 TraceCheckUtils]: 15: Hoare triple {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:30,290 INFO L290 TraceCheckUtils]: 16: Hoare triple {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0); {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:30,291 INFO L290 TraceCheckUtils]: 17: Hoare triple {908#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} is VALID [2022-02-20 14:29:30,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {904#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:30,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:29:30,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:30,294 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:29:30,294 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:30,698 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 19 [2022-02-20 14:29:30,746 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:30,747 INFO L290 TraceCheckUtils]: 22: Hoare triple {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {857#false} is VALID [2022-02-20 14:29:30,750 INFO L290 TraceCheckUtils]: 21: Hoare triple {941#(and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {928#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:30,751 INFO L290 TraceCheckUtils]: 20: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_~i~0#1 := 0; {941#(and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))))))} is VALID [2022-02-20 14:29:30,752 INFO L290 TraceCheckUtils]: 19: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,757 INFO L290 TraceCheckUtils]: 17: Hoare triple {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {915#(= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))} is VALID [2022-02-20 14:29:30,760 INFO L290 TraceCheckUtils]: 16: Hoare triple {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} assume !!(main_~i~0#1 < ~N~0); {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:30,762 INFO L290 TraceCheckUtils]: 15: Hoare triple {961#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {954#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:30,772 INFO L290 TraceCheckUtils]: 14: Hoare triple {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {961#(forall ((v_ArrVal_82 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_82) |ULTIMATE.start_main_~b~0#1.offset|) 1))} is VALID [2022-02-20 14:29:30,773 INFO L290 TraceCheckUtils]: 13: Hoare triple {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} assume !!(main_~i~0#1 < ~N~0); {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} is VALID [2022-02-20 14:29:30,773 INFO L290 TraceCheckUtils]: 12: Hoare triple {856#true} main_~i~0#1 := 0; {965#(not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0))} is VALID [2022-02-20 14:29:30,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:30,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 9: Hoare triple {856#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 7: Hoare triple {856#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 4: Hoare triple {856#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 3: Hoare triple {856#true} assume !(0 == assume_abort_if_not_~cond#1); {856#true} is VALID [2022-02-20 14:29:30,774 INFO L290 TraceCheckUtils]: 2: Hoare triple {856#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {856#true} is VALID [2022-02-20 14:29:30,775 INFO L290 TraceCheckUtils]: 1: Hoare triple {856#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {856#true} is VALID [2022-02-20 14:29:30,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {856#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {856#true} is VALID [2022-02-20 14:29:30,775 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:30,775 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:30,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881992173] [2022-02-20 14:29:30,775 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:30,775 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [185757478] [2022-02-20 14:29:30,776 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [185757478] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:30,776 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:30,776 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-02-20 14:29:30,776 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375264139] [2022-02-20 14:29:30,776 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:30,776 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:29:30,777 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:30,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:30,823 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:30,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:29:30,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:30,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:29:30,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:29:30,824 INFO L87 Difference]: Start difference. First operand 27 states and 31 transitions. Second operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:31,225 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 14:29:31,225 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:29:31,226 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:29:31,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:31,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,228 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:31,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:31,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2022-02-20 14:29:31,312 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:31,313 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:29:31,313 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 14:29:31,313 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 36 SyntacticMatches, 1 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=58, Invalid=124, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:29:31,314 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 28 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 103 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 28 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 103 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 63 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:31,314 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [28 Valid, 84 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 103 Invalid, 0 Unknown, 63 Unchecked, 0.1s Time] [2022-02-20 14:29:31,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 14:29:31,331 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-02-20 14:29:31,332 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:31,332 INFO L82 GeneralOperation]: Start isEquivalent. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,332 INFO L74 IsIncluded]: Start isIncluded. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,332 INFO L87 Difference]: Start difference. First operand 61 states. Second operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,334 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:31,334 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:31,335 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:31,335 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:31,335 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:31,335 INFO L74 IsIncluded]: Start isIncluded. First operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states. [2022-02-20 14:29:31,336 INFO L87 Difference]: Start difference. First operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 61 states. [2022-02-20 14:29:31,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:31,338 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:31,338 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:31,338 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:31,339 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:31,339 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:31,339 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:31,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 38 states, 37 states have (on average 1.2162162162162162) internal successors, (45), 37 states have internal predecessors, (45), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,340 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 14:29:31,340 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-02-20 14:29:31,341 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:31,341 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 14:29:31,341 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.090909090909091) internal successors, (34), 11 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:31,341 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 14:29:31,342 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:29:31,342 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:31,342 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:31,375 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 14:29:31,555 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:31,555 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:31,556 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:31,556 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-02-20 14:29:31,556 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:31,556 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1703718091] [2022-02-20 14:29:31,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:31,556 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:31,602 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:31,602 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1804907537] [2022-02-20 14:29:31,602 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:31,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:31,602 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:31,607 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 14:29:31,608 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 14:29:31,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:31,701 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 39 conjunts are in the unsatisfiable core [2022-02-20 14:29:31,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:31,719 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:31,744 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:29:31,788 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:29:31,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:31,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 14:29:31,999 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 14:29:32,116 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:32,119 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:29:32,119 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 32 [2022-02-20 14:29:32,650 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:29:32,651 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 38 [2022-02-20 14:29:32,705 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1274#true} is VALID [2022-02-20 14:29:32,706 INFO L290 TraceCheckUtils]: 1: Hoare triple {1274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1274#true} is VALID [2022-02-20 14:29:32,706 INFO L290 TraceCheckUtils]: 2: Hoare triple {1274#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1274#true} is VALID [2022-02-20 14:29:32,706 INFO L290 TraceCheckUtils]: 3: Hoare triple {1274#true} assume !(0 == assume_abort_if_not_~cond#1); {1274#true} is VALID [2022-02-20 14:29:32,707 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,707 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,708 INFO L290 TraceCheckUtils]: 6: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,709 INFO L290 TraceCheckUtils]: 7: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,710 INFO L290 TraceCheckUtils]: 8: Hoare triple {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,711 INFO L290 TraceCheckUtils]: 9: Hoare triple {1302#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,711 INFO L290 TraceCheckUtils]: 10: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(main_~i~0#1 < ~N~0); {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {1309#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~i~0#1 := 0; {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:32,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {1298#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1325#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,715 INFO L290 TraceCheckUtils]: 15: Hoare triple {1325#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,717 INFO L290 TraceCheckUtils]: 17: Hoare triple {1329#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,718 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,720 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(main_~i~0#1 < ~N~0); {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,721 INFO L290 TraceCheckUtils]: 20: Hoare triple {1336#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_~i~0#1 := 0; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,723 INFO L290 TraceCheckUtils]: 21: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,724 INFO L290 TraceCheckUtils]: 22: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,725 INFO L290 TraceCheckUtils]: 23: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,726 INFO L290 TraceCheckUtils]: 24: Hoare triple {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1359#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:32,728 INFO L290 TraceCheckUtils]: 25: Hoare triple {1359#(and (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (= (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:32,728 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1275#false} is VALID [2022-02-20 14:29:32,728 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:32,729 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:32,729 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:33,808 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:33,809 INFO L290 TraceCheckUtils]: 26: Hoare triple {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1275#false} is VALID [2022-02-20 14:29:33,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#(and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1363#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:33,851 INFO L290 TraceCheckUtils]: 24: Hoare triple {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {1376#(and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368))))))} is VALID [2022-02-20 14:29:33,852 INFO L290 TraceCheckUtils]: 23: Hoare triple {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:33,853 INFO L290 TraceCheckUtils]: 22: Hoare triple {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} assume !(0 == __VERIFIER_assert_~cond#1); {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:33,854 INFO L290 TraceCheckUtils]: 21: Hoare triple {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:33,854 INFO L290 TraceCheckUtils]: 20: Hoare triple {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} main_~i~0#1 := 0; {1380#(and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:33,855 INFO L290 TraceCheckUtils]: 19: Hoare triple {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} assume !(main_~i~0#1 < ~N~0); {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,855 INFO L290 TraceCheckUtils]: 18: Hoare triple {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,865 INFO L290 TraceCheckUtils]: 17: Hoare triple {1403#(= 11 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1393#(= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,866 INFO L290 TraceCheckUtils]: 16: Hoare triple {1403#(= 11 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !!(main_~i~0#1 < ~N~0); {1403#(= 11 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:33,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1403#(= 11 (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:33,870 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1410#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,871 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} assume !!(main_~i~0#1 < ~N~0); {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,872 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} main_~i~0#1 := 0; {1414#(= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)} is VALID [2022-02-20 14:29:33,872 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} assume !(main_~i~0#1 < ~N~0); {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} is VALID [2022-02-20 14:29:33,872 INFO L290 TraceCheckUtils]: 10: Hoare triple {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} is VALID [2022-02-20 14:29:33,877 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {1421#(= (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1) 11)} is VALID [2022-02-20 14:29:33,878 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} assume !!(main_~i~0#1 < ~N~0); {1431#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} is VALID [2022-02-20 14:29:33,880 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1431#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} is VALID [2022-02-20 14:29:33,881 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {1438#(forall ((v_ArrVal_112 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_112)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10))} is VALID [2022-02-20 14:29:33,882 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} assume !!(main_~i~0#1 < ~N~0); {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} is VALID [2022-02-20 14:29:33,883 INFO L290 TraceCheckUtils]: 4: Hoare triple {1274#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1442#(and (or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|))) (not (= |ULTIMATE.start_main_~a~0#1.offset| (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)))))} is VALID [2022-02-20 14:29:33,883 INFO L290 TraceCheckUtils]: 3: Hoare triple {1274#true} assume !(0 == assume_abort_if_not_~cond#1); {1274#true} is VALID [2022-02-20 14:29:33,883 INFO L290 TraceCheckUtils]: 2: Hoare triple {1274#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1274#true} is VALID [2022-02-20 14:29:33,883 INFO L290 TraceCheckUtils]: 1: Hoare triple {1274#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1274#true} is VALID [2022-02-20 14:29:33,883 INFO L290 TraceCheckUtils]: 0: Hoare triple {1274#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1274#true} is VALID [2022-02-20 14:29:33,884 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:33,884 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:33,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1703718091] [2022-02-20 14:29:33,884 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:33,884 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1804907537] [2022-02-20 14:29:33,884 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1804907537] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:33,884 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:33,884 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-02-20 14:29:33,884 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1184218568] [2022-02-20 14:29:33,884 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:33,885 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:29:33,885 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:33,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:45,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 49 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:45,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:29:45,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:45,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:29:45,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2022-02-20 14:29:45,172 INFO L87 Difference]: Start difference. First operand 38 states and 45 transitions. Second operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:46,954 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:46,955 INFO L93 Difference]: Finished difference Result 123 states and 150 transitions. [2022-02-20 14:29:46,955 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2022-02-20 14:29:46,955 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 14:29:46,955 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:46,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:46,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-02-20 14:29:46,958 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:46,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 98 transitions. [2022-02-20 14:29:46,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 27 states and 98 transitions. [2022-02-20 14:29:47,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:47,158 INFO L225 Difference]: With dead ends: 123 [2022-02-20 14:29:47,159 INFO L226 Difference]: Without dead ends: 92 [2022-02-20 14:29:47,159 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 33 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 231 ImplicationChecksByTransitivity, 1.7s TimeCoverageRelationStatistics Valid=178, Invalid=752, Unknown=0, NotChecked=0, Total=930 [2022-02-20 14:29:47,160 INFO L933 BasicCegarLoop]: 11 mSDtfsCounter, 33 mSDsluCounter, 73 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 84 SdHoareTripleChecker+Invalid, 259 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:47,160 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 84 Invalid, 259 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 151 Invalid, 0 Unknown, 72 Unchecked, 0.2s Time] [2022-02-20 14:29:47,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-02-20 14:29:47,209 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 81. [2022-02-20 14:29:47,210 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:47,210 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,211 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,211 INFO L87 Difference]: Start difference. First operand 92 states. Second operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,214 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2022-02-20 14:29:47,214 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2022-02-20 14:29:47,214 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:47,214 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:47,215 INFO L74 IsIncluded]: Start isIncluded. First operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states. [2022-02-20 14:29:47,215 INFO L87 Difference]: Start difference. First operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 92 states. [2022-02-20 14:29:47,219 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,220 INFO L93 Difference]: Finished difference Result 92 states and 110 transitions. [2022-02-20 14:29:47,220 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 110 transitions. [2022-02-20 14:29:47,221 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:47,221 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:47,221 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:47,222 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 80 states have (on average 1.2375) internal successors, (99), 80 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 99 transitions. [2022-02-20 14:29:47,225 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 99 transitions. Word has length 28 [2022-02-20 14:29:47,225 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:47,225 INFO L470 AbstractCegarLoop]: Abstraction has 81 states and 99 transitions. [2022-02-20 14:29:47,225 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 22 states have (on average 2.272727272727273) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,226 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 99 transitions. [2022-02-20 14:29:47,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:47,226 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:47,227 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:47,255 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 14:29:47,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:47,442 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:47,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:47,443 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-02-20 14:29:47,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:47,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [263988820] [2022-02-20 14:29:47,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:47,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:47,484 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:47,484 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [406725569] [2022-02-20 14:29:47,485 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:47,485 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:47,485 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:47,487 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 14:29:47,487 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 14:29:47,553 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:47,553 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:47,554 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:29:47,567 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:47,568 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:47,688 INFO L290 TraceCheckUtils]: 0: Hoare triple {1933#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {1933#true} is VALID [2022-02-20 14:29:47,688 INFO L290 TraceCheckUtils]: 1: Hoare triple {1933#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {1933#true} is VALID [2022-02-20 14:29:47,689 INFO L290 TraceCheckUtils]: 2: Hoare triple {1933#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1933#true} is VALID [2022-02-20 14:29:47,689 INFO L290 TraceCheckUtils]: 3: Hoare triple {1933#true} assume !(0 == assume_abort_if_not_~cond#1); {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 4: Hoare triple {1933#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 5: Hoare triple {1933#true} assume !!(main_~i~0#1 < ~N~0); {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 6: Hoare triple {1933#true} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 7: Hoare triple {1933#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 8: Hoare triple {1933#true} assume !!(main_~i~0#1 < ~N~0); {1933#true} is VALID [2022-02-20 14:29:47,690 INFO L290 TraceCheckUtils]: 9: Hoare triple {1933#true} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {1933#true} is VALID [2022-02-20 14:29:47,691 INFO L290 TraceCheckUtils]: 10: Hoare triple {1933#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1933#true} is VALID [2022-02-20 14:29:47,691 INFO L290 TraceCheckUtils]: 11: Hoare triple {1933#true} assume !(main_~i~0#1 < ~N~0); {1933#true} is VALID [2022-02-20 14:29:47,691 INFO L290 TraceCheckUtils]: 12: Hoare triple {1933#true} main_~i~0#1 := 0; {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,692 INFO L290 TraceCheckUtils]: 13: Hoare triple {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,692 INFO L290 TraceCheckUtils]: 14: Hoare triple {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,696 INFO L290 TraceCheckUtils]: 15: Hoare triple {1974#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,697 INFO L290 TraceCheckUtils]: 16: Hoare triple {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,697 INFO L290 TraceCheckUtils]: 17: Hoare triple {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,698 INFO L290 TraceCheckUtils]: 18: Hoare triple {1984#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1994#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,698 INFO L290 TraceCheckUtils]: 19: Hoare triple {1994#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1994#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:47,699 INFO L290 TraceCheckUtils]: 20: Hoare triple {1994#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1934#false} is VALID [2022-02-20 14:29:47,699 INFO L290 TraceCheckUtils]: 21: Hoare triple {1934#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1934#false} is VALID [2022-02-20 14:29:47,699 INFO L290 TraceCheckUtils]: 22: Hoare triple {1934#false} assume !!(main_~i~0#1 < ~N~0); {1934#false} is VALID [2022-02-20 14:29:47,699 INFO L290 TraceCheckUtils]: 23: Hoare triple {1934#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 24: Hoare triple {1934#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 25: Hoare triple {1934#false} assume !(main_~i~0#1 < ~N~0); {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 26: Hoare triple {1934#false} main_~i~0#1 := 0; {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 27: Hoare triple {1934#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 28: Hoare triple {1934#false} assume 0 == __VERIFIER_assert_~cond#1; {1934#false} is VALID [2022-02-20 14:29:47,700 INFO L290 TraceCheckUtils]: 29: Hoare triple {1934#false} assume !false; {1934#false} is VALID [2022-02-20 14:29:47,701 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 20 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:47,701 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:47,702 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:47,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [263988820] [2022-02-20 14:29:47,702 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:47,702 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [406725569] [2022-02-20 14:29:47,702 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [406725569] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:47,702 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:47,703 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:47,703 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [714056786] [2022-02-20 14:29:47,703 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:47,704 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:47,704 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:47,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:47,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:47,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:47,728 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:47,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:47,729 INFO L87 Difference]: Start difference. First operand 81 states and 99 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:47,906 INFO L93 Difference]: Finished difference Result 137 states and 164 transitions. [2022-02-20 14:29:47,906 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:29:47,906 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:47,907 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:47,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:47,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:47,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:47,909 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 14:29:47,964 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 14:29:47,966 INFO L225 Difference]: With dead ends: 137 [2022-02-20 14:29:47,966 INFO L226 Difference]: Without dead ends: 80 [2022-02-20 14:29:47,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 29 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:47,967 INFO L933 BasicCegarLoop]: 17 mSDtfsCounter, 32 mSDsluCounter, 11 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 28 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:47,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 28 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:47,968 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2022-02-20 14:29:48,017 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 66. [2022-02-20 14:29:48,017 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:48,018 INFO L82 GeneralOperation]: Start isEquivalent. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:48,018 INFO L74 IsIncluded]: Start isIncluded. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:48,018 INFO L87 Difference]: Start difference. First operand 80 states. Second operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:48,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:48,020 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 14:29:48,020 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 14:29:48,020 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:48,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:48,021 INFO L74 IsIncluded]: Start isIncluded. First operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-20 14:29:48,021 INFO L87 Difference]: Start difference. First operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 80 states. [2022-02-20 14:29:48,023 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:48,023 INFO L93 Difference]: Finished difference Result 80 states and 89 transitions. [2022-02-20 14:29:48,023 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 89 transitions. [2022-02-20 14:29:48,023 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:48,024 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:48,024 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:48,024 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:48,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 65 states have (on average 1.1538461538461537) internal successors, (75), 65 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:48,027 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2022-02-20 14:29:48,027 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 30 [2022-02-20 14:29:48,027 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:48,027 INFO L470 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2022-02-20 14:29:48,027 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:48,028 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2022-02-20 14:29:48,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:48,029 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:48,029 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:48,049 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 14:29:48,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:48,236 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:48,236 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:48,236 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-02-20 14:29:48,236 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:48,236 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [748073907] [2022-02-20 14:29:48,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:48,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:48,287 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:48,297 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1813769127] [2022-02-20 14:29:48,298 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:48,298 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:48,298 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:48,299 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 14:29:48,300 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 14:29:48,410 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:29:48,410 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:48,411 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:29:48,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:48,422 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:48,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {2452#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {2452#true} is VALID [2022-02-20 14:29:48,811 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2452#true} is VALID [2022-02-20 14:29:48,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2452#true} is VALID [2022-02-20 14:29:48,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {2452#true} assume !(0 == assume_abort_if_not_~cond#1); {2452#true} is VALID [2022-02-20 14:29:48,811 INFO L290 TraceCheckUtils]: 4: Hoare triple {2452#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:48,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:48,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:48,812 INFO L290 TraceCheckUtils]: 7: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2479#(= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:48,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {2483#(and (= |ULTIMATE.start_main_~i~0#1| 1) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:48,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {2483#(and (= |ULTIMATE.start_main_~i~0#1| 1) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {2483#(and (= |ULTIMATE.start_main_~i~0#1| 1) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:48,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {2483#(and (= |ULTIMATE.start_main_~i~0#1| 1) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2490#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~N~0))} is VALID [2022-02-20 14:29:48,815 INFO L290 TraceCheckUtils]: 11: Hoare triple {2490#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~N~0))} assume !(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,816 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_~i~0#1 := 0; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,816 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,817 INFO L290 TraceCheckUtils]: 15: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,818 INFO L290 TraceCheckUtils]: 16: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,818 INFO L290 TraceCheckUtils]: 17: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,819 INFO L290 TraceCheckUtils]: 18: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,819 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,820 INFO L290 TraceCheckUtils]: 20: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2522#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,821 INFO L290 TraceCheckUtils]: 21: Hoare triple {2522#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2526#(and (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {2526#(and (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2530#(and (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,828 INFO L290 TraceCheckUtils]: 23: Hoare triple {2530#(and (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2530#(and (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {2530#(and (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2537#(and (< |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:48,830 INFO L290 TraceCheckUtils]: 25: Hoare triple {2537#(and (< |ULTIMATE.start_main_~i~0#1| 2) (< 1 ~N~0) (<= ~N~0 2))} assume !(main_~i~0#1 < ~N~0); {2453#false} is VALID [2022-02-20 14:29:48,830 INFO L290 TraceCheckUtils]: 26: Hoare triple {2453#false} main_~i~0#1 := 0; {2453#false} is VALID [2022-02-20 14:29:48,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {2453#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2453#false} is VALID [2022-02-20 14:29:48,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {2453#false} assume 0 == __VERIFIER_assert_~cond#1; {2453#false} is VALID [2022-02-20 14:29:48,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-02-20 14:29:48,831 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 13 proven. 7 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:48,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:49,236 INFO L290 TraceCheckUtils]: 29: Hoare triple {2453#false} assume !false; {2453#false} is VALID [2022-02-20 14:29:49,236 INFO L290 TraceCheckUtils]: 28: Hoare triple {2453#false} assume 0 == __VERIFIER_assert_~cond#1; {2453#false} is VALID [2022-02-20 14:29:49,236 INFO L290 TraceCheckUtils]: 27: Hoare triple {2453#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2453#false} is VALID [2022-02-20 14:29:49,236 INFO L290 TraceCheckUtils]: 26: Hoare triple {2453#false} main_~i~0#1 := 0; {2453#false} is VALID [2022-02-20 14:29:49,237 INFO L290 TraceCheckUtils]: 25: Hoare triple {2565#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {2453#false} is VALID [2022-02-20 14:29:49,238 INFO L290 TraceCheckUtils]: 24: Hoare triple {2569#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2565#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:29:49,238 INFO L290 TraceCheckUtils]: 23: Hoare triple {2569#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2569#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:49,239 INFO L290 TraceCheckUtils]: 22: Hoare triple {2576#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} assume !!(main_~i~0#1 < ~N~0); {2569#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:49,239 INFO L290 TraceCheckUtils]: 21: Hoare triple {2580#(or (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2576#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} is VALID [2022-02-20 14:29:49,240 INFO L290 TraceCheckUtils]: 20: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2580#(or (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} is VALID [2022-02-20 14:29:49,241 INFO L290 TraceCheckUtils]: 19: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,241 INFO L290 TraceCheckUtils]: 18: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,242 INFO L290 TraceCheckUtils]: 17: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,243 INFO L290 TraceCheckUtils]: 16: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,243 INFO L290 TraceCheckUtils]: 15: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,244 INFO L290 TraceCheckUtils]: 14: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,244 INFO L290 TraceCheckUtils]: 13: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,245 INFO L290 TraceCheckUtils]: 12: Hoare triple {2494#(and (< 1 ~N~0) (<= ~N~0 2))} main_~i~0#1 := 0; {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {2611#(or (< |ULTIMATE.start_main_~i~0#1| ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} assume !(main_~i~0#1 < ~N~0); {2494#(and (< 1 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:49,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {2615#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2611#(or (< |ULTIMATE.start_main_~i~0#1| ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} is VALID [2022-02-20 14:29:49,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {2615#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {2615#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} is VALID [2022-02-20 14:29:49,248 INFO L290 TraceCheckUtils]: 8: Hoare triple {2479#(= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {2615#(or (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (and (< 1 ~N~0) (<= ~N~0 2)))} is VALID [2022-02-20 14:29:49,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2479#(= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:49,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:49,249 INFO L290 TraceCheckUtils]: 5: Hoare triple {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:49,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {2452#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {2469#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:49,250 INFO L290 TraceCheckUtils]: 3: Hoare triple {2452#true} assume !(0 == assume_abort_if_not_~cond#1); {2452#true} is VALID [2022-02-20 14:29:49,250 INFO L290 TraceCheckUtils]: 2: Hoare triple {2452#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {2452#true} is VALID [2022-02-20 14:29:49,250 INFO L290 TraceCheckUtils]: 1: Hoare triple {2452#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {2452#true} is VALID [2022-02-20 14:29:49,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {2452#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {2452#true} is VALID [2022-02-20 14:29:49,251 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:49,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:49,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [748073907] [2022-02-20 14:29:49,251 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:49,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1813769127] [2022-02-20 14:29:49,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1813769127] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:49,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:49,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 17 [2022-02-20 14:29:49,252 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [436804872] [2022-02-20 14:29:49,252 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:49,253 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:49,253 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:49,253 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:49,288 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:49,289 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:29:49,289 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:49,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:29:49,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=205, Unknown=0, NotChecked=0, Total=272 [2022-02-20 14:29:49,290 INFO L87 Difference]: Start difference. First operand 66 states and 75 transitions. Second operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:50,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:50,190 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2022-02-20 14:29:50,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 14:29:50,190 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:50,191 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:50,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:50,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-02-20 14:29:50,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:50,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 110 transitions. [2022-02-20 14:29:50,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 110 transitions. [2022-02-20 14:29:50,291 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 14:29:50,293 INFO L225 Difference]: With dead ends: 133 [2022-02-20 14:29:50,293 INFO L226 Difference]: Without dead ends: 113 [2022-02-20 14:29:50,294 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 40 SyntacticMatches, 3 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 127 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=152, Invalid=448, Unknown=0, NotChecked=0, Total=600 [2022-02-20 14:29:50,294 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 162 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 293 mSolverCounterSat, 69 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 132 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 69 IncrementalHoareTripleChecker+Valid, 293 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:50,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 132 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [69 Valid, 293 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:29:50,296 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2022-02-20 14:29:50,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 63. [2022-02-20 14:29:50,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:50,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 113 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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 14:29:50,352 INFO L74 IsIncluded]: Start isIncluded. First operand 113 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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 14:29:50,353 INFO L87 Difference]: Start difference. First operand 113 states. Second operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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 14:29:50,355 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:50,356 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 14:29:50,356 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 14:29:50,356 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:50,356 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:50,356 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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) Second operand 113 states. [2022-02-20 14:29:50,357 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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) Second operand 113 states. [2022-02-20 14:29:50,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:50,359 INFO L93 Difference]: Finished difference Result 113 states and 120 transitions. [2022-02-20 14:29:50,359 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 120 transitions. [2022-02-20 14:29:50,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:50,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:50,360 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:50,360 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:50,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1290322580645162) internal successors, (70), 62 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 14:29:50,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 70 transitions. [2022-02-20 14:29:50,362 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 70 transitions. Word has length 30 [2022-02-20 14:29:50,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:50,362 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 70 transitions. [2022-02-20 14:29:50,362 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.176470588235294) internal successors, (37), 17 states have internal predecessors, (37), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:50,362 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 14:29:50,363 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 14:29:50,363 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:50,363 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:50,385 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 14:29:50,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:50,580 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:50,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:50,580 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 2 times [2022-02-20 14:29:50,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:50,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1684162408] [2022-02-20 14:29:50,580 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:50,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:50,622 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:50,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [448695653] [2022-02-20 14:29:50,623 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:50,623 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:50,623 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:50,624 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 14:29:50,658 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 14:29:50,705 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:50,705 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:50,706 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:29:50,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:50,718 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:50,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {3136#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3136#true} is VALID [2022-02-20 14:29:50,928 INFO L290 TraceCheckUtils]: 1: Hoare triple {3136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3136#true} is VALID [2022-02-20 14:29:50,928 INFO L290 TraceCheckUtils]: 2: Hoare triple {3136#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3136#true} is VALID [2022-02-20 14:29:50,928 INFO L290 TraceCheckUtils]: 3: Hoare triple {3136#true} assume !(0 == assume_abort_if_not_~cond#1); {3136#true} is VALID [2022-02-20 14:29:50,935 INFO L290 TraceCheckUtils]: 4: Hoare triple {3136#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:50,936 INFO L290 TraceCheckUtils]: 5: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:50,936 INFO L290 TraceCheckUtils]: 6: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:50,937 INFO L290 TraceCheckUtils]: 7: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:50,937 INFO L290 TraceCheckUtils]: 8: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:50,937 INFO L290 TraceCheckUtils]: 9: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:50,938 INFO L290 TraceCheckUtils]: 10: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3173#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:50,938 INFO L290 TraceCheckUtils]: 11: Hoare triple {3173#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,939 INFO L290 TraceCheckUtils]: 12: Hoare triple {3177#(<= ~N~0 2)} main_~i~0#1 := 0; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,939 INFO L290 TraceCheckUtils]: 13: Hoare triple {3177#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,939 INFO L290 TraceCheckUtils]: 14: Hoare triple {3177#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,939 INFO L290 TraceCheckUtils]: 15: Hoare triple {3177#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {3177#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,940 INFO L290 TraceCheckUtils]: 17: Hoare triple {3177#(<= ~N~0 2)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,940 INFO L290 TraceCheckUtils]: 18: Hoare triple {3177#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,941 INFO L290 TraceCheckUtils]: 19: Hoare triple {3177#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:50,941 INFO L290 TraceCheckUtils]: 20: Hoare triple {3177#(<= ~N~0 2)} main_~i~0#1 := 0; {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,942 INFO L290 TraceCheckUtils]: 21: Hoare triple {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,942 INFO L290 TraceCheckUtils]: 22: Hoare triple {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,943 INFO L290 TraceCheckUtils]: 23: Hoare triple {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,943 INFO L290 TraceCheckUtils]: 24: Hoare triple {3205#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,944 INFO L290 TraceCheckUtils]: 25: Hoare triple {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,944 INFO L290 TraceCheckUtils]: 26: Hoare triple {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,945 INFO L290 TraceCheckUtils]: 27: Hoare triple {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,945 INFO L290 TraceCheckUtils]: 28: Hoare triple {3218#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3231#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:50,946 INFO L290 TraceCheckUtils]: 29: Hoare triple {3231#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3137#false} is VALID [2022-02-20 14:29:50,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {3137#false} assume 0 == __VERIFIER_assert_~cond#1; {3137#false} is VALID [2022-02-20 14:29:50,946 INFO L290 TraceCheckUtils]: 31: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2022-02-20 14:29:50,946 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:50,947 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:51,131 INFO L290 TraceCheckUtils]: 31: Hoare triple {3137#false} assume !false; {3137#false} is VALID [2022-02-20 14:29:51,132 INFO L290 TraceCheckUtils]: 30: Hoare triple {3137#false} assume 0 == __VERIFIER_assert_~cond#1; {3137#false} is VALID [2022-02-20 14:29:51,132 INFO L290 TraceCheckUtils]: 29: Hoare triple {3247#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3137#false} is VALID [2022-02-20 14:29:51,133 INFO L290 TraceCheckUtils]: 28: Hoare triple {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3247#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:51,133 INFO L290 TraceCheckUtils]: 27: Hoare triple {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:51,133 INFO L290 TraceCheckUtils]: 26: Hoare triple {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:51,134 INFO L290 TraceCheckUtils]: 25: Hoare triple {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:51,134 INFO L290 TraceCheckUtils]: 24: Hoare triple {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {3251#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:51,134 INFO L290 TraceCheckUtils]: 23: Hoare triple {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:51,135 INFO L290 TraceCheckUtils]: 22: Hoare triple {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:51,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:51,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {3177#(<= ~N~0 2)} main_~i~0#1 := 0; {3264#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:51,136 INFO L290 TraceCheckUtils]: 19: Hoare triple {3177#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {3177#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,136 INFO L290 TraceCheckUtils]: 17: Hoare triple {3177#(<= ~N~0 2)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {3177#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {3177#(<= ~N~0 2)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {3177#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {3177#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,138 INFO L290 TraceCheckUtils]: 12: Hoare triple {3177#(<= ~N~0 2)} main_~i~0#1 := 0; {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,138 INFO L290 TraceCheckUtils]: 11: Hoare triple {3173#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3177#(<= ~N~0 2)} is VALID [2022-02-20 14:29:51,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3173#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:51,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:51,139 INFO L290 TraceCheckUtils]: 8: Hoare triple {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:51,147 INFO L290 TraceCheckUtils]: 7: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3163#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:51,147 INFO L290 TraceCheckUtils]: 6: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:51,148 INFO L290 TraceCheckUtils]: 5: Hoare triple {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:51,153 INFO L290 TraceCheckUtils]: 4: Hoare triple {3136#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3153#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:51,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {3136#true} assume !(0 == assume_abort_if_not_~cond#1); {3136#true} is VALID [2022-02-20 14:29:51,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {3136#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3136#true} is VALID [2022-02-20 14:29:51,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {3136#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3136#true} is VALID [2022-02-20 14:29:51,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {3136#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3136#true} is VALID [2022-02-20 14:29:51,154 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:29:51,154 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:51,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1684162408] [2022-02-20 14:29:51,155 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:51,155 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [448695653] [2022-02-20 14:29:51,155 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [448695653] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:51,155 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:51,155 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:29:51,155 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2133232250] [2022-02-20 14:29:51,156 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:51,157 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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 14:29:51,157 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:51,157 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,188 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:51,189 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:29:51,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:51,189 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:29:51,189 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:51,189 INFO L87 Difference]: Start difference. First operand 63 states and 70 transitions. Second operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,658 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:51,658 INFO L93 Difference]: Finished difference Result 102 states and 109 transitions. [2022-02-20 14:29:51,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:29:51,658 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have 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 14:29:51,658 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:51,658 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-02-20 14:29:51,659 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 86 transitions. [2022-02-20 14:29:51,660 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 86 transitions. [2022-02-20 14:29:51,738 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:51,739 INFO L225 Difference]: With dead ends: 102 [2022-02-20 14:29:51,739 INFO L226 Difference]: Without dead ends: 77 [2022-02-20 14:29:51,739 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:29:51,740 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 69 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 35 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 175 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 35 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:51,740 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [69 Valid, 72 Invalid, 175 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [35 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:51,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2022-02-20 14:29:51,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 57. [2022-02-20 14:29:51,798 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:51,800 INFO L82 GeneralOperation]: Start isEquivalent. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,800 INFO L74 IsIncluded]: Start isIncluded. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,801 INFO L87 Difference]: Start difference. First operand 77 states. Second operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,808 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:51,808 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 14:29:51,808 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 14:29:51,809 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:51,809 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:51,809 INFO L74 IsIncluded]: Start isIncluded. First operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 14:29:51,809 INFO L87 Difference]: Start difference. First operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 77 states. [2022-02-20 14:29:51,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:51,811 INFO L93 Difference]: Finished difference Result 77 states and 81 transitions. [2022-02-20 14:29:51,811 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2022-02-20 14:29:51,811 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:51,811 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:51,812 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:51,812 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:51,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 56 states have (on average 1.1071428571428572) internal successors, (62), 56 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 62 transitions. [2022-02-20 14:29:51,813 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 62 transitions. Word has length 32 [2022-02-20 14:29:51,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:51,813 INFO L470 AbstractCegarLoop]: Abstraction has 57 states and 62 transitions. [2022-02-20 14:29:51,813 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.3333333333333335) internal successors, (40), 12 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:51,813 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 62 transitions. [2022-02-20 14:29:51,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:29:51,814 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:51,814 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:51,840 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 14:29:52,037 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:52,038 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:52,038 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:52,038 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-02-20 14:29:52,038 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:52,038 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [652029770] [2022-02-20 14:29:52,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:52,038 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:52,085 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:52,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1777812910] [2022-02-20 14:29:52,085 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:29:52,086 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:52,086 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:52,095 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 14:29:52,121 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 14:29:52,157 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:29:52,157 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:52,158 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:29:52,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:52,169 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:52,426 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3701#true} is VALID [2022-02-20 14:29:52,426 INFO L290 TraceCheckUtils]: 1: Hoare triple {3701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3701#true} is VALID [2022-02-20 14:29:52,426 INFO L290 TraceCheckUtils]: 2: Hoare triple {3701#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3701#true} is VALID [2022-02-20 14:29:52,426 INFO L290 TraceCheckUtils]: 3: Hoare triple {3701#true} assume !(0 == assume_abort_if_not_~cond#1); {3701#true} is VALID [2022-02-20 14:29:52,426 INFO L290 TraceCheckUtils]: 4: Hoare triple {3701#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,427 INFO L290 TraceCheckUtils]: 5: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,427 INFO L290 TraceCheckUtils]: 6: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,428 INFO L290 TraceCheckUtils]: 7: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,428 INFO L290 TraceCheckUtils]: 8: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,429 INFO L290 TraceCheckUtils]: 11: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,429 INFO L290 TraceCheckUtils]: 12: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,430 INFO L290 TraceCheckUtils]: 13: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3748#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:52,430 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3752#(<= ~N~0 3)} is VALID [2022-02-20 14:29:52,431 INFO L290 TraceCheckUtils]: 15: Hoare triple {3752#(<= ~N~0 3)} main_~i~0#1 := 0; {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,431 INFO L290 TraceCheckUtils]: 16: Hoare triple {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,431 INFO L290 TraceCheckUtils]: 17: Hoare triple {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,432 INFO L290 TraceCheckUtils]: 18: Hoare triple {3756#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,432 INFO L290 TraceCheckUtils]: 19: Hoare triple {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,433 INFO L290 TraceCheckUtils]: 20: Hoare triple {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,433 INFO L290 TraceCheckUtils]: 21: Hoare triple {3766#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,434 INFO L290 TraceCheckUtils]: 22: Hoare triple {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,434 INFO L290 TraceCheckUtils]: 23: Hoare triple {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,435 INFO L290 TraceCheckUtils]: 24: Hoare triple {3776#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3786#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:52,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {3786#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3702#false} is VALID [2022-02-20 14:29:52,436 INFO L290 TraceCheckUtils]: 26: Hoare triple {3702#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3702#false} is VALID [2022-02-20 14:29:52,436 INFO L290 TraceCheckUtils]: 27: Hoare triple {3702#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3702#false} is VALID [2022-02-20 14:29:52,436 INFO L290 TraceCheckUtils]: 28: Hoare triple {3702#false} assume !(main_~i~0#1 < ~N~0); {3702#false} is VALID [2022-02-20 14:29:52,436 INFO L290 TraceCheckUtils]: 29: Hoare triple {3702#false} main_~i~0#1 := 0; {3702#false} is VALID [2022-02-20 14:29:52,437 INFO L290 TraceCheckUtils]: 30: Hoare triple {3702#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3702#false} is VALID [2022-02-20 14:29:52,437 INFO L290 TraceCheckUtils]: 31: Hoare triple {3702#false} assume 0 == __VERIFIER_assert_~cond#1; {3702#false} is VALID [2022-02-20 14:29:52,437 INFO L290 TraceCheckUtils]: 32: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 14:29:52,437 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:52,437 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:52,636 INFO L290 TraceCheckUtils]: 32: Hoare triple {3702#false} assume !false; {3702#false} is VALID [2022-02-20 14:29:52,636 INFO L290 TraceCheckUtils]: 31: Hoare triple {3702#false} assume 0 == __VERIFIER_assert_~cond#1; {3702#false} is VALID [2022-02-20 14:29:52,636 INFO L290 TraceCheckUtils]: 30: Hoare triple {3702#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3702#false} is VALID [2022-02-20 14:29:52,636 INFO L290 TraceCheckUtils]: 29: Hoare triple {3702#false} main_~i~0#1 := 0; {3702#false} is VALID [2022-02-20 14:29:52,636 INFO L290 TraceCheckUtils]: 28: Hoare triple {3702#false} assume !(main_~i~0#1 < ~N~0); {3702#false} is VALID [2022-02-20 14:29:52,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {3702#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3702#false} is VALID [2022-02-20 14:29:52,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {3702#false} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3702#false} is VALID [2022-02-20 14:29:52,638 INFO L290 TraceCheckUtils]: 25: Hoare triple {3832#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0); {3702#false} is VALID [2022-02-20 14:29:52,639 INFO L290 TraceCheckUtils]: 24: Hoare triple {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3832#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:52,640 INFO L290 TraceCheckUtils]: 23: Hoare triple {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:52,640 INFO L290 TraceCheckUtils]: 22: Hoare triple {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:52,641 INFO L290 TraceCheckUtils]: 21: Hoare triple {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3836#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:52,642 INFO L290 TraceCheckUtils]: 20: Hoare triple {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,642 INFO L290 TraceCheckUtils]: 19: Hoare triple {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,642 INFO L290 TraceCheckUtils]: 18: Hoare triple {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3846#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,643 INFO L290 TraceCheckUtils]: 17: Hoare triple {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,643 INFO L290 TraceCheckUtils]: 16: Hoare triple {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,643 INFO L290 TraceCheckUtils]: 15: Hoare triple {3752#(<= ~N~0 3)} main_~i~0#1 := 0; {3856#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:52,644 INFO L290 TraceCheckUtils]: 14: Hoare triple {3748#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3752#(<= ~N~0 3)} is VALID [2022-02-20 14:29:52,644 INFO L290 TraceCheckUtils]: 13: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3748#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:52,644 INFO L290 TraceCheckUtils]: 12: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,645 INFO L290 TraceCheckUtils]: 11: Hoare triple {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3738#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:52,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {3728#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:52,646 INFO L290 TraceCheckUtils]: 6: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {3701#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {3718#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {3701#true} assume !(0 == assume_abort_if_not_~cond#1); {3701#true} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {3701#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {3701#true} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 1: Hoare triple {3701#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {3701#true} is VALID [2022-02-20 14:29:52,647 INFO L290 TraceCheckUtils]: 0: Hoare triple {3701#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {3701#true} is VALID [2022-02-20 14:29:52,648 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 22 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:52,648 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:52,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [652029770] [2022-02-20 14:29:52,648 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:52,648 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1777812910] [2022-02-20 14:29:52,648 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1777812910] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:52,648 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:52,648 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-02-20 14:29:52,648 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1506801526] [2022-02-20 14:29:52,648 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:52,649 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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 14:29:52,649 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:52,649 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:52,696 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 44 edges. 44 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:52,696 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:29:52,697 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:52,697 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:29:52,697 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:29:52,697 INFO L87 Difference]: Start difference. First operand 57 states and 62 transitions. Second operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,437 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 14:29:53,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:29:53,437 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have 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 14:29:53,437 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:53,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 14:29:53,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 122 transitions. [2022-02-20 14:29:53,440 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 122 transitions. [2022-02-20 14:29:53,551 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 14:29:53,553 INFO L225 Difference]: With dead ends: 116 [2022-02-20 14:29:53,553 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 14:29:53,553 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-02-20 14:29:53,554 INFO L933 BasicCegarLoop]: 24 mSDtfsCounter, 109 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 190 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 243 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 190 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:53,554 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [109 Valid, 108 Invalid, 243 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 190 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:29:53,555 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 14:29:53,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 64. [2022-02-20 14:29:53,624 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:53,624 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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 14:29:53,624 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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 14:29:53,624 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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 14:29:53,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,626 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-02-20 14:29:53,626 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-02-20 14:29:53,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,627 INFO L74 IsIncluded]: Start isIncluded. First operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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) Second operand 103 states. [2022-02-20 14:29:53,627 INFO L87 Difference]: Start difference. First operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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) Second operand 103 states. [2022-02-20 14:29:53,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:53,629 INFO L93 Difference]: Finished difference Result 103 states and 106 transitions. [2022-02-20 14:29:53,629 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 106 transitions. [2022-02-20 14:29:53,629 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:53,629 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:53,629 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:53,629 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:53,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 63 states have (on average 1.1111111111111112) internal successors, (70), 63 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 14:29:53,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 70 transitions. [2022-02-20 14:29:53,630 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 70 transitions. Word has length 33 [2022-02-20 14:29:53,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:53,631 INFO L470 AbstractCegarLoop]: Abstraction has 64 states and 70 transitions. [2022-02-20 14:29:53,631 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.933333333333333) internal successors, (44), 15 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:53,631 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 70 transitions. [2022-02-20 14:29:53,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:29:53,632 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:53,632 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:53,659 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 14:29:53,838 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,SelfDestructingSolverStorable9 [2022-02-20 14:29:53,838 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:53,838 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:53,838 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 3 times [2022-02-20 14:29:53,839 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:53,839 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1939932900] [2022-02-20 14:29:53,839 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:53,839 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:53,872 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:53,887 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [79993975] [2022-02-20 14:29:53,887 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:53,887 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:53,892 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 14:29:53,893 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 14:29:54,135 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:29:54,135 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:54,137 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 61 conjunts are in the unsatisfiable core [2022-02-20 14:29:54,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:54,160 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:54,241 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:29:54,321 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:29:54,490 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 57 treesize of output 50 [2022-02-20 14:29:54,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-02-20 14:29:54,546 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,550 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 24 [2022-02-20 14:29:54,707 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 57 treesize of output 50 [2022-02-20 14:29:54,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 100 [2022-02-20 14:29:54,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:54,747 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 17 [2022-02-20 14:29:54,993 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 14:29:55,214 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 14:29:55,214 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 139 treesize of output 127 [2022-02-20 14:29:55,226 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:29:55,227 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,229 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,233 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 120 treesize of output 194 [2022-02-20 14:29:55,331 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,332 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,333 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,334 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 115 treesize of output 47 [2022-02-20 14:29:55,688 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 14:29:55,689 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 99 treesize of output 91 [2022-02-20 14:29:55,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,710 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:55,715 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 157 [2022-02-20 14:29:56,471 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:29:56,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 52 treesize of output 32 [2022-02-20 14:29:56,520 INFO L290 TraceCheckUtils]: 0: Hoare triple {4358#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {4358#true} is VALID [2022-02-20 14:29:56,520 INFO L290 TraceCheckUtils]: 1: Hoare triple {4358#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4366#(<= ~N~0 2147483647)} is VALID [2022-02-20 14:29:56,521 INFO L290 TraceCheckUtils]: 2: Hoare triple {4366#(<= ~N~0 2147483647)} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4370#(and (<= ~N~0 2147483647) (or (and (not (<= (mod ~N~0 4294967296) 536870911)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= (mod ~N~0 4294967296) 536870911))))} is VALID [2022-02-20 14:29:56,521 INFO L290 TraceCheckUtils]: 3: Hoare triple {4370#(and (<= ~N~0 2147483647) (or (and (not (<= (mod ~N~0 4294967296) 536870911)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (<= (mod ~N~0 4294967296) 536870911))))} assume !(0 == assume_abort_if_not_~cond#1); {4374#(and (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911))} is VALID [2022-02-20 14:29:56,522 INFO L290 TraceCheckUtils]: 4: Hoare triple {4374#(and (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911))} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {4378#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,522 INFO L290 TraceCheckUtils]: 5: Hoare triple {4378#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {4378#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,523 INFO L290 TraceCheckUtils]: 6: Hoare triple {4378#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {4385#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,524 INFO L290 TraceCheckUtils]: 7: Hoare triple {4385#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,524 INFO L290 TraceCheckUtils]: 8: Hoare triple {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,525 INFO L290 TraceCheckUtils]: 9: Hoare triple {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:56,525 INFO L290 TraceCheckUtils]: 10: Hoare triple {4389#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4399#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:29:56,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {4399#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} assume !!(main_~i~0#1 < ~N~0); {4403#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:29:56,527 INFO L290 TraceCheckUtils]: 12: Hoare triple {4403#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {4403#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} is VALID [2022-02-20 14:29:56,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {4403#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (+ (- 2) |ULTIMATE.start_main_~i~0#1|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4410#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= 3 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,528 INFO L290 TraceCheckUtils]: 14: Hoare triple {4410#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= ~N~0 2147483647) (= 3 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (<= (mod ~N~0 4294967296) 536870911) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (< 2 ~N~0))} assume !(main_~i~0#1 < ~N~0); {4414#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,528 INFO L290 TraceCheckUtils]: 15: Hoare triple {4414#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} main_~i~0#1 := 0; {4418#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,529 INFO L290 TraceCheckUtils]: 16: Hoare triple {4418#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {4418#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,529 INFO L290 TraceCheckUtils]: 17: Hoare triple {4418#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 3) (< 2 ~N~0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {4425#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,530 INFO L290 TraceCheckUtils]: 18: Hoare triple {4425#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4429#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,530 INFO L290 TraceCheckUtils]: 19: Hoare triple {4429#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {4429#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,531 INFO L290 TraceCheckUtils]: 20: Hoare triple {4429#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~i~0#1| 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4436#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (< 2 ~N~0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))))} is VALID [2022-02-20 14:29:56,532 INFO L290 TraceCheckUtils]: 21: Hoare triple {4436#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (< 2 ~N~0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,535 INFO L290 TraceCheckUtils]: 23: Hoare triple {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,535 INFO L290 TraceCheckUtils]: 24: Hoare triple {4440#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (+ 1 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (<= ~N~0 3) (< 2 ~N~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4450#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,536 INFO L290 TraceCheckUtils]: 25: Hoare triple {4450#(and (<= |ULTIMATE.start_main_~i~0#1| 3) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume !(main_~i~0#1 < ~N~0); {4454#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,537 INFO L290 TraceCheckUtils]: 26: Hoare triple {4454#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} main_~i~0#1 := 0; {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,537 INFO L290 TraceCheckUtils]: 27: Hoare triple {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,538 INFO L290 TraceCheckUtils]: 28: Hoare triple {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume !(0 == __VERIFIER_assert_~cond#1); {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,539 INFO L290 TraceCheckUtils]: 29: Hoare triple {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} is VALID [2022-02-20 14:29:56,539 INFO L290 TraceCheckUtils]: 30: Hoare triple {4458#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (< 2 ~N~0))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4436#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (< 2 ~N~0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))))} is VALID [2022-02-20 14:29:56,540 INFO L290 TraceCheckUtils]: 31: Hoare triple {4436#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (<= ~N~0 3) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1) (< 2 ~N~0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) 1)) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4474#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:56,541 INFO L290 TraceCheckUtils]: 32: Hoare triple {4474#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {4359#false} is VALID [2022-02-20 14:29:56,541 INFO L290 TraceCheckUtils]: 33: Hoare triple {4359#false} assume !false; {4359#false} is VALID [2022-02-20 14:29:56,541 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:29:56,541 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:59,684 INFO L356 Elim1Store]: treesize reduction 33, result has 43.1 percent of original size [2022-02-20 14:29:59,685 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 490 treesize of output 362 [2022-02-20 14:29:59,704 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:29:59,704 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 370 treesize of output 352 [2022-02-20 14:29:59,731 INFO L356 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2022-02-20 14:29:59,731 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 316 treesize of output 294 [2022-02-20 14:29:59,929 INFO L290 TraceCheckUtils]: 33: Hoare triple {4359#false} assume !false; {4359#false} is VALID [2022-02-20 14:29:59,930 INFO L290 TraceCheckUtils]: 32: Hoare triple {4474#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {4359#false} is VALID [2022-02-20 14:29:59,933 INFO L290 TraceCheckUtils]: 31: Hoare triple {4487#(or (and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368)))))) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4474#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:59,946 INFO L290 TraceCheckUtils]: 30: Hoare triple {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {4487#(or (and (or (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 5 |ULTIMATE.start_main_~i~0#1|)) (* 5 |ULTIMATE.start_main_~i~0#1|) 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8) (- 34359738368)))))) (<= ~N~0 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:59,948 INFO L290 TraceCheckUtils]: 29: Hoare triple {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:29:59,949 INFO L290 TraceCheckUtils]: 28: Hoare triple {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(0 == __VERIFIER_assert_~cond#1); {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:29:59,950 INFO L290 TraceCheckUtils]: 27: Hoare triple {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:29:59,950 INFO L290 TraceCheckUtils]: 26: Hoare triple {4504#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1))} main_~i~0#1 := 0; {4491#(or (and (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) (- 34359738368))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8))) (+ (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ 5 (* 5 |ULTIMATE.start_main_~i~0#1|))) 6 (* 5 |ULTIMATE.start_main_~i~0#1|))) (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))) (<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:29:59,951 INFO L290 TraceCheckUtils]: 25: Hoare triple {4508#(or (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1))} assume !(main_~i~0#1 < ~N~0); {4504#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1))} is VALID [2022-02-20 14:29:59,952 INFO L290 TraceCheckUtils]: 24: Hoare triple {4512#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4508#(or (< |ULTIMATE.start_main_~i~0#1| ~N~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1))} is VALID [2022-02-20 14:29:59,957 INFO L290 TraceCheckUtils]: 23: Hoare triple {4516#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4512#(or (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:59,958 INFO L290 TraceCheckUtils]: 22: Hoare triple {4520#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} assume !!(main_~i~0#1 < ~N~0); {4516#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:59,961 INFO L290 TraceCheckUtils]: 21: Hoare triple {4524#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4520#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (<= ~N~0 1) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} is VALID [2022-02-20 14:29:59,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {4528#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {4524#(or (forall ((v_ArrVal_296 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} is VALID [2022-02-20 14:29:59,968 INFO L290 TraceCheckUtils]: 19: Hoare triple {4528#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} assume !!(main_~i~0#1 < ~N~0); {4528#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} is VALID [2022-02-20 14:29:59,980 INFO L290 TraceCheckUtils]: 18: Hoare triple {4535#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4528#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (<= ~N~0 1) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)))} is VALID [2022-02-20 14:29:59,981 INFO L290 TraceCheckUtils]: 17: Hoare triple {4539#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (forall ((v_ArrVal_296 Int)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {4535#(or (forall ((v_ArrVal_296 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:59,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {4539#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (forall ((v_ArrVal_296 Int)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {4539#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (forall ((v_ArrVal_296 Int)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:59,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {4546#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< 3 ~N~0) (<= ~N~0 2))} main_~i~0#1 := 0; {4539#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (<= ~N~0 1) (forall ((v_ArrVal_296 Int)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8))))) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:59,984 INFO L290 TraceCheckUtils]: 14: Hoare triple {4550#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (< 3 ~N~0) (<= ~N~0 2))} assume !(main_~i~0#1 < ~N~0); {4546#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< 3 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:59,984 INFO L290 TraceCheckUtils]: 13: Hoare triple {4554#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< 3 ~N~0) (<= ~N~0 2) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4550#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (< 3 ~N~0) (<= ~N~0 2))} is VALID [2022-02-20 14:29:59,989 INFO L290 TraceCheckUtils]: 12: Hoare triple {4558#(or (< 3 ~N~0) (<= ~N~0 2) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {4554#(or (forall ((v_ArrVal_296 Int)) (= 11 (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< 3 ~N~0) (<= ~N~0 2) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:59,990 INFO L290 TraceCheckUtils]: 11: Hoare triple {4562#(or (< 3 ~N~0) (<= ~N~0 2) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} assume !!(main_~i~0#1 < ~N~0); {4558#(or (< 3 ~N~0) (<= ~N~0 2) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:59,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {4566#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4562#(or (< 3 ~N~0) (<= ~N~0 2) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0) (not (< |ULTIMATE.start_main_~i~0#1| ~N~0)))} is VALID [2022-02-20 14:30:00,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {4570#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_287 Int) (v_ArrVal_296 Int) (v_ArrVal_288 (Array Int Int))) (or (not (= v_ArrVal_288 (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_287))) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {4566#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} is VALID [2022-02-20 14:30:00,006 INFO L290 TraceCheckUtils]: 8: Hoare triple {4566#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {4570#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_287 Int) (v_ArrVal_296 Int) (v_ArrVal_288 (Array Int Int))) (or (not (= v_ArrVal_288 (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)) v_ArrVal_287))) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store v_ArrVal_288 (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} is VALID [2022-02-20 14:30:00,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {4577#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {4566#(or (< 3 ~N~0) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= 11 (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))) (not (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)) (<= ~N~0 2))} is VALID [2022-02-20 14:30:00,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {4581#(or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {4577#(or (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0) (forall ((v_ArrVal_289 Int) (v_ArrVal_296 Int)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 2 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) v_ArrVal_289)) |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1)) |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 1)) (+ |ULTIMATE.start_main_~b~0#1.offset| 16) v_ArrVal_296) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 11)))} is VALID [2022-02-20 14:30:00,010 INFO L290 TraceCheckUtils]: 5: Hoare triple {4581#(or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {4581#(or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:30:00,011 INFO L290 TraceCheckUtils]: 4: Hoare triple {4358#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {4581#(or (not (= |ULTIMATE.start_main_~a~0#1.offset| |ULTIMATE.start_main_~b~0#1.offset|)) (not (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)) (< 3 ~N~0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= ~N~0 2) (< (+ 3 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:30:00,011 INFO L290 TraceCheckUtils]: 3: Hoare triple {4358#true} assume !(0 == assume_abort_if_not_~cond#1); {4358#true} is VALID [2022-02-20 14:30:00,011 INFO L290 TraceCheckUtils]: 2: Hoare triple {4358#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {4358#true} is VALID [2022-02-20 14:30:00,011 INFO L290 TraceCheckUtils]: 1: Hoare triple {4358#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {4358#true} is VALID [2022-02-20 14:30:00,011 INFO L290 TraceCheckUtils]: 0: Hoare triple {4358#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {4358#true} is VALID [2022-02-20 14:30:00,012 INFO L134 CoverageAnalysis]: Checked inductivity of 26 backedges. 0 proven. 26 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:30:00,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:30:00,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1939932900] [2022-02-20 14:30:00,012 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:30:00,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [79993975] [2022-02-20 14:30:00,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [79993975] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:30:00,012 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:30:00,013 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 23] total 41 [2022-02-20 14:30:00,013 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2092792084] [2022-02-20 14:30:00,013 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:30:00,014 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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 14:30:00,014 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:30:00,014 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:00,167 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 14:30:00,167 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2022-02-20 14:30:00,167 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:30:00,167 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2022-02-20 14:30:00,168 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=330, Invalid=1309, Unknown=1, NotChecked=0, Total=1640 [2022-02-20 14:30:00,168 INFO L87 Difference]: Start difference. First operand 64 states and 70 transitions. Second operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:01,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:01,400 INFO L93 Difference]: Finished difference Result 97 states and 107 transitions. [2022-02-20 14:30:01,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2022-02-20 14:30:01,400 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have 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 14:30:01,401 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:30:01,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:01,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 81 transitions. [2022-02-20 14:30:01,405 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:01,405 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 81 transitions. [2022-02-20 14:30:01,406 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 40 states and 81 transitions. [2022-02-20 14:30:01,590 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 81 edges. 81 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:30:01,591 INFO L225 Difference]: With dead ends: 97 [2022-02-20 14:30:01,591 INFO L226 Difference]: Without dead ends: 95 [2022-02-20 14:30:01,592 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 24 SyntacticMatches, 5 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 927 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=465, Invalid=1884, Unknown=3, NotChecked=0, Total=2352 [2022-02-20 14:30:01,592 INFO L933 BasicCegarLoop]: 7 mSDtfsCounter, 64 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 128 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 72 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 128 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 219 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:30:01,592 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [64 Valid, 72 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 128 Invalid, 0 Unknown, 219 Unchecked, 0.2s Time] [2022-02-20 14:30:01,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2022-02-20 14:30:01,678 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 86. [2022-02-20 14:30:01,678 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:30:01,679 INFO L82 GeneralOperation]: Start isEquivalent. First operand 95 states. Second operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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 14:30:01,679 INFO L74 IsIncluded]: Start isIncluded. First operand 95 states. Second operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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 14:30:01,679 INFO L87 Difference]: Start difference. First operand 95 states. Second operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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 14:30:01,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:01,680 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-02-20 14:30:01,680 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-02-20 14:30:01,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:30:01,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:30:01,681 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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) Second operand 95 states. [2022-02-20 14:30:01,683 INFO L87 Difference]: Start difference. First operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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) Second operand 95 states. [2022-02-20 14:30:01,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:01,685 INFO L93 Difference]: Finished difference Result 95 states and 105 transitions. [2022-02-20 14:30:01,685 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 105 transitions. [2022-02-20 14:30:01,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:30:01,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:30:01,685 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:30:01,685 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:30:01,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 85 states have (on average 1.1294117647058823) internal successors, (96), 85 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 14:30:01,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 96 transitions. [2022-02-20 14:30:01,687 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 96 transitions. Word has length 34 [2022-02-20 14:30:01,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:30:01,687 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 96 transitions. [2022-02-20 14:30:01,688 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 41 states have (on average 1.5853658536585367) internal successors, (65), 41 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:01,688 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 96 transitions. [2022-02-20 14:30:01,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:30:01,688 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:30:01,688 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:30:01,696 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 14:30:01,895 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:30:01,896 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:30:01,896 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:30:01,896 INFO L85 PathProgramCache]: Analyzing trace with hash -653025448, now seen corresponding path program 4 times [2022-02-20 14:30:01,896 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:30:01,896 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [854723875] [2022-02-20 14:30:01,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:30:01,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:30:01,943 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:30:01,943 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [58183224] [2022-02-20 14:30:01,943 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:30:01,943 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:30:01,943 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:30:01,945 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 14:30:01,972 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 14:30:02,019 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:30:02,020 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:30:02,021 INFO L263 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 9 conjunts are in the unsatisfiable core [2022-02-20 14:30:02,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:30:02,044 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:30:02,255 INFO L290 TraceCheckUtils]: 0: Hoare triple {5045#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {5045#true} is VALID [2022-02-20 14:30:02,255 INFO L290 TraceCheckUtils]: 1: Hoare triple {5045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {5045#true} is VALID [2022-02-20 14:30:02,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {5045#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5045#true} is VALID [2022-02-20 14:30:02,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {5045#true} assume !(0 == assume_abort_if_not_~cond#1); {5045#true} is VALID [2022-02-20 14:30:02,256 INFO L290 TraceCheckUtils]: 4: Hoare triple {5045#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,256 INFO L290 TraceCheckUtils]: 5: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,256 INFO L290 TraceCheckUtils]: 6: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,257 INFO L290 TraceCheckUtils]: 7: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,258 INFO L290 TraceCheckUtils]: 8: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,258 INFO L290 TraceCheckUtils]: 9: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,259 INFO L290 TraceCheckUtils]: 10: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,259 INFO L290 TraceCheckUtils]: 11: Hoare triple {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,259 INFO L290 TraceCheckUtils]: 12: Hoare triple {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,260 INFO L290 TraceCheckUtils]: 13: Hoare triple {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5092#(<= 3 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,260 INFO L290 TraceCheckUtils]: 14: Hoare triple {5092#(<= 3 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5096#(< 3 ~N~0)} is VALID [2022-02-20 14:30:02,260 INFO L290 TraceCheckUtils]: 15: Hoare triple {5096#(< 3 ~N~0)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5096#(< 3 ~N~0)} is VALID [2022-02-20 14:30:02,261 INFO L290 TraceCheckUtils]: 16: Hoare triple {5096#(< 3 ~N~0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5096#(< 3 ~N~0)} is VALID [2022-02-20 14:30:02,261 INFO L290 TraceCheckUtils]: 17: Hoare triple {5096#(< 3 ~N~0)} assume !(main_~i~0#1 < ~N~0); {5096#(< 3 ~N~0)} is VALID [2022-02-20 14:30:02,261 INFO L290 TraceCheckUtils]: 18: Hoare triple {5096#(< 3 ~N~0)} main_~i~0#1 := 0; {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} is VALID [2022-02-20 14:30:02,262 INFO L290 TraceCheckUtils]: 19: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} is VALID [2022-02-20 14:30:02,262 INFO L290 TraceCheckUtils]: 20: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} is VALID [2022-02-20 14:30:02,263 INFO L290 TraceCheckUtils]: 21: Hoare triple {5109#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 3 ~N~0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,263 INFO L290 TraceCheckUtils]: 22: Hoare triple {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,264 INFO L290 TraceCheckUtils]: 23: Hoare triple {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,265 INFO L290 TraceCheckUtils]: 24: Hoare triple {5119#(and (< 3 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5129#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 3 ~N~0))} is VALID [2022-02-20 14:30:02,266 INFO L290 TraceCheckUtils]: 25: Hoare triple {5129#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 3 ~N~0))} assume !(main_~i~0#1 < ~N~0); {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 26: Hoare triple {5046#false} main_~i~0#1 := 0; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 27: Hoare triple {5046#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 28: Hoare triple {5046#false} assume !(0 == __VERIFIER_assert_~cond#1); {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 29: Hoare triple {5046#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 30: Hoare triple {5046#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 31: Hoare triple {5046#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 32: Hoare triple {5046#false} assume 0 == __VERIFIER_assert_~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L290 TraceCheckUtils]: 33: Hoare triple {5046#false} assume !false; {5046#false} is VALID [2022-02-20 14:30:02,267 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:30:02,267 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:30:02,451 INFO L290 TraceCheckUtils]: 33: Hoare triple {5046#false} assume !false; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 32: Hoare triple {5046#false} assume 0 == __VERIFIER_assert_~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 31: Hoare triple {5046#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 30: Hoare triple {5046#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 29: Hoare triple {5046#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 28: Hoare triple {5046#false} assume !(0 == __VERIFIER_assert_~cond#1); {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 27: Hoare triple {5046#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 26: Hoare triple {5046#false} main_~i~0#1 := 0; {5046#false} is VALID [2022-02-20 14:30:02,452 INFO L290 TraceCheckUtils]: 25: Hoare triple {5181#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {5046#false} is VALID [2022-02-20 14:30:02,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5181#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:30:02,454 INFO L290 TraceCheckUtils]: 23: Hoare triple {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:30:02,454 INFO L290 TraceCheckUtils]: 22: Hoare triple {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0); {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:30:02,455 INFO L290 TraceCheckUtils]: 21: Hoare triple {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5185#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:30:02,455 INFO L290 TraceCheckUtils]: 20: Hoare triple {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:30:02,455 INFO L290 TraceCheckUtils]: 19: Hoare triple {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0); {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:30:02,456 INFO L290 TraceCheckUtils]: 18: Hoare triple {5205#(< 2 ~N~0)} main_~i~0#1 := 0; {5195#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:30:02,456 INFO L290 TraceCheckUtils]: 17: Hoare triple {5205#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {5205#(< 2 ~N~0)} is VALID [2022-02-20 14:30:02,456 INFO L290 TraceCheckUtils]: 16: Hoare triple {5205#(< 2 ~N~0)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5205#(< 2 ~N~0)} is VALID [2022-02-20 14:30:02,457 INFO L290 TraceCheckUtils]: 15: Hoare triple {5205#(< 2 ~N~0)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5205#(< 2 ~N~0)} is VALID [2022-02-20 14:30:02,457 INFO L290 TraceCheckUtils]: 14: Hoare triple {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5205#(< 2 ~N~0)} is VALID [2022-02-20 14:30:02,458 INFO L290 TraceCheckUtils]: 13: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5082#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,458 INFO L290 TraceCheckUtils]: 12: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,458 INFO L290 TraceCheckUtils]: 11: Hoare triple {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5072#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,460 INFO L290 TraceCheckUtils]: 8: Hoare triple {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,460 INFO L290 TraceCheckUtils]: 7: Hoare triple {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5062#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:30:02,460 INFO L290 TraceCheckUtils]: 6: Hoare triple {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,461 INFO L290 TraceCheckUtils]: 5: Hoare triple {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,461 INFO L290 TraceCheckUtils]: 4: Hoare triple {5045#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {5239#(<= 0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:30:02,461 INFO L290 TraceCheckUtils]: 3: Hoare triple {5045#true} assume !(0 == assume_abort_if_not_~cond#1); {5045#true} is VALID [2022-02-20 14:30:02,461 INFO L290 TraceCheckUtils]: 2: Hoare triple {5045#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5045#true} is VALID [2022-02-20 14:30:02,461 INFO L290 TraceCheckUtils]: 1: Hoare triple {5045#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {5045#true} is VALID [2022-02-20 14:30:02,462 INFO L290 TraceCheckUtils]: 0: Hoare triple {5045#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {5045#true} is VALID [2022-02-20 14:30:02,462 INFO L134 CoverageAnalysis]: Checked inductivity of 29 backedges. 12 proven. 15 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:30:02,462 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:30:02,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [854723875] [2022-02-20 14:30:02,462 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:30:02,462 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [58183224] [2022-02-20 14:30:02,462 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [58183224] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:30:02,462 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:30:02,462 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 15 [2022-02-20 14:30:02,462 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [772419757] [2022-02-20 14:30:02,462 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:30:02,463 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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 14:30:02,463 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:30:02,463 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:02,505 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 14:30:02,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:30:02,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:30:02,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:30:02,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:30:02,506 INFO L87 Difference]: Start difference. First operand 86 states and 96 transitions. Second operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:03,399 INFO L93 Difference]: Finished difference Result 120 states and 128 transitions. [2022-02-20 14:30:03,399 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 14:30:03,399 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have 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 14:30:03,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:30:03,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-02-20 14:30:03,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 93 transitions. [2022-02-20 14:30:03,402 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 93 transitions. [2022-02-20 14:30:03,497 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:30:03,499 INFO L225 Difference]: With dead ends: 120 [2022-02-20 14:30:03,499 INFO L226 Difference]: Without dead ends: 99 [2022-02-20 14:30:03,499 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 77 GetRequests, 53 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=177, Invalid=473, Unknown=0, NotChecked=0, Total=650 [2022-02-20 14:30:03,499 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 188 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 230 mSolverCounterSat, 59 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 188 SdHoareTripleChecker+Valid, 100 SdHoareTripleChecker+Invalid, 289 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 59 IncrementalHoareTripleChecker+Valid, 230 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 14:30:03,500 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [188 Valid, 100 Invalid, 289 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [59 Valid, 230 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 14:30:03,500 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2022-02-20 14:30:03,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 61. [2022-02-20 14:30:03,570 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:30:03,570 INFO L82 GeneralOperation]: Start isEquivalent. First operand 99 states. Second operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,570 INFO L74 IsIncluded]: Start isIncluded. First operand 99 states. Second operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,570 INFO L87 Difference]: Start difference. First operand 99 states. Second operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,572 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:03,572 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-02-20 14:30:03,572 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-02-20 14:30:03,572 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:30:03,573 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:30:03,573 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 14:30:03,573 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 99 states. [2022-02-20 14:30:03,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:30:03,575 INFO L93 Difference]: Finished difference Result 99 states and 103 transitions. [2022-02-20 14:30:03,575 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 103 transitions. [2022-02-20 14:30:03,575 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:30:03,575 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:30:03,575 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:30:03,575 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:30:03,575 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.0666666666666667) internal successors, (64), 60 states have internal predecessors, (64), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,576 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 64 transitions. [2022-02-20 14:30:03,576 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 64 transitions. Word has length 34 [2022-02-20 14:30:03,577 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:30:03,577 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 64 transitions. [2022-02-20 14:30:03,577 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 3.3333333333333335) internal successors, (50), 15 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:30:03,577 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 64 transitions. [2022-02-20 14:30:03,577 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 14:30:03,577 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:30:03,578 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:30:03,596 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 14:30:03,791 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,SelfDestructingSolverStorable11 [2022-02-20 14:30:03,791 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:30:03,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:30:03,792 INFO L85 PathProgramCache]: Analyzing trace with hash 1259217666, now seen corresponding path program 5 times [2022-02-20 14:30:03,792 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:30:03,792 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [239443364] [2022-02-20 14:30:03,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:30:03,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:30:03,816 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:30:03,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [323551816] [2022-02-20 14:30:03,816 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:30:03,817 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:30:03,817 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:30:03,818 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 14:30:03,825 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 14:30:05,246 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 5 check-sat command(s) [2022-02-20 14:30:05,246 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:30:05,254 INFO L263 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 54 conjunts are in the unsatisfiable core [2022-02-20 14:30:05,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:30:05,287 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:30:05,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 8 [2022-02-20 14:30:05,366 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 14:30:05,488 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 110 treesize of output 99 [2022-02-20 14:30:05,496 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,497 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,498 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,501 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,505 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 172 [2022-02-20 14:30:05,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,538 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 54 [2022-02-20 14:30:05,703 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 125 treesize of output 110 [2022-02-20 14:30:05,710 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:05,711 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,712 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,713 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,714 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,715 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,716 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,717 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,720 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,722 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 187 [2022-02-20 14:30:05,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,745 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,746 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,747 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,748 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,750 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,751 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,760 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 11 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 137 treesize of output 62 [2022-02-20 14:30:05,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,989 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,990 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:05,991 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 7 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 48 [2022-02-20 14:30:06,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,242 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,246 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 4 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 46 [2022-02-20 14:30:06,460 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 14:30:06,460 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 174 treesize of output 154 [2022-02-20 14:30:06,483 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:06,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,485 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,486 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,488 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,491 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 197 [2022-02-20 14:30:06,535 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,536 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,537 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,539 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,540 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 6 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 173 treesize of output 101 [2022-02-20 14:30:06,876 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 14:30:06,876 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 184 treesize of output 158 [2022-02-20 14:30:06,908 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,909 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,912 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:06,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,913 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,914 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,915 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:06,919 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 135 treesize of output 213 [2022-02-20 14:30:07,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,038 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,039 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,041 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,043 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,045 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,051 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 10 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 170 treesize of output 70 [2022-02-20 14:30:07,367 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,368 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,371 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,371 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,372 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,373 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:30:07,377 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:30:07,382 INFO L356 Elim1Store]: treesize reduction 24, result has 4.0 percent of original size [2022-02-20 14:30:07,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 6 select indices, 6 select index equivalence classes, 6 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 94 treesize of output 82 [2022-02-20 14:30:07,878 INFO L290 TraceCheckUtils]: 0: Hoare triple {5712#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(9, 2);call #Ultimate.allocInit(12, 3);~N~0 := 0; {5712#true} is VALID [2022-02-20 14:30:07,879 INFO L290 TraceCheckUtils]: 1: Hoare triple {5712#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~malloc5#1.base, main_#t~malloc5#1.offset, main_#t~malloc6#1.base, main_#t~malloc6#1.offset, main_#t~mem8#1, main_#t~post7#1, main_#t~mem10#1, main_#t~mem11#1, main_#t~post9#1, main_#t~mem13#1, main_#t~post12#1, main_~i~0#1, main_~a~0#1.base, main_~a~0#1.offset, main_~b~0#1.base, main_~b~0#1.offset;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;~N~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1; {5712#true} is VALID [2022-02-20 14:30:07,879 INFO L290 TraceCheckUtils]: 2: Hoare triple {5712#true} assume !(~N~0 <= 0);assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~N~0 % 4294967296 <= 536870911 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {5712#true} is VALID [2022-02-20 14:30:07,879 INFO L290 TraceCheckUtils]: 3: Hoare triple {5712#true} assume !(0 == assume_abort_if_not_~cond#1); {5712#true} is VALID [2022-02-20 14:30:07,879 INFO L290 TraceCheckUtils]: 4: Hoare triple {5712#true} assume { :end_inline_assume_abort_if_not } true;havoc main_~i~0#1;call main_#t~malloc5#1.base, main_#t~malloc5#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~a~0#1.base, main_~a~0#1.offset := main_#t~malloc5#1.base, main_#t~malloc5#1.offset;havoc main_#t~malloc5#1.base, main_#t~malloc5#1.offset;call main_#t~malloc6#1.base, main_#t~malloc6#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~b~0#1.base, main_~b~0#1.offset := main_#t~malloc6#1.base, main_#t~malloc6#1.offset;havoc main_#t~malloc6#1.base, main_#t~malloc6#1.offset;main_~i~0#1 := 0; {5729#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,880 INFO L290 TraceCheckUtils]: 5: Hoare triple {5729#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {5729#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,880 INFO L290 TraceCheckUtils]: 6: Hoare triple {5729#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(10, main_~a~0#1.base, main_~a~0#1.offset, 8); {5736#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,881 INFO L290 TraceCheckUtils]: 7: Hoare triple {5736#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5740#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,881 INFO L290 TraceCheckUtils]: 8: Hoare triple {5740#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {5740#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,882 INFO L290 TraceCheckUtils]: 9: Hoare triple {5740#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5747#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))))} is VALID [2022-02-20 14:30:07,883 INFO L290 TraceCheckUtils]: 10: Hoare triple {5747#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5751#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,883 INFO L290 TraceCheckUtils]: 11: Hoare triple {5751#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {5751#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,884 INFO L290 TraceCheckUtils]: 12: Hoare triple {5751#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5758#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))))} is VALID [2022-02-20 14:30:07,885 INFO L290 TraceCheckUtils]: 13: Hoare triple {5758#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5762#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,886 INFO L290 TraceCheckUtils]: 14: Hoare triple {5762#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {5762#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,887 INFO L290 TraceCheckUtils]: 15: Hoare triple {5762#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (= 2 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967294 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(0 == main_~i~0#1);call main_#t~mem8#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(10 + main_#t~mem8#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem8#1; {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,887 INFO L290 TraceCheckUtils]: 16: Hoare triple {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,888 INFO L290 TraceCheckUtils]: 17: Hoare triple {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !(main_~i~0#1 < ~N~0); {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,888 INFO L290 TraceCheckUtils]: 18: Hoare triple {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} main_~i~0#1 := 0; {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,889 INFO L290 TraceCheckUtils]: 19: Hoare triple {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume !!(main_~i~0#1 < ~N~0); {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:30:07,890 INFO L290 TraceCheckUtils]: 20: Hoare triple {5769#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {5785#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,891 INFO L290 TraceCheckUtils]: 21: Hoare triple {5785#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5789#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,891 INFO L290 TraceCheckUtils]: 22: Hoare triple {5789#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {5789#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,893 INFO L290 TraceCheckUtils]: 23: Hoare triple {5789#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5796#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1))} is VALID [2022-02-20 14:30:07,893 INFO L290 TraceCheckUtils]: 24: Hoare triple {5796#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= |ULTIMATE.start_main_~i~0#1| 1) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8))) 1))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5800#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,894 INFO L290 TraceCheckUtils]: 25: Hoare triple {5800#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {5800#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,896 INFO L290 TraceCheckUtils]: 26: Hoare triple {5800#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8))) (= 2 |ULTIMATE.start_main_~i~0#1|) (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 8)) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| 16))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5807#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,897 INFO L290 TraceCheckUtils]: 27: Hoare triple {5807#(and (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 8)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ 4294967295 |ULTIMATE.start_main_~i~0#1|) 4294967296) 8)))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5811#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 3 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,898 INFO L290 TraceCheckUtils]: 28: Hoare triple {5811#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 3 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {5811#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 3 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,900 INFO L290 TraceCheckUtils]: 29: Hoare triple {5811#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= 3 |ULTIMATE.start_main_~i~0#1|) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == main_~i~0#1);call main_#t~mem10#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call main_#t~mem11#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (if (main_~i~0#1 - 1) % 4294967296 <= 2147483647 then (main_~i~0#1 - 1) % 4294967296 else (main_~i~0#1 - 1) % 4294967296 - 4294967296), 8);call write~int(main_#t~mem10#1 + main_#t~mem11#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);havoc main_#t~mem10#1;havoc main_#t~mem11#1; {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(main_~i~0#1 < ~N~0); {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,904 INFO L290 TraceCheckUtils]: 32: Hoare triple {5818#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_~i~0#1 := 0; {5828#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:30:07,905 INFO L290 TraceCheckUtils]: 33: Hoare triple {5828#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (<= 10 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 16))) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8)) (<= (+ (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 8) 10) (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 16)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem13#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (if main_~i~0#1 % 4294967296 <= 2147483647 then main_~i~0#1 % 4294967296 else main_~i~0#1 % 4294967296 - 4294967296), 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem13#1 == 1 + (5 * main_~i~0#1 * main_~i~0#1 + 5 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5832#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:30:07,905 INFO L290 TraceCheckUtils]: 34: Hoare triple {5832#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5713#false} is VALID [2022-02-20 14:30:07,905 INFO L290 TraceCheckUtils]: 35: Hoare triple {5713#false} assume !false; {5713#false} is VALID [2022-02-20 14:30:07,906 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 11 proven. 33 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:30:07,906 INFO L328 TraceCheckSpWp]: Computing backward predicates...