./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/ifeqn3.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/ifeqn3.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 c28ec531d32a995842654b11d319d79f5f6e1bd0d3e33d9bd3cc173d0787760c --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:29:18,158 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:29:18,160 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:29:18,195 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:29:18,195 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:29:18,196 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:29:18,197 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:29:18,198 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:29:18,199 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:29:18,199 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:29:18,200 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:29:18,201 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:29:18,201 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:29:18,202 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:29:18,202 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:29:18,203 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:29:18,204 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:29:18,204 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:29:18,205 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:29:18,206 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:29:18,207 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:29:18,209 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:29:18,210 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:29:18,212 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:29:18,213 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:29:18,217 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:29:18,217 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:29:18,218 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:29:18,219 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:29:18,220 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:29:18,220 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:29:18,220 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:29:18,221 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:29:18,222 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:29:18,223 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:29:18,223 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:29:18,224 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:29:18,225 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:29:18,225 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:29:18,225 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:29:18,226 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:29:18,227 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:18,250 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:29:18,251 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:29:18,251 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:29:18,251 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:29:18,252 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:29:18,252 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:29:18,253 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:29:18,253 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:29:18,253 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:29:18,253 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:29:18,254 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:29:18,254 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:29:18,254 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:29:18,254 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:29:18,255 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:29:18,256 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:29:18,256 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:29:18,256 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:29:18,256 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:29:18,256 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:18,257 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:29:18,257 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:29:18,257 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:29:18,257 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:29:18,257 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:29:18,257 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:29:18,258 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:29:18,258 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:29:18,258 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 -> c28ec531d32a995842654b11d319d79f5f6e1bd0d3e33d9bd3cc173d0787760c [2022-02-20 14:29:18,474 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:29:18,497 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:29:18,499 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:29:18,500 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:29:18,501 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:29:18,502 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/ifeqn3.c [2022-02-20 14:29:18,566 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1752ed4ae/e41aeb68f8a34ee2b138d808dd3e9270/FLAGacadacae7 [2022-02-20 14:29:18,889 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:29:18,889 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/ifeqn3.c [2022-02-20 14:29:18,893 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1752ed4ae/e41aeb68f8a34ee2b138d808dd3e9270/FLAGacadacae7 [2022-02-20 14:29:19,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1752ed4ae/e41aeb68f8a34ee2b138d808dd3e9270 [2022-02-20 14:29:19,314 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:29:19,317 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:29:19,318 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:19,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:29:19,320 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:29:19,321 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:19" (1/1) ... [2022-02-20 14:29:19,322 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6b294658 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:19, skipping insertion in model container [2022-02-20 14:29:19,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:29:19" (1/1) ... [2022-02-20 14:29:19,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:29:19,338 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:29:19,470 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/ifeqn3.c[589,602] [2022-02-20 14:29:19,504 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:19,512 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:29:19,524 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/ifeqn3.c[589,602] [2022-02-20 14:29:19,543 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:29:19,553 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:29:19,554 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:19 WrapperNode [2022-02-20 14:29:19,554 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:29:19,555 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:19,555 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:29:19,555 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:29:19,563 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:19" (1/1) ... [2022-02-20 14:29:19,574 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:19" (1/1) ... [2022-02-20 14:29:19,601 INFO L137 Inliner]: procedures = 16, calls = 19, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-02-20 14:29:19,601 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:29:19,602 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:29:19,602 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:29:19,602 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:29:19,608 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:19" (1/1) ... [2022-02-20 14:29:19,608 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:19" (1/1) ... [2022-02-20 14:29:19,611 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:19" (1/1) ... [2022-02-20 14:29:19,612 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:19" (1/1) ... [2022-02-20 14:29:19,628 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:19" (1/1) ... [2022-02-20 14:29:19,631 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:19" (1/1) ... [2022-02-20 14:29:19,634 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:19" (1/1) ... [2022-02-20 14:29:19,637 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:29:19,639 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:29:19,640 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:29:19,640 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:29:19,641 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:19" (1/1) ... [2022-02-20 14:29:19,645 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:29:19,653 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:19,663 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:19,669 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:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:29:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:29:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:29:19,695 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:29:19,696 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:29:19,696 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:29:19,696 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:29:19,747 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:29:19,748 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:29:19,960 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:29:19,964 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:29:19,965 INFO L299 CfgBuilder]: Removed 3 assume(true) statements. [2022-02-20 14:29:19,966 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:19 BoogieIcfgContainer [2022-02-20 14:29:19,966 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:29:19,967 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:29:19,968 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:29:19,971 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:29:19,971 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:29:19" (1/3) ... [2022-02-20 14:29:19,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69268fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:19, skipping insertion in model container [2022-02-20 14:29:19,972 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:29:19" (2/3) ... [2022-02-20 14:29:19,972 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@69268fe8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:29:19, skipping insertion in model container [2022-02-20 14:29:19,973 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:29:19" (3/3) ... [2022-02-20 14:29:19,974 INFO L111 eAbstractionObserver]: Analyzing ICFG ifeqn3.c [2022-02-20 14:29:19,977 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:29:19,978 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:29:20,023 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:29:20,040 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:20,040 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:29:20,051 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:20,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:20,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:20,055 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:20,059 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:20,064 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:20,064 INFO L85 PathProgramCache]: Analyzing trace with hash -1670316217, now seen corresponding path program 1 times [2022-02-20 14:29:20,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:20,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649285614] [2022-02-20 14:29:20,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:20,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:20,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:20,225 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:20,226 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:20,227 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:20,228 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:20,228 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:20,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} assume !(main_~i~0#1 < ~N~0); {27#false} is VALID [2022-02-20 14:29:20,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:20,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:29:20,229 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} main_~i~0#1 := 0; {27#false} is VALID [2022-02-20 14:29:20,230 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:20,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:29:20,231 INFO L290 TraceCheckUtils]: 11: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:29:20,232 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:20,232 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:20,232 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649285614] [2022-02-20 14:29:20,233 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649285614] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:20,234 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:20,234 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:29:20,235 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1058442660] [2022-02-20 14:29:20,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:20,240 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:20,241 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:20,243 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:20,264 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:20,265 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:29:20,265 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:20,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:29:20,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:29:20,285 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:20,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,327 INFO L93 Difference]: Finished difference Result 42 states and 60 transitions. [2022-02-20 14:29:20,328 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:29:20,328 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:20,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:20,329 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:20,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:20,336 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:20,342 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 60 transitions. [2022-02-20 14:29:20,342 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 60 transitions. [2022-02-20 14:29:20,420 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:20,430 INFO L225 Difference]: With dead ends: 42 [2022-02-20 14:29:20,430 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:29:20,432 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:20,436 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:20,437 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:20,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:29:20,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:29:20,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:20,459 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:20,460 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:20,461 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:20,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,463 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:20,463 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:20,464 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:20,464 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:20,464 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:20,465 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:20,467 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,467 INFO L93 Difference]: Finished difference Result 19 states and 23 transitions. [2022-02-20 14:29:20,467 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:20,467 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:20,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:20,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:20,469 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:20,470 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:20,471 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2022-02-20 14:29:20,473 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2022-02-20 14:29:20,473 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:20,473 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2022-02-20 14:29:20,473 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:20,474 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2022-02-20 14:29:20,474 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 14:29:20,474 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:20,475 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:20,475 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:29:20,476 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:20,480 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:20,481 INFO L85 PathProgramCache]: Analyzing trace with hash -1000416578, now seen corresponding path program 1 times [2022-02-20 14:29:20,481 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:20,481 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1357111912] [2022-02-20 14:29:20,481 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:20,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:20,509 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:20,553 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:20,553 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:20,562 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:20,562 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:20,563 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:20,564 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:20,564 INFO L290 TraceCheckUtils]: 6: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:20,564 INFO L290 TraceCheckUtils]: 7: Hoare triple {141#false} assume !(main_~i~0#1 < ~N~0); {141#false} is VALID [2022-02-20 14:29:20,564 INFO L290 TraceCheckUtils]: 8: Hoare triple {141#false} main_~i~0#1 := 0; {141#false} is VALID [2022-02-20 14:29:20,565 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:20,565 INFO L290 TraceCheckUtils]: 10: Hoare triple {141#false} assume 0 == __VERIFIER_assert_~cond#1; {141#false} is VALID [2022-02-20 14:29:20,565 INFO L290 TraceCheckUtils]: 11: Hoare triple {141#false} assume !false; {141#false} is VALID [2022-02-20 14:29:20,565 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:20,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:20,566 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1357111912] [2022-02-20 14:29:20,566 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1357111912] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:20,566 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:20,566 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:29:20,567 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [752041221] [2022-02-20 14:29:20,567 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:20,568 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:20,568 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:20,569 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:20,580 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:20,581 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:29:20,581 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:20,582 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:29:20,582 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:29:20,587 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:20,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,694 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:29:20,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:29:20,694 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:20,694 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:20,695 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:20,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:20,696 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:20,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 57 transitions. [2022-02-20 14:29:20,696 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 57 transitions. [2022-02-20 14:29:20,737 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:20,738 INFO L225 Difference]: With dead ends: 45 [2022-02-20 14:29:20,738 INFO L226 Difference]: Without dead ends: 31 [2022-02-20 14:29:20,739 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:20,740 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:20,740 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:20,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2022-02-20 14:29:20,746 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 23. [2022-02-20 14:29:20,746 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:20,747 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:20,747 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:20,747 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:20,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,748 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:20,748 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:20,748 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:20,748 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:20,749 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:20,749 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:20,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:20,750 INFO L93 Difference]: Finished difference Result 31 states and 35 transitions. [2022-02-20 14:29:20,750 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2022-02-20 14:29:20,750 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:20,750 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:20,750 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:20,750 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:20,750 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:20,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 27 transitions. [2022-02-20 14:29:20,751 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 27 transitions. Word has length 12 [2022-02-20 14:29:20,751 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:20,751 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 27 transitions. [2022-02-20 14:29:20,751 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:20,752 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 27 transitions. [2022-02-20 14:29:20,752 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:29:20,752 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:20,752 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:20,752 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 14:29:20,752 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:20,753 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:20,753 INFO L85 PathProgramCache]: Analyzing trace with hash -1992201947, now seen corresponding path program 1 times [2022-02-20 14:29:20,753 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:20,753 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [824895015] [2022-02-20 14:29:20,753 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:20,753 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:20,772 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:20,773 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2012112137] [2022-02-20 14:29:20,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:20,773 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:20,773 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:20,787 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:20,792 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:20,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:20,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 95 conjuncts, 11 conjunts are in the unsatisfiable core [2022-02-20 14:29:20,854 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:20,858 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:20,931 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:21,094 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:21,094 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:21,094 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:21,095 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:21,095 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:21,095 INFO L290 TraceCheckUtils]: 5: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:21,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {290#true} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {290#true} is VALID [2022-02-20 14:29:21,096 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:21,110 INFO L290 TraceCheckUtils]: 8: Hoare triple {290#true} assume !(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:21,110 INFO L290 TraceCheckUtils]: 9: Hoare triple {290#true} main_~i~0#1 := 0; {290#true} is VALID [2022-02-20 14:29:21,111 INFO L290 TraceCheckUtils]: 10: Hoare triple {290#true} assume !!(main_~i~0#1 < ~N~0); {290#true} is VALID [2022-02-20 14:29:21,111 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:21,112 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:21,112 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:21,113 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:21,114 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:21,114 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:21,114 INFO L290 TraceCheckUtils]: 17: Hoare triple {291#false} assume !false; {291#false} is VALID [2022-02-20 14:29:21,115 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:21,115 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:21,115 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:21,115 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [824895015] [2022-02-20 14:29:21,115 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:21,116 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2012112137] [2022-02-20 14:29:21,116 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2012112137] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:21,116 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:21,116 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:21,116 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [681704262] [2022-02-20 14:29:21,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:21,117 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:21,117 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:21,117 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:21,132 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:21,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:21,133 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:21,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:21,136 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:21,136 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:21,307 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:21,308 INFO L93 Difference]: Finished difference Result 40 states and 46 transitions. [2022-02-20 14:29:21,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:29:21,308 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:21,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:21,308 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:21,309 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:21,309 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:21,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 42 transitions. [2022-02-20 14:29:21,310 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 42 transitions. [2022-02-20 14:29:21,355 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:21,357 INFO L225 Difference]: With dead ends: 40 [2022-02-20 14:29:21,357 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 14:29:21,357 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:21,360 INFO L933 BasicCegarLoop]: 21 mSDtfsCounter, 13 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s 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.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:21,361 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.0s Time] [2022-02-20 14:29:21,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 14:29:21,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 28. [2022-02-20 14:29:21,368 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:21,368 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:21,368 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:21,369 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:21,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:21,370 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:21,370 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:21,370 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:21,370 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:21,370 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:21,370 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:21,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:21,378 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2022-02-20 14:29:21,378 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 44 transitions. [2022-02-20 14:29:21,378 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:21,378 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:21,378 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:21,379 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:21,379 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:21,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2022-02-20 14:29:21,381 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2022-02-20 14:29:21,382 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:21,382 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2022-02-20 14:29:21,382 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:21,382 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2022-02-20 14:29:21,382 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:29:21,383 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:21,383 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:21,400 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:29:21,583 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:21,584 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:21,584 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:21,584 INFO L85 PathProgramCache]: Analyzing trace with hash 259417010, now seen corresponding path program 1 times [2022-02-20 14:29:21,584 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:21,584 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627505521] [2022-02-20 14:29:21,584 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:21,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:21,611 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:21,611 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [163290596] [2022-02-20 14:29:21,611 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:21,611 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:21,611 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:21,621 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:21,623 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:21,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:21,669 INFO L263 TraceCheckSpWp]: Trace formula consists of 103 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:29:21,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:21,695 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:21,828 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:21,832 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:21,832 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:21,833 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:21,833 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:21,833 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:21,834 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, 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:21,834 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:21,835 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:21,835 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:21,837 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:21,837 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:21,840 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:21,840 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:21,855 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:21,855 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:21,855 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:21,856 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:21,856 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:21,856 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:21,856 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:21,856 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:21,856 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:21,988 INFO L290 TraceCheckUtils]: 20: Hoare triple {513#false} assume !false; {513#false} is VALID [2022-02-20 14:29:21,989 INFO L290 TraceCheckUtils]: 19: Hoare triple {513#false} assume 0 == __VERIFIER_assert_~cond#1; {513#false} is VALID [2022-02-20 14:29:21,989 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:21,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {513#false} main_~i~0#1 := 0; {513#false} is VALID [2022-02-20 14:29:21,990 INFO L290 TraceCheckUtils]: 16: Hoare triple {513#false} assume !(main_~i~0#1 < ~N~0); {513#false} is VALID [2022-02-20 14:29:21,990 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:21,990 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:21,990 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:21,991 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:21,992 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:21,997 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:21,998 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:21,998 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:21,999 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:22,003 INFO L290 TraceCheckUtils]: 6: Hoare triple {529#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, 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:22,004 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:22,004 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:22,004 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:22,005 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:22,005 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:22,005 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:22,005 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:22,005 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:22,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627505521] [2022-02-20 14:29:22,006 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:22,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163290596] [2022-02-20 14:29:22,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163290596] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:22,006 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:22,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:29:22,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138643518] [2022-02-20 14:29:22,007 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:22,007 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:22,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:22,007 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:22,026 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:22,026 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:29:22,026 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:22,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:29:22,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:29:22,027 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:22,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:22,339 INFO L93 Difference]: Finished difference Result 70 states and 82 transitions. [2022-02-20 14:29:22,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 14:29:22,339 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:22,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:22,339 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:22,343 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:22,343 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:22,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 76 transitions. [2022-02-20 14:29:22,346 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 76 transitions. [2022-02-20 14:29:22,392 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:22,393 INFO L225 Difference]: With dead ends: 70 [2022-02-20 14:29:22,393 INFO L226 Difference]: Without dead ends: 43 [2022-02-20 14:29:22,393 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:22,394 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:22,394 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:22,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 43 states. [2022-02-20 14:29:22,403 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 43 to 27. [2022-02-20 14:29:22,403 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:22,404 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:22,404 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:22,404 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:22,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:22,405 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:22,405 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:22,405 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:22,405 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:22,406 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:22,406 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:22,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:22,412 INFO L93 Difference]: Finished difference Result 43 states and 49 transitions. [2022-02-20 14:29:22,413 INFO L276 IsEmpty]: Start isEmpty. Operand 43 states and 49 transitions. [2022-02-20 14:29:22,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:22,414 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:22,414 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:22,414 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:22,414 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:22,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 31 transitions. [2022-02-20 14:29:22,415 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 31 transitions. Word has length 21 [2022-02-20 14:29:22,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:22,415 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 31 transitions. [2022-02-20 14:29:22,416 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:22,416 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 31 transitions. [2022-02-20 14:29:22,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:29:22,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:22,417 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:22,435 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:22,622 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:22,622 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:22,623 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:22,623 INFO L85 PathProgramCache]: Analyzing trace with hash 939318754, now seen corresponding path program 1 times [2022-02-20 14:29:22,623 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:22,623 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2081138446] [2022-02-20 14:29:22,623 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:22,624 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:22,646 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:22,646 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1518814744] [2022-02-20 14:29:22,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:22,646 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:22,647 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:22,648 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:22,649 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:22,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:22,711 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 21 conjunts are in the unsatisfiable core [2022-02-20 14:29:22,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:22,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:22,821 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:22,907 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 14:29:22,907 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:23,003 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:23,003 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:23,003 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:23,003 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:23,004 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:23,004 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:23,004 INFO L290 TraceCheckUtils]: 6: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, 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:23,005 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:23,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:23,005 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(6 + 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:23,005 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:23,005 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:23,011 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:23,011 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:23,012 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:23,012 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:23,013 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:23,013 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:23,014 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:23,014 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:23,015 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:23,015 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:23,016 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:23,016 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:23,016 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:23,016 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:23,408 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:23,459 INFO L290 TraceCheckUtils]: 23: Hoare triple {857#false} assume !false; {857#false} is VALID [2022-02-20 14:29:23,460 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:23,461 INFO L290 TraceCheckUtils]: 21: Hoare triple {941#(and (or (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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)))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:23,462 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 (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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)))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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:23,463 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:23,463 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:23,465 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:23,466 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:23,467 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:23,468 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:23,469 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:23,469 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:23,469 INFO L290 TraceCheckUtils]: 11: Hoare triple {856#true} assume !(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:23,470 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:23,470 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(6 + 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:23,470 INFO L290 TraceCheckUtils]: 8: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:23,470 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:23,470 INFO L290 TraceCheckUtils]: 6: Hoare triple {856#true} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {856#true} is VALID [2022-02-20 14:29:23,470 INFO L290 TraceCheckUtils]: 5: Hoare triple {856#true} assume !!(main_~i~0#1 < ~N~0); {856#true} is VALID [2022-02-20 14:29:23,470 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:23,470 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:23,470 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:23,470 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:23,471 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:23,471 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:23,471 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:23,471 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2081138446] [2022-02-20 14:29:23,472 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:23,472 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1518814744] [2022-02-20 14:29:23,472 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1518814744] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:23,472 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:23,472 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8] total 11 [2022-02-20 14:29:23,472 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529805904] [2022-02-20 14:29:23,472 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:23,473 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:23,473 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:23,473 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:23,516 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:23,517 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:29:23,517 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:23,517 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:29:23,517 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:29:23,517 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:23,858 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,859 INFO L93 Difference]: Finished difference Result 73 states and 86 transitions. [2022-02-20 14:29:23,859 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:29:23,859 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:23,859 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:23,859 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:23,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:23,860 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:23,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:23,862 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2022-02-20 14:29:23,922 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:23,923 INFO L225 Difference]: With dead ends: 73 [2022-02-20 14:29:23,923 INFO L226 Difference]: Without dead ends: 61 [2022-02-20 14:29:23,923 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:23,923 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:23,924 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:23,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 61 states. [2022-02-20 14:29:23,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 61 to 38. [2022-02-20 14:29:23,938 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:23,938 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:23,938 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:23,938 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:23,939 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,939 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:23,940 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:23,940 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,940 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,940 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:23,940 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:23,941 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:23,941 INFO L93 Difference]: Finished difference Result 61 states and 70 transitions. [2022-02-20 14:29:23,941 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 70 transitions. [2022-02-20 14:29:23,942 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:23,942 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:23,942 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:23,942 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:23,942 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:23,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 38 states to 38 states and 45 transitions. [2022-02-20 14:29:23,943 INFO L78 Accepts]: Start accepts. Automaton has 38 states and 45 transitions. Word has length 24 [2022-02-20 14:29:23,943 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:23,943 INFO L470 AbstractCegarLoop]: Abstraction has 38 states and 45 transitions. [2022-02-20 14:29:23,943 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:23,943 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 45 transitions. [2022-02-20 14:29:23,944 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:29:23,944 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:23,944 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:23,966 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:29:24,166 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:24,167 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:24,167 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:24,167 INFO L85 PathProgramCache]: Analyzing trace with hash 430403928, now seen corresponding path program 1 times [2022-02-20 14:29:24,168 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:24,168 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1989251421] [2022-02-20 14:29:24,168 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:24,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:24,197 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:24,197 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [431068252] [2022-02-20 14:29:24,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:24,198 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:24,198 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:24,199 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:24,201 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:24,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:24,277 INFO L263 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 37 conjunts are in the unsatisfiable core [2022-02-20 14:29:24,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:24,288 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:24,305 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:24,349 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:24,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:24,422 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:24,509 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2022-02-20 14:29:24,624 INFO L356 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2022-02-20 14:29:24,625 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:25,295 INFO L356 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2022-02-20 14:29:25,296 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 1 case distinctions, treesize of input 74 treesize of output 34 [2022-02-20 14:29:25,334 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:25,335 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:25,335 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:25,335 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:25,336 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) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,336 INFO L290 TraceCheckUtils]: 5: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 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) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,336 INFO L290 TraceCheckUtils]: 6: Hoare triple {1291#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 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(6, 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,337 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,337 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,338 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|) 6) (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(6 + 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,338 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,339 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,339 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,340 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,340 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|) 6) (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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,341 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,341 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} is VALID [2022-02-20 14:29:25,344 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|) 6) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)))} 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#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} is VALID [2022-02-20 14:29:25,345 INFO L290 TraceCheckUtils]: 18: Hoare triple {1336#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1336#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} is VALID [2022-02-20 14:29:25,346 INFO L290 TraceCheckUtils]: 19: Hoare triple {1336#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} assume !(main_~i~0#1 < ~N~0); {1336#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} is VALID [2022-02-20 14:29:25,347 INFO L290 TraceCheckUtils]: 20: Hoare triple {1336#(exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|))))} main_~i~0#1 := 0; {1346#(and (= |ULTIMATE.start_main_~i~0#1| 0) (exists ((|ULTIMATE.start_main_~a~0#1.base| Int)) (and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} is VALID [2022-02-20 14:29:25,348 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} is VALID [2022-02-20 14:29:25,349 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} is VALID [2022-02-20 14:29:25,350 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} is VALID [2022-02-20 14:29:25,351 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} is VALID [2022-02-20 14:29:25,351 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= (+ (* (- 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) (= 6 (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)) (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|)))))} 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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:25,352 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:25,352 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:25,352 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:25,352 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:26,903 WARN L838 $PredicateComparison]: unable to prove that (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (select (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) (store .cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8)) (let ((.cse1 (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8))) (+ (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~a~0#1.base|) (+ .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|)) (select .cse0 (+ |ULTIMATE.start_main_~b~0#1.offset| .cse1)))))) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)) 7)) is different from false [2022-02-20 14:29:29,618 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse0 (<= (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (and (or .cse0 (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (select (select (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_112)))) (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))) (or (not .cse0) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod |c_ULTIMATE.start_main_~i~0#1| 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_112)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1)))))) is different from false [2022-02-20 14:29:30,616 WARN L838 $PredicateComparison]: unable to prove that (let ((.cse1 (<= (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647))) (and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (select (select (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_112)))) (store .cse0 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse0 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (not .cse1)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (select (select (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* (mod (+ |c_ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) |c_ULTIMATE.start_main_~a~0#1.offset| (- 34359738368)) v_ArrVal_112)))) (store .cse2 |c_ULTIMATE.start_main_~b~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset| 1))) |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) .cse1))) is different from false [2022-02-20 14:29:30,756 INFO L290 TraceCheckUtils]: 27: Hoare triple {1275#false} assume !false; {1275#false} is VALID [2022-02-20 14:29:30,757 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:30,759 INFO L290 TraceCheckUtils]: 25: Hoare triple {1376#(and (or (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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)))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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,784 WARN 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} 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 (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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)))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))) (or (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647) (= (+ (* |ULTIMATE.start_main_~i~0#1| (* 3 |ULTIMATE.start_main_~i~0#1|)) (* 3 |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 UNKNOWN [2022-02-20 14:29:32,786 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} is VALID [2022-02-20 14:29:32,787 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} is VALID [2022-02-20 14:29:32,788 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} is VALID [2022-02-20 14:29:32,789 INFO L290 TraceCheckUtils]: 20: Hoare triple {1393#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} 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))) (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4)) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (= (+ (* (+ 3 (* 3 |ULTIMATE.start_main_~i~0#1|)) (+ |ULTIMATE.start_main_~i~0#1| 1)) (* 3 |ULTIMATE.start_main_~i~0#1|) 4) (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))))))} is VALID [2022-02-20 14:29:32,789 INFO L290 TraceCheckUtils]: 19: Hoare triple {1393#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} assume !(main_~i~0#1 < ~N~0); {1393#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:32,790 INFO L290 TraceCheckUtils]: 18: Hoare triple {1393#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1393#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:32,793 INFO L290 TraceCheckUtils]: 17: Hoare triple {1403#(= 7 (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#(= 7 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8)))} is VALID [2022-02-20 14:29:32,794 INFO L290 TraceCheckUtils]: 16: Hoare triple {1403#(= 7 (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#(= 7 (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:32,796 INFO L290 TraceCheckUtils]: 15: Hoare triple {1410#(= 7 (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)))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1403#(= 7 (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:32,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {1414#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= 7 (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))))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {1410#(= 7 (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)))} is VALID [2022-02-20 14:29:32,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {1414#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= 7 (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))))} assume !!(main_~i~0#1 < ~N~0); {1414#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= 7 (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))))} is VALID [2022-02-20 14:29:32,798 INFO L290 TraceCheckUtils]: 12: Hoare triple {1421#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} main_~i~0#1 := 0; {1414#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= 7 (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))))} is VALID [2022-02-20 14:29:32,799 INFO L290 TraceCheckUtils]: 11: Hoare triple {1421#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} assume !(main_~i~0#1 < ~N~0); {1421#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} is VALID [2022-02-20 14:29:32,799 INFO L290 TraceCheckUtils]: 10: Hoare triple {1421#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1421#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} is VALID [2022-02-20 14:29:32,806 INFO L290 TraceCheckUtils]: 9: Hoare triple {1431#(and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))))} 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(6 + 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#(forall ((|ULTIMATE.start_main_~b~0#1.offset| Int)) (= (+ (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) 7))} is VALID [2022-02-20 14:29:32,807 INFO L290 TraceCheckUtils]: 8: Hoare triple {1431#(and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))))} assume !!(main_~i~0#1 < ~N~0); {1431#(and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:32,811 INFO L290 TraceCheckUtils]: 7: Hoare triple {1438#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1)))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1431#(and (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647)) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1))) (not (<= (mod |ULTIMATE.start_main_~i~0#1| 4294967296) 2147483647))))} is VALID [2022-02-20 14:29:32,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {1442#(and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0)))} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {1438#(and (or (not (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)) (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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|) 1)))) (or (forall ((|ULTIMATE.start_main_~b~0#1.offset| Int) (v_ArrVal_112 Int)) (= 7 (+ (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) (- 34359738368)) 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) (- 34359738368)) 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|) 1))) (<= (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 2147483647)))} is VALID [2022-02-20 14:29:32,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {1442#(and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0)))} assume !!(main_~i~0#1 < ~N~0); {1442#(and (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0)))} is VALID [2022-02-20 14:29:32,813 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 (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= (* (mod (+ |ULTIMATE.start_main_~i~0#1| 1) 4294967296) 8) 0)))} is VALID [2022-02-20 14:29:32,813 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,813 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,813 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,813 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,814 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2022-02-20 14:29:32,814 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:32,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1989251421] [2022-02-20 14:29:32,814 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:32,814 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [431068252] [2022-02-20 14:29:32,814 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [431068252] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:32,814 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:32,815 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-02-20 14:29:32,815 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2012267511] [2022-02-20 14:29:32,815 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:32,815 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:32,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:32,816 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:32,915 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:29:32,915 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:29:32,915 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:32,915 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:29:32,916 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=276, Unknown=6, NotChecked=108, Total=462 [2022-02-20 14:29:32,916 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:33,547 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:33,548 INFO L93 Difference]: Finished difference Result 101 states and 123 transitions. [2022-02-20 14:29:33,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 14:29:33,548 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,548 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:33,549 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:33,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 83 transitions. [2022-02-20 14:29:33,550 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:33,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 83 transitions. [2022-02-20 14:29:33,551 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 83 transitions. [2022-02-20 14:29:33,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 83 edges. 83 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:33,642 INFO L225 Difference]: With dead ends: 101 [2022-02-20 14:29:33,643 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 14:29:33,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 33 SyntacticMatches, 5 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=119, Invalid=439, Unknown=6, NotChecked=138, Total=702 [2022-02-20 14:29:33,644 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 24 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 106 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 274 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 106 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 148 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:33,644 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [24 Valid, 95 Invalid, 274 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 106 Invalid, 0 Unknown, 148 Unchecked, 0.1s Time] [2022-02-20 14:29:33,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 14:29:33,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 60. [2022-02-20 14:29:33,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:33,681 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:33,682 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:33,683 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:33,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:33,684 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-02-20 14:29:33,684 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-02-20 14:29:33,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:33,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:33,685 INFO L74 IsIncluded]: Start isIncluded. First operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 14:29:33,686 INFO L87 Difference]: Start difference. First operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 70 states. [2022-02-20 14:29:33,687 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:33,687 INFO L93 Difference]: Finished difference Result 70 states and 83 transitions. [2022-02-20 14:29:33,688 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 83 transitions. [2022-02-20 14:29:33,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:33,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:33,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:33,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:33,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:33,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-02-20 14:29:33,690 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 28 [2022-02-20 14:29:33,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:33,690 INFO L470 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-02-20 14:29:33,690 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:33,690 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-02-20 14:29:33,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:33,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:33,691 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:33,717 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:33,909 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:33,909 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:33,910 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:33,910 INFO L85 PathProgramCache]: Analyzing trace with hash -849177916, now seen corresponding path program 2 times [2022-02-20 14:29:33,910 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:33,910 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1111611589] [2022-02-20 14:29:33,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:33,910 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:33,936 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:33,936 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1879170274] [2022-02-20 14:29:33,936 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:33,937 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:33,937 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:33,941 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:33,941 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:33,994 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:33,994 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:33,995 INFO L263 TraceCheckSpWp]: Trace formula consists of 128 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:29:34,003 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:34,004 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:34,081 INFO L290 TraceCheckUtils]: 0: Hoare triple {1824#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; {1824#true} is VALID [2022-02-20 14:29:34,082 INFO L290 TraceCheckUtils]: 1: Hoare triple {1824#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; {1824#true} is VALID [2022-02-20 14:29:34,083 INFO L290 TraceCheckUtils]: 2: Hoare triple {1824#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; {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 3: Hoare triple {1824#true} assume !(0 == assume_abort_if_not_~cond#1); {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {1824#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; {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {1824#true} assume !!(main_~i~0#1 < ~N~0); {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {1824#true} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 7: Hoare triple {1824#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1824#true} is VALID [2022-02-20 14:29:34,084 INFO L290 TraceCheckUtils]: 8: Hoare triple {1824#true} assume !!(main_~i~0#1 < ~N~0); {1824#true} is VALID [2022-02-20 14:29:34,085 INFO L290 TraceCheckUtils]: 9: Hoare triple {1824#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(6 + 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; {1824#true} is VALID [2022-02-20 14:29:34,085 INFO L290 TraceCheckUtils]: 10: Hoare triple {1824#true} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1824#true} is VALID [2022-02-20 14:29:34,085 INFO L290 TraceCheckUtils]: 11: Hoare triple {1824#true} assume !(main_~i~0#1 < ~N~0); {1824#true} is VALID [2022-02-20 14:29:34,085 INFO L290 TraceCheckUtils]: 12: Hoare triple {1824#true} main_~i~0#1 := 0; {1865#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,086 INFO L290 TraceCheckUtils]: 13: Hoare triple {1865#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1865#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,086 INFO L290 TraceCheckUtils]: 14: Hoare triple {1865#(<= 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); {1865#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,090 INFO L290 TraceCheckUtils]: 15: Hoare triple {1865#(<= 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; {1875#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,091 INFO L290 TraceCheckUtils]: 16: Hoare triple {1875#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1875#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,091 INFO L290 TraceCheckUtils]: 17: Hoare triple {1875#(<= 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; {1875#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,092 INFO L290 TraceCheckUtils]: 18: Hoare triple {1875#(<= 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; {1885#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,092 INFO L290 TraceCheckUtils]: 19: Hoare triple {1885#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {1885#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:34,092 INFO L290 TraceCheckUtils]: 20: Hoare triple {1885#(<= 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); {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 21: Hoare triple {1825#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 22: Hoare triple {1825#false} assume !!(main_~i~0#1 < ~N~0); {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 23: Hoare triple {1825#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; {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 24: Hoare triple {1825#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 25: Hoare triple {1825#false} assume !(main_~i~0#1 < ~N~0); {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 26: Hoare triple {1825#false} main_~i~0#1 := 0; {1825#false} is VALID [2022-02-20 14:29:34,093 INFO L290 TraceCheckUtils]: 27: Hoare triple {1825#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1825#false} is VALID [2022-02-20 14:29:34,094 INFO L290 TraceCheckUtils]: 28: Hoare triple {1825#false} assume 0 == __VERIFIER_assert_~cond#1; {1825#false} is VALID [2022-02-20 14:29:34,094 INFO L290 TraceCheckUtils]: 29: Hoare triple {1825#false} assume !false; {1825#false} is VALID [2022-02-20 14:29:34,095 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:34,095 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:29:34,095 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:34,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1111611589] [2022-02-20 14:29:34,095 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:34,095 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1879170274] [2022-02-20 14:29:34,095 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1879170274] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:29:34,096 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:29:34,096 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:29:34,096 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030031345] [2022-02-20 14:29:34,096 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:29:34,097 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:34,097 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:34,097 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:34,112 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:34,112 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:29:34,113 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:34,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:29:34,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:29:34,113 INFO L87 Difference]: Start difference. First operand 60 states and 72 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:34,242 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:34,243 INFO L93 Difference]: Finished difference Result 123 states and 147 transitions. [2022-02-20 14:29:34,243 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 14:29:34,243 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:34,243 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:34,243 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:34,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:34,245 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:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 65 transitions. [2022-02-20 14:29:34,247 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 65 transitions. [2022-02-20 14:29:34,288 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:34,290 INFO L225 Difference]: With dead ends: 123 [2022-02-20 14:29:34,290 INFO L226 Difference]: Without dead ends: 70 [2022-02-20 14:29:34,291 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:34,292 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 27 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:34,292 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 33 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:29:34,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2022-02-20 14:29:34,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 55. [2022-02-20 14:29:34,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:34,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 70 states. Second operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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:34,323 INFO L74 IsIncluded]: Start isIncluded. First operand 70 states. Second operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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:34,324 INFO L87 Difference]: Start difference. First operand 70 states. Second operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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:34,325 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:34,325 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-20 14:29:34,325 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-02-20 14:29:34,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:34,325 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:34,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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 70 states. [2022-02-20 14:29:34,325 INFO L87 Difference]: Start difference. First operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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 70 states. [2022-02-20 14:29:34,326 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:34,326 INFO L93 Difference]: Finished difference Result 70 states and 77 transitions. [2022-02-20 14:29:34,326 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 77 transitions. [2022-02-20 14:29:34,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:34,327 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:34,327 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:34,327 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:34,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 55 states, 54 states have (on average 1.1481481481481481) internal successors, (62), 54 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:34,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55 states to 55 states and 62 transitions. [2022-02-20 14:29:34,328 INFO L78 Accepts]: Start accepts. Automaton has 55 states and 62 transitions. Word has length 30 [2022-02-20 14:29:34,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:34,328 INFO L470 AbstractCegarLoop]: Abstraction has 55 states and 62 transitions. [2022-02-20 14:29:34,328 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:34,328 INFO L276 IsEmpty]: Start isEmpty. Operand 55 states and 62 transitions. [2022-02-20 14:29:34,328 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:29:34,328 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:34,328 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:34,345 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:34,543 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:34,543 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:34,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:34,544 INFO L85 PathProgramCache]: Analyzing trace with hash -1242204926, now seen corresponding path program 3 times [2022-02-20 14:29:34,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:34,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1815837364] [2022-02-20 14:29:34,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:34,544 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:34,566 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:34,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743052613] [2022-02-20 14:29:34,566 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:34,566 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:34,566 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:34,567 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:34,571 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:34,662 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-02-20 14:29:34,662 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:34,663 INFO L263 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 14:29:34,671 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:34,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:35,057 INFO L290 TraceCheckUtils]: 0: Hoare triple {2288#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; {2288#true} is VALID [2022-02-20 14:29:35,057 INFO L290 TraceCheckUtils]: 1: Hoare triple {2288#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; {2288#true} is VALID [2022-02-20 14:29:35,057 INFO L290 TraceCheckUtils]: 2: Hoare triple {2288#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; {2299#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:35,058 INFO L290 TraceCheckUtils]: 3: Hoare triple {2299#(not (<= ~N~0 0))} assume !(0 == assume_abort_if_not_~cond#1); {2299#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:35,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {2299#(not (<= ~N~0 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; {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:35,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} assume !!(main_~i~0#1 < ~N~0); {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:35,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:35,059 INFO L290 TraceCheckUtils]: 7: Hoare triple {2306#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (not (<= ~N~0 0)))} main_#t~post7#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {2316#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:35,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {2316#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {2316#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:35,060 INFO L290 TraceCheckUtils]: 9: Hoare triple {2316#(and (not (<= ~N~0 0)) (<= |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(6 + 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; {2316#(and (not (<= ~N~0 0)) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:35,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {2316#(and (not (<= ~N~0 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; {2326#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (not (<= ~N~0 0)))} is VALID [2022-02-20 14:29:35,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {2326#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (not (<= ~N~0 0)))} assume !(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,062 INFO L290 TraceCheckUtils]: 12: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_~i~0#1 := 0; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,062 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#(and (not (<= ~N~0 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); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,064 INFO L290 TraceCheckUtils]: 17: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,064 INFO L290 TraceCheckUtils]: 18: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,064 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,065 INFO L290 TraceCheckUtils]: 20: Hoare triple {2330#(and (not (<= ~N~0 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; {2358#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,065 INFO L290 TraceCheckUtils]: 21: Hoare triple {2358#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 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; {2362#(and (not (<= ~N~0 0)) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,066 INFO L290 TraceCheckUtils]: 22: Hoare triple {2362#(and (not (<= ~N~0 0)) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2366#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,066 INFO L290 TraceCheckUtils]: 23: Hoare triple {2366#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~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; {2370#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 24: Hoare triple {2370#(and (not (= |ULTIMATE.start_main_~i~0#1| 0)) (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~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; {2366#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 25: Hoare triple {2366#(and (not (<= ~N~0 0)) (< |ULTIMATE.start_main_~i~0#1| ~N~0) (not (= 0 (+ (- 1) |ULTIMATE.start_main_~i~0#1|))) (<= ~N~0 2))} assume !(main_~i~0#1 < ~N~0); {2289#false} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 26: Hoare triple {2289#false} main_~i~0#1 := 0; {2289#false} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 27: Hoare triple {2289#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2289#false} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 28: Hoare triple {2289#false} assume 0 == __VERIFIER_assert_~cond#1; {2289#false} is VALID [2022-02-20 14:29:35,067 INFO L290 TraceCheckUtils]: 29: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2022-02-20 14:29:35,068 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 15 proven. 5 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 14:29:35,068 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:35,466 INFO L290 TraceCheckUtils]: 29: Hoare triple {2289#false} assume !false; {2289#false} is VALID [2022-02-20 14:29:35,466 INFO L290 TraceCheckUtils]: 28: Hoare triple {2289#false} assume 0 == __VERIFIER_assert_~cond#1; {2289#false} is VALID [2022-02-20 14:29:35,466 INFO L290 TraceCheckUtils]: 27: Hoare triple {2289#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2289#false} is VALID [2022-02-20 14:29:35,467 INFO L290 TraceCheckUtils]: 26: Hoare triple {2289#false} main_~i~0#1 := 0; {2289#false} is VALID [2022-02-20 14:29:35,468 INFO L290 TraceCheckUtils]: 25: Hoare triple {2401#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {2289#false} is VALID [2022-02-20 14:29:35,469 INFO L290 TraceCheckUtils]: 24: Hoare triple {2405#(< (+ |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; {2401#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:29:35,470 INFO L290 TraceCheckUtils]: 23: Hoare triple {2409#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |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; {2405#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:35,472 INFO L290 TraceCheckUtils]: 22: Hoare triple {2413#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |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); {2409#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:35,474 INFO L290 TraceCheckUtils]: 21: Hoare triple {2417#(or (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (< (+ 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; {2413#(or (= |ULTIMATE.start_main_~i~0#1| 0) (< (+ |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:35,475 INFO L290 TraceCheckUtils]: 20: Hoare triple {2330#(and (not (<= ~N~0 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; {2417#(or (= (+ |ULTIMATE.start_main_~i~0#1| 1) 0) (< (+ 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:35,476 INFO L290 TraceCheckUtils]: 19: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,477 INFO L290 TraceCheckUtils]: 18: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,477 INFO L290 TraceCheckUtils]: 17: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,478 INFO L290 TraceCheckUtils]: 16: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,478 INFO L290 TraceCheckUtils]: 15: Hoare triple {2330#(and (not (<= ~N~0 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; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,478 INFO L290 TraceCheckUtils]: 14: Hoare triple {2330#(and (not (<= ~N~0 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); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,479 INFO L290 TraceCheckUtils]: 13: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,479 INFO L290 TraceCheckUtils]: 12: Hoare triple {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} main_~i~0#1 := 0; {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,479 INFO L290 TraceCheckUtils]: 11: Hoare triple {2448#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !(main_~i~0#1 < ~N~0); {2330#(and (not (<= ~N~0 0)) (<= ~N~0 2))} is VALID [2022-02-20 14:29:35,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {2452#(or (and (not (<= ~N~0 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; {2448#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:35,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {2452#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |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(6 + 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; {2452#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:35,481 INFO L290 TraceCheckUtils]: 8: Hoare triple {2452#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2452#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:35,481 INFO L290 TraceCheckUtils]: 7: Hoare triple {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |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; {2452#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0))} is VALID [2022-02-20 14:29:35,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:35,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:35,483 INFO L290 TraceCheckUtils]: 4: Hoare triple {2299#(not (<= ~N~0 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; {2462#(or (and (not (<= ~N~0 0)) (<= ~N~0 2)) (< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0))} is VALID [2022-02-20 14:29:35,483 INFO L290 TraceCheckUtils]: 3: Hoare triple {2299#(not (<= ~N~0 0))} assume !(0 == assume_abort_if_not_~cond#1); {2299#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:35,483 INFO L290 TraceCheckUtils]: 2: Hoare triple {2288#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; {2299#(not (<= ~N~0 0))} is VALID [2022-02-20 14:29:35,484 INFO L290 TraceCheckUtils]: 1: Hoare triple {2288#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; {2288#true} is VALID [2022-02-20 14:29:35,484 INFO L290 TraceCheckUtils]: 0: Hoare triple {2288#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; {2288#true} is VALID [2022-02-20 14:29:35,484 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:35,484 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:35,484 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1815837364] [2022-02-20 14:29:35,485 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:35,485 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743052613] [2022-02-20 14:29:35,485 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743052613] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:35,485 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:35,485 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 19 [2022-02-20 14:29:35,485 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1822588759] [2022-02-20 14:29:35,485 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:35,485 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:35,485 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:35,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:35,520 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:35,520 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-02-20 14:29:35,520 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:35,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-02-20 14:29:35,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=104, Invalid=238, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:29:35,521 INFO L87 Difference]: Start difference. First operand 55 states and 62 transitions. Second operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:36,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:36,318 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2022-02-20 14:29:36,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2022-02-20 14:29:36,319 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:29:36,319 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:36,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:36,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2022-02-20 14:29:36,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:36,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 91 transitions. [2022-02-20 14:29:36,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 19 states and 91 transitions. [2022-02-20 14:29:36,406 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 91 edges. 91 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:36,415 INFO L225 Difference]: With dead ends: 106 [2022-02-20 14:29:36,415 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 14:29:36,416 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 38 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 249 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=243, Invalid=627, Unknown=0, NotChecked=0, Total=870 [2022-02-20 14:29:36,425 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 221 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 99 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 241 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 99 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:36,426 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 61 Invalid, 241 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [99 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:29:36,427 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 14:29:36,467 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 52. [2022-02-20 14:29:36,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:36,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:36,474 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:36,487 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:36,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:36,489 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-02-20 14:29:36,489 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-02-20 14:29:36,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:36,490 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:36,491 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 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 86 states. [2022-02-20 14:29:36,491 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 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 86 states. [2022-02-20 14:29:36,492 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:36,492 INFO L93 Difference]: Finished difference Result 86 states and 91 transitions. [2022-02-20 14:29:36,492 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 91 transitions. [2022-02-20 14:29:36,493 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:36,493 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:36,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:36,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:36,493 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.1176470588235294) internal successors, (57), 51 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have 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:36,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 57 transitions. [2022-02-20 14:29:36,494 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 57 transitions. Word has length 30 [2022-02-20 14:29:36,494 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:36,494 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 57 transitions. [2022-02-20 14:29:36,494 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.1578947368421053) internal successors, (41), 19 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:36,494 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 57 transitions. [2022-02-20 14:29:36,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 14:29:36,495 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:36,495 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:29:36,517 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:36,715 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:36,715 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:36,716 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:36,716 INFO L85 PathProgramCache]: Analyzing trace with hash 939270440, now seen corresponding path program 2 times [2022-02-20 14:29:36,716 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:36,716 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [975733303] [2022-02-20 14:29:36,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:36,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:36,739 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:36,739 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1228529073] [2022-02-20 14:29:36,739 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:29:36,739 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:36,739 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:36,740 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:36,741 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:36,791 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:29:36,791 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:36,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 130 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:29:36,800 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:36,801 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:36,995 INFO L290 TraceCheckUtils]: 0: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:36,995 INFO L290 TraceCheckUtils]: 1: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:36,995 INFO L290 TraceCheckUtils]: 2: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:36,995 INFO L290 TraceCheckUtils]: 3: Hoare triple {2877#true} assume !(0 == assume_abort_if_not_~cond#1); {2877#true} is VALID [2022-02-20 14:29:36,996 INFO L290 TraceCheckUtils]: 4: Hoare triple {2877#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; {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,996 INFO L290 TraceCheckUtils]: 5: Hoare triple {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,996 INFO L290 TraceCheckUtils]: 6: Hoare triple {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,998 INFO L290 TraceCheckUtils]: 7: Hoare triple {2894#(<= 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; {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,998 INFO L290 TraceCheckUtils]: 8: Hoare triple {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,999 INFO L290 TraceCheckUtils]: 9: Hoare triple {2904#(<= 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(6 + 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; {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:36,999 INFO L290 TraceCheckUtils]: 10: Hoare triple {2904#(<= 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; {2914#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,000 INFO L290 TraceCheckUtils]: 11: Hoare triple {2914#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,000 INFO L290 TraceCheckUtils]: 12: Hoare triple {2918#(< 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(6 + 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; {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,000 INFO L290 TraceCheckUtils]: 13: Hoare triple {2918#(< 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; {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,001 INFO L290 TraceCheckUtils]: 14: Hoare triple {2918#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,001 INFO L290 TraceCheckUtils]: 15: Hoare triple {2918#(< 2 ~N~0)} main_~i~0#1 := 0; {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,001 INFO L290 TraceCheckUtils]: 16: Hoare triple {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,002 INFO L290 TraceCheckUtils]: 17: Hoare triple {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 2 ~N~0))} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,002 INFO L290 TraceCheckUtils]: 18: Hoare triple {2931#(and (<= |ULTIMATE.start_main_~i~0#1| 0) (< 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; {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,003 INFO L290 TraceCheckUtils]: 19: Hoare triple {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0); {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,004 INFO L290 TraceCheckUtils]: 20: Hoare triple {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 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; {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,004 INFO L290 TraceCheckUtils]: 21: Hoare triple {2941#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 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; {2951#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 2 ~N~0))} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 22: Hoare triple {2951#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 2 ~N~0))} assume !(main_~i~0#1 < ~N~0); {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#false} main_~i~0#1 := 0; {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#false} assume !(0 == __VERIFIER_assert_~cond#1); {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2878#false} is VALID [2022-02-20 14:29:37,005 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,006 INFO L290 TraceCheckUtils]: 29: Hoare triple {2878#false} assume 0 == __VERIFIER_assert_~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,006 INFO L290 TraceCheckUtils]: 30: Hoare triple {2878#false} assume !false; {2878#false} is VALID [2022-02-20 14:29:37,006 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:29:37,006 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:37,177 INFO L290 TraceCheckUtils]: 30: Hoare triple {2878#false} assume !false; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 29: Hoare triple {2878#false} assume 0 == __VERIFIER_assert_~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 28: Hoare triple {2878#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 27: Hoare triple {2878#false} main_#t~post12#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post12#1;havoc main_#t~post12#1; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 26: Hoare triple {2878#false} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 25: Hoare triple {2878#false} assume !(0 == __VERIFIER_assert_~cond#1); {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 24: Hoare triple {2878#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2878#false} is VALID [2022-02-20 14:29:37,178 INFO L290 TraceCheckUtils]: 23: Hoare triple {2878#false} main_~i~0#1 := 0; {2878#false} is VALID [2022-02-20 14:29:37,179 INFO L290 TraceCheckUtils]: 22: Hoare triple {3003#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {2878#false} is VALID [2022-02-20 14:29:37,180 INFO L290 TraceCheckUtils]: 21: Hoare triple {3007#(< (+ |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; {3003#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:29:37,180 INFO L290 TraceCheckUtils]: 20: Hoare triple {3007#(< (+ |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; {3007#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:37,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {3007#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0); {3007#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:37,181 INFO L290 TraceCheckUtils]: 18: Hoare triple {3017#(< (+ 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; {3007#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:29:37,182 INFO L290 TraceCheckUtils]: 17: Hoare triple {3017#(< (+ 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); {3017#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:29:37,182 INFO L290 TraceCheckUtils]: 16: Hoare triple {3017#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} assume !!(main_~i~0#1 < ~N~0); {3017#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:29:37,182 INFO L290 TraceCheckUtils]: 15: Hoare triple {2918#(< 2 ~N~0)} main_~i~0#1 := 0; {3017#(< (+ 2 |ULTIMATE.start_main_~i~0#1|) ~N~0)} is VALID [2022-02-20 14:29:37,183 INFO L290 TraceCheckUtils]: 14: Hoare triple {2918#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,183 INFO L290 TraceCheckUtils]: 13: Hoare triple {2918#(< 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; {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,183 INFO L290 TraceCheckUtils]: 12: Hoare triple {2918#(< 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(6 + 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; {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,184 INFO L290 TraceCheckUtils]: 11: Hoare triple {2914#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2918#(< 2 ~N~0)} is VALID [2022-02-20 14:29:37,185 INFO L290 TraceCheckUtils]: 10: Hoare triple {2904#(<= 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; {2914#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {2904#(<= 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(6 + 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; {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,186 INFO L290 TraceCheckUtils]: 8: Hoare triple {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,186 INFO L290 TraceCheckUtils]: 7: Hoare triple {2894#(<= 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; {2904#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,187 INFO L290 TraceCheckUtils]: 6: Hoare triple {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,187 INFO L290 TraceCheckUtils]: 5: Hoare triple {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0); {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,188 INFO L290 TraceCheckUtils]: 4: Hoare triple {2877#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; {2894#(<= 0 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:29:37,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {2877#true} assume !(0 == assume_abort_if_not_~cond#1); {2877#true} is VALID [2022-02-20 14:29:37,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:37,188 INFO L290 TraceCheckUtils]: 1: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:37,188 INFO L290 TraceCheckUtils]: 0: Hoare triple {2877#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; {2877#true} is VALID [2022-02-20 14:29:37,189 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 5 proven. 12 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:29:37,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:37,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [975733303] [2022-02-20 14:29:37,189 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:37,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1228529073] [2022-02-20 14:29:37,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1228529073] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:37,190 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:37,190 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:29:37,190 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [211207673] [2022-02-20 14:29:37,190 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:37,191 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:29:37,191 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:37,191 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:37,221 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:37,222 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:29:37,222 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:37,222 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:29:37,222 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:37,223 INFO L87 Difference]: Start difference. First operand 52 states and 57 transitions. Second operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:37,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:37,743 INFO L93 Difference]: Finished difference Result 84 states and 89 transitions. [2022-02-20 14:29:37,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 14:29:37,743 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2022-02-20 14:29:37,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:37,744 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:37,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:37,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 82 transitions. [2022-02-20 14:29:37,745 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 82 transitions. [2022-02-20 14:29:37,815 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:37,817 INFO L225 Difference]: With dead ends: 84 [2022-02-20 14:29:37,817 INFO L226 Difference]: Without dead ends: 75 [2022-02-20 14:29:37,817 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:29:37,818 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 111 mSDsluCounter, 56 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 85 SdHoareTripleChecker+Invalid, 196 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:37,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 85 Invalid, 196 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:29:37,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-20 14:29:37,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 52. [2022-02-20 14:29:37,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:37,858 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:37,858 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:37,858 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:37,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:37,860 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-20 14:29:37,860 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-20 14:29:37,860 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:37,860 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:37,861 INFO L74 IsIncluded]: Start isIncluded. First operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:29:37,861 INFO L87 Difference]: Start difference. First operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 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 75 states. [2022-02-20 14:29:37,862 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:37,862 INFO L93 Difference]: Finished difference Result 75 states and 79 transitions. [2022-02-20 14:29:37,862 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 79 transitions. [2022-02-20 14:29:37,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:37,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:37,862 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:37,862 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:37,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 52 states, 51 states have (on average 1.0980392156862746) internal successors, (56), 51 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have 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:37,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 52 states to 52 states and 56 transitions. [2022-02-20 14:29:37,868 INFO L78 Accepts]: Start accepts. Automaton has 52 states and 56 transitions. Word has length 31 [2022-02-20 14:29:37,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:37,868 INFO L470 AbstractCegarLoop]: Abstraction has 52 states and 56 transitions. [2022-02-20 14:29:37,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.1666666666666665) internal successors, (38), 12 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have 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:37,868 INFO L276 IsEmpty]: Start isEmpty. Operand 52 states and 56 transitions. [2022-02-20 14:29:37,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 14:29:37,869 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:37,869 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:37,886 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:38,069 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:38,069 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:38,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:38,070 INFO L85 PathProgramCache]: Analyzing trace with hash 877615566, now seen corresponding path program 3 times [2022-02-20 14:29:38,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:38,070 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [506276528] [2022-02-20 14:29:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:38,090 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:38,090 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1819244702] [2022-02-20 14:29:38,090 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:29:38,090 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:38,090 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:38,091 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:38,092 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:38,211 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:29:38,211 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:38,212 INFO L263 TraceCheckSpWp]: Trace formula consists of 133 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:29:38,221 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:38,222 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:38,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {3408#true} assume !(0 == assume_abort_if_not_~cond#1); {3408#true} is VALID [2022-02-20 14:29:38,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {3408#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; {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {3425#(<= |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; {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,438 INFO L290 TraceCheckUtils]: 8: Hoare triple {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {3435#(<= |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(6 + 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; {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,439 INFO L290 TraceCheckUtils]: 10: Hoare triple {3435#(<= |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; {3445#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:38,439 INFO L290 TraceCheckUtils]: 11: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,439 INFO L290 TraceCheckUtils]: 12: Hoare triple {3449#(<= ~N~0 2)} main_~i~0#1 := 0; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,440 INFO L290 TraceCheckUtils]: 13: Hoare triple {3449#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,440 INFO L290 TraceCheckUtils]: 14: Hoare triple {3449#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,440 INFO L290 TraceCheckUtils]: 15: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,440 INFO L290 TraceCheckUtils]: 16: Hoare triple {3449#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,441 INFO L290 TraceCheckUtils]: 17: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,441 INFO L290 TraceCheckUtils]: 18: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,441 INFO L290 TraceCheckUtils]: 19: Hoare triple {3449#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,442 INFO L290 TraceCheckUtils]: 20: Hoare triple {3449#(<= ~N~0 2)} main_~i~0#1 := 0; {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,442 INFO L290 TraceCheckUtils]: 21: Hoare triple {3477#(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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,443 INFO L290 TraceCheckUtils]: 22: Hoare triple {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,443 INFO L290 TraceCheckUtils]: 23: Hoare triple {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3477#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,444 INFO L290 TraceCheckUtils]: 24: Hoare triple {3477#(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; {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,444 INFO L290 TraceCheckUtils]: 25: Hoare triple {3490#(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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,445 INFO L290 TraceCheckUtils]: 26: Hoare triple {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3490#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,446 INFO L290 TraceCheckUtils]: 28: Hoare triple {3490#(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; {3503#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:29:38,447 INFO L290 TraceCheckUtils]: 29: Hoare triple {3503#(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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3409#false} is VALID [2022-02-20 14:29:38,447 INFO L290 TraceCheckUtils]: 30: Hoare triple {3409#false} assume 0 == __VERIFIER_assert_~cond#1; {3409#false} is VALID [2022-02-20 14:29:38,447 INFO L290 TraceCheckUtils]: 31: Hoare triple {3409#false} assume !false; {3409#false} is VALID [2022-02-20 14:29:38,447 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:38,447 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:38,618 INFO L290 TraceCheckUtils]: 31: Hoare triple {3409#false} assume !false; {3409#false} is VALID [2022-02-20 14:29:38,618 INFO L290 TraceCheckUtils]: 30: Hoare triple {3409#false} assume 0 == __VERIFIER_assert_~cond#1; {3409#false} is VALID [2022-02-20 14:29:38,618 INFO L290 TraceCheckUtils]: 29: Hoare triple {3519#(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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3409#false} is VALID [2022-02-20 14:29:38,619 INFO L290 TraceCheckUtils]: 28: Hoare triple {3523#(<= ~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; {3519#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:38,620 INFO L290 TraceCheckUtils]: 27: Hoare triple {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:38,620 INFO L290 TraceCheckUtils]: 26: Hoare triple {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:38,622 INFO L290 TraceCheckUtils]: 25: Hoare triple {3523#(<= ~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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:38,631 INFO L290 TraceCheckUtils]: 24: Hoare triple {3536#(<= ~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; {3523#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:38,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:38,633 INFO L290 TraceCheckUtils]: 22: Hoare triple {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:38,633 INFO L290 TraceCheckUtils]: 21: Hoare triple {3536#(<= ~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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:38,633 INFO L290 TraceCheckUtils]: 20: Hoare triple {3449#(<= ~N~0 2)} main_~i~0#1 := 0; {3536#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:38,634 INFO L290 TraceCheckUtils]: 19: Hoare triple {3449#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,634 INFO L290 TraceCheckUtils]: 18: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {3449#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {3449#(<= ~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; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,635 INFO L290 TraceCheckUtils]: 14: Hoare triple {3449#(<= ~N~0 2)} assume 0 == main_~i~0#1;call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,635 INFO L290 TraceCheckUtils]: 13: Hoare triple {3449#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,636 INFO L290 TraceCheckUtils]: 12: Hoare triple {3449#(<= ~N~0 2)} main_~i~0#1 := 0; {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,636 INFO L290 TraceCheckUtils]: 11: Hoare triple {3445#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3449#(<= ~N~0 2)} is VALID [2022-02-20 14:29:38,637 INFO L290 TraceCheckUtils]: 10: Hoare triple {3435#(<= |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; {3445#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:38,637 INFO L290 TraceCheckUtils]: 9: Hoare triple {3435#(<= |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(6 + 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; {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,637 INFO L290 TraceCheckUtils]: 8: Hoare triple {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,638 INFO L290 TraceCheckUtils]: 7: Hoare triple {3425#(<= |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; {3435#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:38,638 INFO L290 TraceCheckUtils]: 6: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,638 INFO L290 TraceCheckUtils]: 5: Hoare triple {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {3408#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; {3425#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:38,639 INFO L290 TraceCheckUtils]: 3: Hoare triple {3408#true} assume !(0 == assume_abort_if_not_~cond#1); {3408#true} is VALID [2022-02-20 14:29:38,639 INFO L290 TraceCheckUtils]: 2: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,639 INFO L290 TraceCheckUtils]: 1: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {3408#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; {3408#true} is VALID [2022-02-20 14:29:38,639 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:38,639 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:38,639 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [506276528] [2022-02-20 14:29:38,639 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:38,640 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1819244702] [2022-02-20 14:29:38,640 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1819244702] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:38,640 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:38,640 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:29:38,640 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1255409441] [2022-02-20 14:29:38,640 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:38,640 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:38,640 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:38,640 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:38,675 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:38,675 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:29:38,675 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:38,675 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:29:38,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:29:38,676 INFO L87 Difference]: Start difference. First operand 52 states and 56 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:39,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:39,092 INFO L93 Difference]: Finished difference Result 83 states and 87 transitions. [2022-02-20 14:29:39,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:29:39,092 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:39,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:39,092 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:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-02-20 14:29:39,093 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:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 82 transitions. [2022-02-20 14:29:39,094 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 82 transitions. [2022-02-20 14:29:39,150 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:39,150 INFO L225 Difference]: With dead ends: 83 [2022-02-20 14:29:39,150 INFO L226 Difference]: Without dead ends: 59 [2022-02-20 14:29:39,151 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:39,151 INFO L933 BasicCegarLoop]: 13 mSDtfsCounter, 97 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:39,151 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 47 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 98 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:29:39,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2022-02-20 14:29:39,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 39. [2022-02-20 14:29:39,181 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:39,181 INFO L82 GeneralOperation]: Start isEquivalent. First operand 59 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:39,181 INFO L74 IsIncluded]: Start isIncluded. First operand 59 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:39,181 INFO L87 Difference]: Start difference. First operand 59 states. Second operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:39,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:39,182 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-02-20 14:29:39,182 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-02-20 14:29:39,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:39,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:39,182 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:29:39,183 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 59 states. [2022-02-20 14:29:39,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:39,183 INFO L93 Difference]: Finished difference Result 59 states and 62 transitions. [2022-02-20 14:29:39,183 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 62 transitions. [2022-02-20 14:29:39,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:39,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:39,183 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:39,184 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:39,184 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.105263157894737) internal successors, (42), 38 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:29:39,184 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 42 transitions. [2022-02-20 14:29:39,184 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 42 transitions. Word has length 32 [2022-02-20 14:29:39,184 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:39,184 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 42 transitions. [2022-02-20 14:29:39,184 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:39,184 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 42 transitions. [2022-02-20 14:29:39,185 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 14:29:39,185 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:39,185 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:39,202 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:39,394 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:39,394 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:39,394 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:39,394 INFO L85 PathProgramCache]: Analyzing trace with hash -1847758638, now seen corresponding path program 4 times [2022-02-20 14:29:39,394 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:39,394 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1992801437] [2022-02-20 14:29:39,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:39,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:39,430 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:39,430 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1806271170] [2022-02-20 14:29:39,430 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:29:39,430 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:39,431 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:39,436 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:39,437 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:39,483 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:29:39,484 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:39,484 INFO L263 TraceCheckSpWp]: Trace formula consists of 71 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 14:29:39,494 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:39,494 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:39,710 INFO L290 TraceCheckUtils]: 0: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,710 INFO L290 TraceCheckUtils]: 1: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,710 INFO L290 TraceCheckUtils]: 2: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,710 INFO L290 TraceCheckUtils]: 3: Hoare triple {3888#true} assume !(0 == assume_abort_if_not_~cond#1); {3888#true} is VALID [2022-02-20 14:29:39,710 INFO L290 TraceCheckUtils]: 4: Hoare triple {3888#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; {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,711 INFO L290 TraceCheckUtils]: 5: Hoare triple {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,711 INFO L290 TraceCheckUtils]: 6: Hoare triple {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,712 INFO L290 TraceCheckUtils]: 7: Hoare triple {3905#(<= |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; {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {3915#(<= |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(6 + 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; {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,713 INFO L290 TraceCheckUtils]: 10: Hoare triple {3915#(<= |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; {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,713 INFO L290 TraceCheckUtils]: 11: Hoare triple {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {3925#(<= |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(6 + 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; {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,714 INFO L290 TraceCheckUtils]: 13: Hoare triple {3925#(<= |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; {3935#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:39,714 INFO L290 TraceCheckUtils]: 14: Hoare triple {3935#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3939#(<= ~N~0 3)} is VALID [2022-02-20 14:29:39,714 INFO L290 TraceCheckUtils]: 15: Hoare triple {3939#(<= ~N~0 3)} main_~i~0#1 := 0; {3943#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,715 INFO L290 TraceCheckUtils]: 16: Hoare triple {3943#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3943#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,715 INFO L290 TraceCheckUtils]: 17: Hoare triple {3943#(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); {3943#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,716 INFO L290 TraceCheckUtils]: 18: Hoare triple {3943#(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; {3953#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,716 INFO L290 TraceCheckUtils]: 19: Hoare triple {3953#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3953#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,717 INFO L290 TraceCheckUtils]: 20: Hoare triple {3953#(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; {3953#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,717 INFO L290 TraceCheckUtils]: 21: Hoare triple {3953#(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; {3963#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,717 INFO L290 TraceCheckUtils]: 22: Hoare triple {3963#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3963#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,718 INFO L290 TraceCheckUtils]: 23: Hoare triple {3963#(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; {3963#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,718 INFO L290 TraceCheckUtils]: 24: Hoare triple {3963#(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; {3973#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:29:39,719 INFO L290 TraceCheckUtils]: 25: Hoare triple {3973#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0); {3889#false} is VALID [2022-02-20 14:29:39,719 INFO L290 TraceCheckUtils]: 26: Hoare triple {3889#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; {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 27: Hoare triple {3889#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 28: Hoare triple {3889#false} assume !(main_~i~0#1 < ~N~0); {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 29: Hoare triple {3889#false} main_~i~0#1 := 0; {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 30: Hoare triple {3889#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 31: Hoare triple {3889#false} assume 0 == __VERIFIER_assert_~cond#1; {3889#false} is VALID [2022-02-20 14:29:39,720 INFO L290 TraceCheckUtils]: 32: Hoare triple {3889#false} assume !false; {3889#false} is VALID [2022-02-20 14:29:39,720 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:39,720 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 32: Hoare triple {3889#false} assume !false; {3889#false} is VALID [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 31: Hoare triple {3889#false} assume 0 == __VERIFIER_assert_~cond#1; {3889#false} is VALID [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 30: Hoare triple {3889#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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3889#false} is VALID [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 29: Hoare triple {3889#false} main_~i~0#1 := 0; {3889#false} is VALID [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 28: Hoare triple {3889#false} assume !(main_~i~0#1 < ~N~0); {3889#false} is VALID [2022-02-20 14:29:39,892 INFO L290 TraceCheckUtils]: 27: Hoare triple {3889#false} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {3889#false} is VALID [2022-02-20 14:29:39,893 INFO L290 TraceCheckUtils]: 26: Hoare triple {3889#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; {3889#false} is VALID [2022-02-20 14:29:39,893 INFO L290 TraceCheckUtils]: 25: Hoare triple {4019#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0); {3889#false} is VALID [2022-02-20 14:29:39,894 INFO L290 TraceCheckUtils]: 24: Hoare triple {4023#(<= ~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; {4019#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:29:39,894 INFO L290 TraceCheckUtils]: 23: Hoare triple {4023#(<= ~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; {4023#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:39,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {4023#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0); {4023#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:39,904 INFO L290 TraceCheckUtils]: 21: Hoare triple {4033#(<= ~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; {4023#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:29:39,904 INFO L290 TraceCheckUtils]: 20: Hoare triple {4033#(<= ~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; {4033#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,904 INFO L290 TraceCheckUtils]: 19: Hoare triple {4033#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {4033#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,905 INFO L290 TraceCheckUtils]: 18: Hoare triple {4043#(<= ~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; {4033#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,905 INFO L290 TraceCheckUtils]: 17: Hoare triple {4043#(<= ~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); {4043#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,905 INFO L290 TraceCheckUtils]: 16: Hoare triple {4043#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0); {4043#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,906 INFO L290 TraceCheckUtils]: 15: Hoare triple {3939#(<= ~N~0 3)} main_~i~0#1 := 0; {4043#(<= ~N~0 (+ 3 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:29:39,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {3935#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {3939#(<= ~N~0 3)} is VALID [2022-02-20 14:29:39,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {3925#(<= |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; {3935#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:29:39,907 INFO L290 TraceCheckUtils]: 12: Hoare triple {3925#(<= |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(6 + 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; {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0); {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,908 INFO L290 TraceCheckUtils]: 10: Hoare triple {3915#(<= |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; {3925#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:29:39,908 INFO L290 TraceCheckUtils]: 9: Hoare triple {3915#(<= |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(6 + 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; {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,908 INFO L290 TraceCheckUtils]: 8: Hoare triple {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0); {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,909 INFO L290 TraceCheckUtils]: 7: Hoare triple {3905#(<= |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; {3915#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:29:39,909 INFO L290 TraceCheckUtils]: 6: Hoare triple {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == main_~i~0#1;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,909 INFO L290 TraceCheckUtils]: 5: Hoare triple {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!(main_~i~0#1 < ~N~0); {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,910 INFO L290 TraceCheckUtils]: 4: Hoare triple {3888#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; {3905#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 14:29:39,910 INFO L290 TraceCheckUtils]: 3: Hoare triple {3888#true} assume !(0 == assume_abort_if_not_~cond#1); {3888#true} is VALID [2022-02-20 14:29:39,910 INFO L290 TraceCheckUtils]: 2: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,910 INFO L290 TraceCheckUtils]: 1: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,910 INFO L290 TraceCheckUtils]: 0: Hoare triple {3888#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; {3888#true} is VALID [2022-02-20 14:29:39,910 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:39,910 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:29:39,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1992801437] [2022-02-20 14:29:39,910 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:29:39,910 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1806271170] [2022-02-20 14:29:39,910 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1806271170] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:29:39,910 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:29:39,910 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-02-20 14:29:39,911 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774268543] [2022-02-20 14:29:39,911 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:29:39,911 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:39,911 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:29:39,911 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:39,942 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:39,942 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:29:39,942 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:29:39,942 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:29:39,942 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:29:39,943 INFO L87 Difference]: Start difference. First operand 39 states and 42 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:40,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:40,484 INFO L93 Difference]: Finished difference Result 107 states and 113 transitions. [2022-02-20 14:29:40,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-02-20 14:29:40,484 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:40,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:29:40,484 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:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-02-20 14:29:40,485 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:40,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 113 transitions. [2022-02-20 14:29:40,486 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 13 states and 113 transitions. [2022-02-20 14:29:40,571 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 113 edges. 113 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:29:40,572 INFO L225 Difference]: With dead ends: 107 [2022-02-20 14:29:40,572 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 14:29:40,573 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 51 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 64 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=110, Invalid=270, Unknown=0, NotChecked=0, Total=380 [2022-02-20 14:29:40,573 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 141 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 66 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 66 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:29:40,573 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 78 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [66 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:29:40,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 14:29:40,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 61. [2022-02-20 14:29:40,629 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:29:40,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40,629 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40,629 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:40,630 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 14:29:40,630 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-20 14:29:40,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:40,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:40,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 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 94 states. [2022-02-20 14:29:40,639 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 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 94 states. [2022-02-20 14:29:40,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:29:40,640 INFO L93 Difference]: Finished difference Result 94 states and 97 transitions. [2022-02-20 14:29:40,640 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 97 transitions. [2022-02-20 14:29:40,640 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:29:40,640 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:29:40,640 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:29:40,640 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:29:40,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.1) internal successors, (66), 60 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have 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:40,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 66 transitions. [2022-02-20 14:29:40,641 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 66 transitions. Word has length 33 [2022-02-20 14:29:40,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:29:40,642 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 66 transitions. [2022-02-20 14:29:40,642 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:40,642 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 66 transitions. [2022-02-20 14:29:40,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 14:29:40,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:29:40,642 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:40,663 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:29:40,857 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:29:40,858 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:29:40,858 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:29:40,858 INFO L85 PathProgramCache]: Analyzing trace with hash -1646708229, now seen corresponding path program 4 times [2022-02-20 14:29:40,858 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:29:40,858 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [73004476] [2022-02-20 14:29:40,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:29:40,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:29:40,875 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:29:40,876 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [715175019] [2022-02-20 14:29:40,876 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:29:40,876 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:29:40,876 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:29:40,877 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:29:40,878 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:29:41,038 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:29:41,039 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:29:41,040 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 14:29:41,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:29:41,060 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:29:41,079 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:41,111 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:41,208 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:41,215 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,217 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,217 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:41,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,261 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,263 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:41,327 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,327 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:41,421 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:41,548 INFO L356 Elim1Store]: treesize reduction 23, result has 17.9 percent of original size [2022-02-20 14:29:41,548 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:41,556 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:29:41,557 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,558 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,559 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,562 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,564 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:41,808 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,809 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,810 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:29:41,812 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:29:41,813 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 44 [2022-02-20 14:29:42,153 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:29:42,154 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:42,194 INFO L290 TraceCheckUtils]: 0: Hoare triple {4506#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; {4506#true} is VALID [2022-02-20 14:29:42,194 INFO L290 TraceCheckUtils]: 1: Hoare triple {4506#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; {4506#true} is VALID [2022-02-20 14:29:42,194 INFO L290 TraceCheckUtils]: 2: Hoare triple {4506#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; {4506#true} is VALID [2022-02-20 14:29:42,194 INFO L290 TraceCheckUtils]: 3: Hoare triple {4506#true} assume !(0 == assume_abort_if_not_~cond#1); {4506#true} is VALID [2022-02-20 14:29:42,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {4506#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; {4523#(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:42,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {4523#(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); {4523#(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:42,196 INFO L290 TraceCheckUtils]: 6: Hoare triple {4523#(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(6, main_~a~0#1.base, main_~a~0#1.offset, 8); {4530#(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|) 6) (= |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:42,196 INFO L290 TraceCheckUtils]: 7: Hoare triple {4530#(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|) 6) (= |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; {4534#(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|) 6) (= |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:42,197 INFO L290 TraceCheckUtils]: 8: Hoare triple {4534#(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|) 6) (= |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); {4534#(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|) 6) (= |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:42,197 INFO L290 TraceCheckUtils]: 9: Hoare triple {4534#(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|) 6) (= |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(6 + 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; {4534#(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|) 6) (= |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:42,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {4534#(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|) 6) (= |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; {4544#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 6) (= |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:42,198 INFO L290 TraceCheckUtils]: 11: Hoare triple {4544#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 6) (= |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); {4544#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 6) (= |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:42,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {4544#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= 2 |ULTIMATE.start_main_~i~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) |ULTIMATE.start_main_~a~0#1.offset|) 6) (= |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(6 + 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; {4551#(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|) 6) (= |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:42,199 INFO L290 TraceCheckUtils]: 13: Hoare triple {4551#(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|) 6) (= |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; {4551#(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|) 6) (= |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:42,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {4551#(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|) 6) (= |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); {4551#(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|) 6) (= |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:42,200 INFO L290 TraceCheckUtils]: 15: Hoare triple {4551#(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|) 6) (= |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; {4530#(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|) 6) (= |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:42,210 INFO L290 TraceCheckUtils]: 16: Hoare triple {4530#(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|) 6) (= |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); {4530#(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|) 6) (= |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:42,211 INFO L290 TraceCheckUtils]: 17: Hoare triple {4530#(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|) 6) (= |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); {4567#(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|) 6) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,211 INFO L290 TraceCheckUtils]: 18: Hoare triple {4567#(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|) 6) (= |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; {4571#(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|) 6) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,212 INFO L290 TraceCheckUtils]: 19: Hoare triple {4571#(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|) 6) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !!(main_~i~0#1 < ~N~0); {4571#(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|) 6) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,213 INFO L290 TraceCheckUtils]: 20: Hoare triple {4571#(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|) 6) (= |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; {4578#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |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) (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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} is VALID [2022-02-20 14:29:42,214 INFO L290 TraceCheckUtils]: 21: Hoare triple {4578#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |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) (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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} main_#t~post9#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post9#1;havoc main_#t~post9#1; {4582#(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)))) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} is VALID [2022-02-20 14:29:42,215 INFO L290 TraceCheckUtils]: 22: Hoare triple {4582#(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)))) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} assume !!(main_~i~0#1 < ~N~0); {4582#(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)))) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} is VALID [2022-02-20 14:29:42,216 INFO L290 TraceCheckUtils]: 23: Hoare triple {4582#(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)))) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 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; {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,217 INFO L290 TraceCheckUtils]: 24: Hoare triple {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |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; {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,217 INFO L290 TraceCheckUtils]: 25: Hoare triple {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(main_~i~0#1 < ~N~0); {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,218 INFO L290 TraceCheckUtils]: 26: Hoare triple {4589#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} main_~i~0#1 := 0; {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,219 INFO L290 TraceCheckUtils]: 27: Hoare triple {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,220 INFO L290 TraceCheckUtils]: 28: Hoare triple {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume !(0 == __VERIFIER_assert_~cond#1); {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,220 INFO L290 TraceCheckUtils]: 29: Hoare triple {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem13#1; {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |ULTIMATE.start_main_~b~0#1.offset| 0))} is VALID [2022-02-20 14:29:42,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {4599#(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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))) (= |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; {4578#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |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) (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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 0)))))} is VALID [2022-02-20 14:29:42,222 INFO L290 TraceCheckUtils]: 31: Hoare triple {4578#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |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) (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)) (= 6 (select (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) 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 + (3 * main_~i~0#1 * main_~i~0#1 + 3 * main_~i~0#1) then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4615#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:29:42,222 INFO L290 TraceCheckUtils]: 32: Hoare triple {4615#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {4507#false} is VALID [2022-02-20 14:29:42,222 INFO L290 TraceCheckUtils]: 33: Hoare triple {4507#false} assume !false; {4507#false} is VALID [2022-02-20 14:29:42,223 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:42,224 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:29:44,774 INFO L356 Elim1Store]: treesize reduction 113, result has 35.4 percent of original size [2022-02-20 14:29:44,774 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 3 case distinctions, treesize of input 1170 treesize of output 751 [2022-02-20 14:29:44,793 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:29:44,793 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 791 treesize of output 753