./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/pcompf.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/pcompf.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 f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:31:23,301 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:31:23,302 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:31:23,320 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:31:23,321 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:31:23,321 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:31:23,322 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:31:23,323 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:31:23,324 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:31:23,325 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:31:23,325 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:31:23,326 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:31:23,326 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:31:23,327 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:31:23,328 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:31:23,328 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:31:23,329 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:31:23,329 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:31:23,330 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:31:23,332 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:31:23,332 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:31:23,333 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:31:23,334 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:31:23,335 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:31:23,336 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:31:23,336 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:31:23,337 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:31:23,337 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:31:23,338 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:31:23,338 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:31:23,338 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:31:23,339 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:31:23,339 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:31:23,340 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:31:23,341 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:31:23,341 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:31:23,341 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:31:23,341 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:31:23,342 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:31:23,342 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:31:23,343 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:31:23,344 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:31:23,364 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:31:23,365 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:31:23,365 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:31:23,365 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:31:23,366 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:31:23,366 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:31:23,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:31:23,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:31:23,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:31:23,367 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:31:23,368 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:31:23,368 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:31:23,369 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:31:23,369 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:31:23,370 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:31:23,370 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:31:23,370 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:31:23,370 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:31:23,370 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 -> f995d1a14a0e61f10b2f5817b1ff2bf8d1511dbe7297ad48450a11ed6f3a9160 [2022-02-20 14:31:23,592 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:31:23,611 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:31:23,614 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:31:23,615 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:31:23,616 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:31:23,617 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/pcompf.c [2022-02-20 14:31:23,670 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69dbbc6/aa390ebb3093496885c1ab7f76561d9f/FLAG90b382b2c [2022-02-20 14:31:24,003 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:31:24,004 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/pcompf.c [2022-02-20 14:31:24,008 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69dbbc6/aa390ebb3093496885c1ab7f76561d9f/FLAG90b382b2c [2022-02-20 14:31:24,016 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/3a69dbbc6/aa390ebb3093496885c1ab7f76561d9f [2022-02-20 14:31:24,018 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:31:24,019 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:31:24,020 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:31:24,021 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:31:24,023 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:31:24,023 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,024 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46570e69 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24, skipping insertion in model container [2022-02-20 14:31:24,024 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,029 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:31:24,038 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:31:24,178 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/pcompf.c[589,602] [2022-02-20 14:31:24,200 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:31:24,207 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:31:24,236 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/pcompf.c[589,602] [2022-02-20 14:31:24,254 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:31:24,266 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:31:24,267 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24 WrapperNode [2022-02-20 14:31:24,267 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:31:24,268 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:31:24,268 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:31:24,269 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:31:24,274 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:31:24" (1/1) ... [2022-02-20 14:31:24,285 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:31:24" (1/1) ... [2022-02-20 14:31:24,314 INFO L137 Inliner]: procedures = 16, calls = 24, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 89 [2022-02-20 14:31:24,314 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:31:24,315 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:31:24,315 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:31:24,315 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:31:24,320 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,321 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,324 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,325 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,341 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,346 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,348 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,353 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:31:24,355 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:31:24,356 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:31:24,356 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:31:24,357 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (1/1) ... [2022-02-20 14:31:24,362 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:31:24,372 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:24,401 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:31:24,423 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:31:24,452 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:31:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:31:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:31:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 14:31:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:31:24,453 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:31:24,453 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:31:24,519 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:31:24,523 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:31:24,770 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:31:24,774 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:31:24,775 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:31:24,776 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:31:24 BoogieIcfgContainer [2022-02-20 14:31:24,776 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:31:24,777 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:31:24,777 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:31:24,780 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:31:24,780 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:31:24" (1/3) ... [2022-02-20 14:31:24,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63756577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:31:24, skipping insertion in model container [2022-02-20 14:31:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:31:24" (2/3) ... [2022-02-20 14:31:24,781 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@63756577 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:31:24, skipping insertion in model container [2022-02-20 14:31:24,781 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:31:24" (3/3) ... [2022-02-20 14:31:24,782 INFO L111 eAbstractionObserver]: Analyzing ICFG pcompf.c [2022-02-20 14:31:24,786 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:31:24,786 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:31:24,817 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:31:24,821 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:31:24,821 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:31:24,832 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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:31:24,836 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:31:24,836 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:24,836 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:24,837 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:24,840 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:24,841 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-02-20 14:31:24,847 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:24,847 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [671528992] [2022-02-20 14:31:24,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:24,848 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:24,950 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:24,998 INFO L290 TraceCheckUtils]: 0: Hoare triple {27#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; {27#true} is VALID [2022-02-20 14:31:24,999 INFO L290 TraceCheckUtils]: 1: Hoare triple {27#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {27#true} is VALID [2022-02-20 14:31:24,999 INFO L290 TraceCheckUtils]: 2: Hoare triple {27#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; {27#true} is VALID [2022-02-20 14:31:25,000 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {28#false} is VALID [2022-02-20 14:31:25,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {28#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {28#false} is VALID [2022-02-20 14:31:25,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {28#false} assume !(main_~i~0#1 < ~N~0); {28#false} is VALID [2022-02-20 14:31:25,001 INFO L290 TraceCheckUtils]: 6: Hoare triple {28#false} main_~i~0#1 := 1; {28#false} is VALID [2022-02-20 14:31:25,001 INFO L290 TraceCheckUtils]: 7: Hoare triple {28#false} assume !(main_~i~0#1 < ~N~0); {28#false} is VALID [2022-02-20 14:31:25,001 INFO L290 TraceCheckUtils]: 8: Hoare triple {28#false} main_~i~0#1 := 1; {28#false} is VALID [2022-02-20 14:31:25,002 INFO L290 TraceCheckUtils]: 9: Hoare triple {28#false} assume !(main_~i~0#1 < ~N~0); {28#false} is VALID [2022-02-20 14:31:25,002 INFO L290 TraceCheckUtils]: 10: Hoare triple {28#false} main_~i~0#1 := 0; {28#false} is VALID [2022-02-20 14:31:25,002 INFO L290 TraceCheckUtils]: 11: Hoare triple {28#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {28#false} is VALID [2022-02-20 14:31:25,002 INFO L290 TraceCheckUtils]: 12: Hoare triple {28#false} assume 0 == __VERIFIER_assert_~cond#1; {28#false} is VALID [2022-02-20 14:31:25,003 INFO L290 TraceCheckUtils]: 13: Hoare triple {28#false} assume !false; {28#false} is VALID [2022-02-20 14:31:25,004 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:31:25,004 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:25,005 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [671528992] [2022-02-20 14:31:25,005 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [671528992] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:31:25,005 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:31:25,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:31:25,008 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1910536137] [2022-02-20 14:31:25,009 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:31:25,012 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:31:25,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:25,015 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:25,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:25,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:31:25,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:25,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:31:25,055 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:31:25,057 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 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) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:25,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:25,092 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-02-20 14:31:25,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:31:25,092 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:31:25,092 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:25,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:25,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 14:31:25,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:25,104 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 62 transitions. [2022-02-20 14:31:25,104 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 62 transitions. [2022-02-20 14:31:25,179 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:25,189 INFO L225 Difference]: With dead ends: 44 [2022-02-20 14:31:25,190 INFO L226 Difference]: Without dead ends: 20 [2022-02-20 14:31:25,192 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:31:25,197 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:31:25,198 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:31:25,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-02-20 14:31:25,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-02-20 14:31:25,219 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:25,220 INFO L82 GeneralOperation]: Start isEquivalent. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:31:25,220 INFO L74 IsIncluded]: Start isIncluded. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:31:25,221 INFO L87 Difference]: Start difference. First operand 20 states. Second operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:31:25,223 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:25,223 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 14:31:25,223 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 14:31:25,224 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:25,224 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:25,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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 20 states. [2022-02-20 14:31:25,226 INFO L87 Difference]: Start difference. First operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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 20 states. [2022-02-20 14:31:25,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:25,228 INFO L93 Difference]: Finished difference Result 20 states and 23 transitions. [2022-02-20 14:31:25,228 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 14:31:25,229 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:25,229 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:25,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:25,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:25,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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:31:25,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-02-20 14:31:25,231 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-02-20 14:31:25,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:25,231 INFO L470 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-02-20 14:31:25,232 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:25,232 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-02-20 14:31:25,232 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 14:31:25,233 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:25,234 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:25,235 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:31:25,236 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:25,238 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:25,238 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-02-20 14:31:25,238 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:25,239 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2066377093] [2022-02-20 14:31:25,239 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:25,239 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:25,286 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:25,286 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1499180286] [2022-02-20 14:31:25,286 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:25,287 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:25,287 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:25,302 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:31:25,303 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:31:25,412 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:25,414 INFO L263 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 13 conjunts are in the unsatisfiable core [2022-02-20 14:31:25,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:25,430 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:25,589 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-02-20 14:31:25,589 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 92 treesize of output 229 [2022-02-20 14:31:25,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:25,635 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:25,654 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:27,064 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:27,088 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 14:31:29,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:29,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:30,086 WARN L234 Elim1Store]: Array PQE input equivalent to false [2022-02-20 14:31:30,140 INFO L356 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2022-02-20 14:31:30,141 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 271 treesize of output 248 [2022-02-20 14:31:30,173 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:30,260 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:30,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {149#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; {149#true} is VALID [2022-02-20 14:31:30,399 INFO L290 TraceCheckUtils]: 1: Hoare triple {149#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {149#true} is VALID [2022-02-20 14:31:30,399 INFO L290 TraceCheckUtils]: 2: Hoare triple {149#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; {149#true} is VALID [2022-02-20 14:31:30,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {149#true} assume !(0 == assume_abort_if_not_~cond#1); {149#true} is VALID [2022-02-20 14:31:30,400 INFO L290 TraceCheckUtils]: 4: Hoare triple {149#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,401 INFO L290 TraceCheckUtils]: 5: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,401 INFO L290 TraceCheckUtils]: 6: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,402 INFO L290 TraceCheckUtils]: 7: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,404 INFO L290 TraceCheckUtils]: 8: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,405 INFO L290 TraceCheckUtils]: 10: Hoare triple {166#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 0; {185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:30,405 INFO L290 TraceCheckUtils]: 11: Hoare triple {185#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {189#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:30,406 INFO L290 TraceCheckUtils]: 12: Hoare triple {189#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {150#false} is VALID [2022-02-20 14:31:30,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {150#false} assume !false; {150#false} is VALID [2022-02-20 14:31:30,407 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:31:30,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:31:30,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:30,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2066377093] [2022-02-20 14:31:30,407 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:30,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1499180286] [2022-02-20 14:31:30,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1499180286] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:31:30,408 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:31:30,408 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:31:30,409 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1425804653] [2022-02-20 14:31:30,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:31:30,409 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:31:30,410 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:30,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:30,421 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:30,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:31:30,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:30,422 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:31:30,422 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:31:30,422 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:30,577 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:30,578 INFO L93 Difference]: Finished difference Result 39 states and 45 transitions. [2022-02-20 14:31:30,578 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:31:30,578 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 14:31:30,578 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:30,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:30,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 14:31:30,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:30,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 45 transitions. [2022-02-20 14:31:30,580 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 45 transitions. [2022-02-20 14:31:30,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:30,621 INFO L225 Difference]: With dead ends: 39 [2022-02-20 14:31:30,621 INFO L226 Difference]: Without dead ends: 37 [2022-02-20 14:31:30,621 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 10 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:31:30,622 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 12 mSDsluCounter, 46 mSDsCounter, 0 mSdLazyCounter, 40 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 65 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 40 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:30,622 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [12 Valid, 65 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 40 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:31:30,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2022-02-20 14:31:30,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 28. [2022-02-20 14:31:30,625 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:30,625 INFO L82 GeneralOperation]: Start isEquivalent. First operand 37 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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:31:30,626 INFO L74 IsIncluded]: Start isIncluded. First operand 37 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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:31:30,626 INFO L87 Difference]: Start difference. First operand 37 states. Second operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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:31:30,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:30,627 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:31:30,627 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:31:30,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:30,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:30,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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) Second operand 37 states. [2022-02-20 14:31:30,628 INFO L87 Difference]: Start difference. First operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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) Second operand 37 states. [2022-02-20 14:31:30,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:30,629 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2022-02-20 14:31:30,630 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 43 transitions. [2022-02-20 14:31:30,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:30,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:30,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:30,630 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:30,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.2592592592592593) internal successors, (34), 27 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:31:30,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 34 transitions. [2022-02-20 14:31:30,631 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 34 transitions. Word has length 14 [2022-02-20 14:31:30,632 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:30,632 INFO L470 AbstractCegarLoop]: Abstraction has 28 states and 34 transitions. [2022-02-20 14:31:30,632 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:30,632 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 14:31:30,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:31:30,633 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:30,633 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:30,668 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 14:31:30,850 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:30,851 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:30,851 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:30,851 INFO L85 PathProgramCache]: Analyzing trace with hash -1850906398, now seen corresponding path program 1 times [2022-02-20 14:31:30,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:30,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1105284266] [2022-02-20 14:31:30,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:30,852 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:30,892 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:30,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1706715823] [2022-02-20 14:31:30,893 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:30,893 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:30,893 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:30,916 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:31:30,917 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:31:30,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:30,960 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:31:30,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:30,968 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:31,052 INFO L290 TraceCheckUtils]: 0: Hoare triple {358#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; {358#true} is VALID [2022-02-20 14:31:31,052 INFO L290 TraceCheckUtils]: 1: Hoare triple {358#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {358#true} is VALID [2022-02-20 14:31:31,052 INFO L290 TraceCheckUtils]: 2: Hoare triple {358#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; {358#true} is VALID [2022-02-20 14:31:31,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {358#true} assume !(0 == assume_abort_if_not_~cond#1); {358#true} is VALID [2022-02-20 14:31:31,058 INFO L290 TraceCheckUtils]: 4: Hoare triple {358#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {375#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:31,059 INFO L290 TraceCheckUtils]: 5: Hoare triple {375#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {379#(<= ~N~0 1)} is VALID [2022-02-20 14:31:31,059 INFO L290 TraceCheckUtils]: 6: Hoare triple {379#(<= ~N~0 1)} main_~i~0#1 := 1; {379#(<= ~N~0 1)} is VALID [2022-02-20 14:31:31,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {379#(<= ~N~0 1)} assume !(main_~i~0#1 < ~N~0); {379#(<= ~N~0 1)} is VALID [2022-02-20 14:31:31,060 INFO L290 TraceCheckUtils]: 8: Hoare triple {379#(<= ~N~0 1)} main_~i~0#1 := 1; {389#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:31,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {389#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {359#false} is VALID [2022-02-20 14:31:31,061 INFO L290 TraceCheckUtils]: 10: Hoare triple {359#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {359#false} is VALID [2022-02-20 14:31:31,061 INFO L290 TraceCheckUtils]: 11: Hoare triple {359#false} assume !(main_~i~0#1 < ~N~0); {359#false} is VALID [2022-02-20 14:31:31,061 INFO L290 TraceCheckUtils]: 12: Hoare triple {359#false} main_~i~0#1 := 0; {359#false} is VALID [2022-02-20 14:31:31,061 INFO L290 TraceCheckUtils]: 13: Hoare triple {359#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {359#false} is VALID [2022-02-20 14:31:31,062 INFO L290 TraceCheckUtils]: 14: Hoare triple {359#false} assume 0 == __VERIFIER_assert_~cond#1; {359#false} is VALID [2022-02-20 14:31:31,062 INFO L290 TraceCheckUtils]: 15: Hoare triple {359#false} assume !false; {359#false} is VALID [2022-02-20 14:31:31,062 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:31,062 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:31:31,062 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:31,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1105284266] [2022-02-20 14:31:31,063 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:31,063 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1706715823] [2022-02-20 14:31:31,063 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1706715823] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:31:31,063 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:31:31,063 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:31:31,063 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1845290628] [2022-02-20 14:31:31,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:31:31,064 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:31:31,064 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:31,064 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:31,077 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:31,077 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:31:31,077 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:31,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:31:31,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:31:31,078 INFO L87 Difference]: Start difference. First operand 28 states and 34 transitions. Second operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:31,280 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:31,280 INFO L93 Difference]: Finished difference Result 62 states and 73 transitions. [2022-02-20 14:31:31,280 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:31:31,280 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 14:31:31,281 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:31,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:31,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 14:31:31,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:31,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 68 transitions. [2022-02-20 14:31:31,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 68 transitions. [2022-02-20 14:31:31,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 68 edges. 68 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:31,340 INFO L225 Difference]: With dead ends: 62 [2022-02-20 14:31:31,340 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:31:31,341 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 14:31:31,343 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 30 mSDsluCounter, 20 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 30 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:31,344 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [30 Valid, 32 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:31:31,344 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:31:31,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 31. [2022-02-20 14:31:31,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:31,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:31:31,352 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:31:31,353 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:31:31,354 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:31,354 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:31:31,354 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:31:31,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:31,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:31,355 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 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 50 states. [2022-02-20 14:31:31,355 INFO L87 Difference]: Start difference. First operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 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 50 states. [2022-02-20 14:31:31,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:31,356 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:31:31,357 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:31:31,357 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:31,357 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:31,357 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:31,357 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:31,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 30 states have (on average 1.2) internal successors, (36), 30 states have internal predecessors, (36), 0 states have call successors, (0), 0 states have 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:31:31,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2022-02-20 14:31:31,358 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 16 [2022-02-20 14:31:31,358 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:31,358 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2022-02-20 14:31:31,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.2) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:31:31,359 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2022-02-20 14:31:31,359 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 14:31:31,359 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:31,359 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:31,379 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:31:31,575 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,SelfDestructingSolverStorable2 [2022-02-20 14:31:31,576 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:31,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:31,576 INFO L85 PathProgramCache]: Analyzing trace with hash -1060218526, now seen corresponding path program 1 times [2022-02-20 14:31:31,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:31,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [394093274] [2022-02-20 14:31:31,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:31,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:31,607 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:31,608 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1797097850] [2022-02-20 14:31:31,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:31,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:31,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:31,622 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:31:31,624 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:31:31,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:31,671 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:31:31,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:31,678 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:31,768 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#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; {634#true} is VALID [2022-02-20 14:31:31,769 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {634#true} is VALID [2022-02-20 14:31:31,769 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#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; {634#true} is VALID [2022-02-20 14:31:31,769 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#true} assume !(0 == assume_abort_if_not_~cond#1); {634#true} is VALID [2022-02-20 14:31:31,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {634#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {651#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:31,771 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,771 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#(< 1 ~N~0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,772 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#(< 1 ~N~0)} assume !(main_~i~0#1 < ~N~0); {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,772 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(< 1 ~N~0)} main_~i~0#1 := 1; {665#(and (< 1 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:31,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {665#(and (< 1 ~N~0) (<= |ULTIMATE.start_main_~i~0#1| 1))} assume !(main_~i~0#1 < ~N~0); {635#false} is VALID [2022-02-20 14:31:31,773 INFO L290 TraceCheckUtils]: 10: Hoare triple {635#false} main_~i~0#1 := 1; {635#false} is VALID [2022-02-20 14:31:31,773 INFO L290 TraceCheckUtils]: 11: Hoare triple {635#false} assume !(main_~i~0#1 < ~N~0); {635#false} is VALID [2022-02-20 14:31:31,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {635#false} main_~i~0#1 := 0; {635#false} is VALID [2022-02-20 14:31:31,774 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {635#false} is VALID [2022-02-20 14:31:31,774 INFO L290 TraceCheckUtils]: 14: Hoare triple {635#false} assume 0 == __VERIFIER_assert_~cond#1; {635#false} is VALID [2022-02-20 14:31:31,774 INFO L290 TraceCheckUtils]: 15: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-02-20 14:31:31,774 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:31,775 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:31,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-02-20 14:31:31,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {635#false} assume 0 == __VERIFIER_assert_~cond#1; {635#false} is VALID [2022-02-20 14:31:31,844 INFO L290 TraceCheckUtils]: 13: Hoare triple {635#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {635#false} is VALID [2022-02-20 14:31:31,844 INFO L290 TraceCheckUtils]: 12: Hoare triple {635#false} main_~i~0#1 := 0; {635#false} is VALID [2022-02-20 14:31:31,844 INFO L290 TraceCheckUtils]: 11: Hoare triple {635#false} assume !(main_~i~0#1 < ~N~0); {635#false} is VALID [2022-02-20 14:31:31,844 INFO L290 TraceCheckUtils]: 10: Hoare triple {635#false} main_~i~0#1 := 1; {635#false} is VALID [2022-02-20 14:31:31,845 INFO L290 TraceCheckUtils]: 9: Hoare triple {705#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {635#false} is VALID [2022-02-20 14:31:31,845 INFO L290 TraceCheckUtils]: 8: Hoare triple {655#(< 1 ~N~0)} main_~i~0#1 := 1; {705#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:31:31,846 INFO L290 TraceCheckUtils]: 7: Hoare triple {655#(< 1 ~N~0)} assume !(main_~i~0#1 < ~N~0); {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,846 INFO L290 TraceCheckUtils]: 6: Hoare triple {655#(< 1 ~N~0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,847 INFO L290 TraceCheckUtils]: 5: Hoare triple {651#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {655#(< 1 ~N~0)} is VALID [2022-02-20 14:31:31,848 INFO L290 TraceCheckUtils]: 4: Hoare triple {634#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {651#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:31,848 INFO L290 TraceCheckUtils]: 3: Hoare triple {634#true} assume !(0 == assume_abort_if_not_~cond#1); {634#true} is VALID [2022-02-20 14:31:31,848 INFO L290 TraceCheckUtils]: 2: Hoare triple {634#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; {634#true} is VALID [2022-02-20 14:31:31,849 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {634#true} is VALID [2022-02-20 14:31:31,849 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#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; {634#true} is VALID [2022-02-20 14:31:31,849 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:31,849 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:31,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [394093274] [2022-02-20 14:31:31,849 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:31,850 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1797097850] [2022-02-20 14:31:31,850 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1797097850] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:31,850 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:31,850 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-02-20 14:31:31,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1543533487] [2022-02-20 14:31:31,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:31,851 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 16 [2022-02-20 14:31:31,851 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:31,851 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:31,865 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:31:31,866 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:31:31,866 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:31,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:31:31,866 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:31:31,867 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,088 INFO L93 Difference]: Finished difference Result 53 states and 59 transitions. [2022-02-20 14:31:32,088 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:31:32,088 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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 16 [2022-02-20 14:31:32,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:32,089 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 14:31:32,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 57 transitions. [2022-02-20 14:31:32,091 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 57 transitions. [2022-02-20 14:31:32,128 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:31:32,129 INFO L225 Difference]: With dead ends: 53 [2022-02-20 14:31:32,129 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 14:31:32,129 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 14:31:32,130 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 40 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 55 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 44 SdHoareTripleChecker+Invalid, 77 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 55 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:32,130 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [40 Valid, 44 Invalid, 77 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 55 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:31:32,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 14:31:32,141 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 30. [2022-02-20 14:31:32,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:32,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:31:32,142 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:31:32,142 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:31:32,144 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,144 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-20 14:31:32,144 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 14:31:32,145 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:32,145 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:32,145 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) Second operand 44 states. [2022-02-20 14:31:32,145 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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) Second operand 44 states. [2022-02-20 14:31:32,151 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,151 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-20 14:31:32,151 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 14:31:32,154 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:32,154 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:32,154 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:32,154 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:32,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1724137931034482) internal successors, (34), 29 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:31:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 34 transitions. [2022-02-20 14:31:32,155 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 34 transitions. Word has length 16 [2022-02-20 14:31:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:32,155 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 34 transitions. [2022-02-20 14:31:32,156 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,156 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 34 transitions. [2022-02-20 14:31:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:31:32,158 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:32,158 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:32,178 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 14:31:32,358 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:32,359 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:32,359 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:32,359 INFO L85 PathProgramCache]: Analyzing trace with hash -1120615462, now seen corresponding path program 1 times [2022-02-20 14:31:32,359 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:32,360 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814156252] [2022-02-20 14:31:32,360 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:32,360 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:32,382 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:32,383 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1410965989] [2022-02-20 14:31:32,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:32,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:32,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:32,384 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:31:32,385 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:31:32,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:32,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 127 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:31:32,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:32,437 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:32,644 INFO L290 TraceCheckUtils]: 0: Hoare triple {935#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; {935#true} is VALID [2022-02-20 14:31:32,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {935#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {935#true} is VALID [2022-02-20 14:31:32,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {935#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; {935#true} is VALID [2022-02-20 14:31:32,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {935#true} assume !(0 == assume_abort_if_not_~cond#1); {935#true} is VALID [2022-02-20 14:31:32,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {935#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {952#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:32,669 INFO L290 TraceCheckUtils]: 5: Hoare triple {952#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~i~0#1 < ~N~0); {956#(<= ~N~0 1)} is VALID [2022-02-20 14:31:32,669 INFO L290 TraceCheckUtils]: 6: Hoare triple {956#(<= ~N~0 1)} main_~i~0#1 := 1; {956#(<= ~N~0 1)} is VALID [2022-02-20 14:31:32,670 INFO L290 TraceCheckUtils]: 7: Hoare triple {956#(<= ~N~0 1)} assume !(main_~i~0#1 < ~N~0); {956#(<= ~N~0 1)} is VALID [2022-02-20 14:31:32,670 INFO L290 TraceCheckUtils]: 8: Hoare triple {956#(<= ~N~0 1)} main_~i~0#1 := 1; {956#(<= ~N~0 1)} is VALID [2022-02-20 14:31:32,672 INFO L290 TraceCheckUtils]: 9: Hoare triple {956#(<= ~N~0 1)} assume !(main_~i~0#1 < ~N~0); {956#(<= ~N~0 1)} is VALID [2022-02-20 14:31:32,673 INFO L290 TraceCheckUtils]: 10: Hoare triple {956#(<= ~N~0 1)} main_~i~0#1 := 0; {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:32,673 INFO L290 TraceCheckUtils]: 11: Hoare triple {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:32,673 INFO L290 TraceCheckUtils]: 12: Hoare triple {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !(0 == __VERIFIER_assert_~cond#1); {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:32,674 INFO L290 TraceCheckUtils]: 13: Hoare triple {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:32,674 INFO L290 TraceCheckUtils]: 14: Hoare triple {972#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {985#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} is VALID [2022-02-20 14:31:32,675 INFO L290 TraceCheckUtils]: 15: Hoare triple {985#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {936#false} is VALID [2022-02-20 14:31:32,675 INFO L290 TraceCheckUtils]: 16: Hoare triple {936#false} assume 0 == __VERIFIER_assert_~cond#1; {936#false} is VALID [2022-02-20 14:31:32,675 INFO L290 TraceCheckUtils]: 17: Hoare triple {936#false} assume !false; {936#false} is VALID [2022-02-20 14:31:32,675 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:32,675 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:31:32,675 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:32,675 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814156252] [2022-02-20 14:31:32,676 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:32,676 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1410965989] [2022-02-20 14:31:32,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1410965989] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:31:32,676 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:31:32,676 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 14:31:32,676 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [909974047] [2022-02-20 14:31:32,676 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:31:32,676 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,676 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:32,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,688 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:31:32,689 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 14:31:32,689 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:32,689 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 14:31:32,689 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 14:31:32,689 INFO L87 Difference]: Start difference. First operand 30 states and 34 transitions. Second operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,790 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,791 INFO L93 Difference]: Finished difference Result 48 states and 52 transitions. [2022-02-20 14:31:32,791 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:31:32,791 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,791 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:32,791 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-02-20 14:31:32,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,792 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 52 transitions. [2022-02-20 14:31:32,793 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 52 transitions. [2022-02-20 14:31:32,817 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:32,817 INFO L225 Difference]: With dead ends: 48 [2022-02-20 14:31:32,817 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 14:31:32,818 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:31:32,818 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 22 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 41 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 29 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 41 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:32,818 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [22 Valid, 29 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 41 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:31:32,819 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 14:31:32,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-02-20 14:31:32,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:32,827 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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:31:32,827 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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:31:32,827 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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:31:32,828 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,828 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:31:32,828 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:31:32,828 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:32,828 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:32,828 INFO L74 IsIncluded]: Start isIncluded. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) Second operand 32 states. [2022-02-20 14:31:32,828 INFO L87 Difference]: Start difference. First operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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) Second operand 32 states. [2022-02-20 14:31:32,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:32,829 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2022-02-20 14:31:32,829 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 35 transitions. [2022-02-20 14:31:32,829 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:32,829 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:32,829 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:32,829 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:32,829 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 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:31:32,830 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-02-20 14:31:32,830 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 18 [2022-02-20 14:31:32,830 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:32,830 INFO L470 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-02-20 14:31:32,830 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.0) internal successors, (18), 6 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:31:32,830 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-02-20 14:31:32,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 14:31:32,831 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:32,831 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:32,862 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:31:33,031 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:33,031 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:33,032 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:33,032 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-02-20 14:31:33,032 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:33,032 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911205327] [2022-02-20 14:31:33,032 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:33,032 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:33,055 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:33,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1665701308] [2022-02-20 14:31:33,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:33,056 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:33,056 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:33,057 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:31:33,058 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:31:33,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:33,111 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 35 conjunts are in the unsatisfiable core [2022-02-20 14:31:33,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:33,119 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:33,138 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:31:33,216 INFO L356 Elim1Store]: treesize reduction 78, result has 41.4 percent of original size [2022-02-20 14:31:33,217 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 272 [2022-02-20 14:31:33,226 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:33,236 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:33,245 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:33,376 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:33,383 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 95 treesize of output 84 [2022-02-20 14:31:33,389 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:33,475 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:33,477 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:33,479 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:33,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 81 treesize of output 74 [2022-02-20 14:31:33,486 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:33,547 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:33,557 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-02-20 14:31:33,557 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 24 [2022-02-20 14:31:33,563 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:33,583 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:33,583 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 0 case distinctions, treesize of input 48 treesize of output 11 [2022-02-20 14:31:33,588 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:33,683 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 19 treesize of output 18 [2022-02-20 14:31:33,753 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:31:33,802 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:33,802 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 14:31:33,901 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#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; {1155#true} is VALID [2022-02-20 14:31:33,902 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1155#true} is VALID [2022-02-20 14:31:33,902 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#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; {1155#true} is VALID [2022-02-20 14:31:33,902 INFO L290 TraceCheckUtils]: 3: Hoare triple {1155#true} assume !(0 == assume_abort_if_not_~cond#1); {1155#true} is VALID [2022-02-20 14:31:33,903 INFO L290 TraceCheckUtils]: 4: Hoare triple {1155#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1172#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,904 INFO L290 TraceCheckUtils]: 5: Hoare triple {1172#(and (= |ULTIMATE.start_main_~a~0#1.offset| 0) (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,904 INFO L290 TraceCheckUtils]: 6: Hoare triple {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {1176#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {1186#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {1186#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,906 INFO L290 TraceCheckUtils]: 10: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,907 INFO L290 TraceCheckUtils]: 11: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,909 INFO L290 TraceCheckUtils]: 12: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {1200#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,910 INFO L290 TraceCheckUtils]: 13: Hoare triple {1200#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,910 INFO L290 TraceCheckUtils]: 14: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,911 INFO L290 TraceCheckUtils]: 15: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,911 INFO L290 TraceCheckUtils]: 16: Hoare triple {1190#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 0; {1213#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:33,912 INFO L290 TraceCheckUtils]: 17: Hoare triple {1213#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1217#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:33,913 INFO L290 TraceCheckUtils]: 18: Hoare triple {1217#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1156#false} is VALID [2022-02-20 14:31:33,913 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-02-20 14:31:33,913 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:33,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:34,277 INFO L290 TraceCheckUtils]: 19: Hoare triple {1156#false} assume !false; {1156#false} is VALID [2022-02-20 14:31:34,279 INFO L290 TraceCheckUtils]: 18: Hoare triple {1217#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1156#false} is VALID [2022-02-20 14:31:34,279 INFO L290 TraceCheckUtils]: 17: Hoare triple {1230#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1217#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:34,287 INFO L290 TraceCheckUtils]: 16: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_~i~0#1 := 0; {1230#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} is VALID [2022-02-20 14:31:34,288 INFO L290 TraceCheckUtils]: 15: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,288 INFO L290 TraceCheckUtils]: 14: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,289 INFO L290 TraceCheckUtils]: 13: Hoare triple {1244#(forall ((v_ArrVal_292 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_292) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,290 INFO L290 TraceCheckUtils]: 12: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_~i~0#1 := 1; {1244#(forall ((v_ArrVal_292 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_292) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,290 INFO L290 TraceCheckUtils]: 11: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,290 INFO L290 TraceCheckUtils]: 10: Hoare triple {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,291 INFO L290 TraceCheckUtils]: 9: Hoare triple {1257#(forall ((v_ArrVal_290 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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1234#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:34,291 INFO L290 TraceCheckUtils]: 8: Hoare triple {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} main_~i~0#1 := 1; {1257#(forall ((v_ArrVal_290 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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,292 INFO L290 TraceCheckUtils]: 7: Hoare triple {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !(main_~i~0#1 < ~N~0); {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,292 INFO L290 TraceCheckUtils]: 6: Hoare triple {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {1271#(forall ((v_ArrVal_288 Int) (v_ArrVal_290 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_288)) |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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_288)) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1261#(forall ((v_ArrVal_290 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| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,294 INFO L290 TraceCheckUtils]: 4: Hoare triple {1155#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1271#(forall ((v_ArrVal_288 Int) (v_ArrVal_290 Int)) (= (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (+ |ULTIMATE.start_main_~a~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_288)) |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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_288)) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_290)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:34,295 INFO L290 TraceCheckUtils]: 3: Hoare triple {1155#true} assume !(0 == assume_abort_if_not_~cond#1); {1155#true} is VALID [2022-02-20 14:31:34,295 INFO L290 TraceCheckUtils]: 2: Hoare triple {1155#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; {1155#true} is VALID [2022-02-20 14:31:34,295 INFO L290 TraceCheckUtils]: 1: Hoare triple {1155#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1155#true} is VALID [2022-02-20 14:31:34,295 INFO L290 TraceCheckUtils]: 0: Hoare triple {1155#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; {1155#true} is VALID [2022-02-20 14:31:34,299 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:34,299 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:34,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911205327] [2022-02-20 14:31:34,299 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:34,299 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665701308] [2022-02-20 14:31:34,299 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665701308] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:34,300 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:34,300 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 15 [2022-02-20 14:31:34,300 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1037597264] [2022-02-20 14:31:34,300 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:34,300 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 20 [2022-02-20 14:31:34,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:34,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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:31:34,347 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:31:34,347 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-02-20 14:31:34,348 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:34,348 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-02-20 14:31:34,348 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=152, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:31:34,348 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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:31:34,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:34,612 INFO L93 Difference]: Finished difference Result 52 states and 58 transitions. [2022-02-20 14:31:34,612 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 14:31:34,612 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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 20 [2022-02-20 14:31:34,612 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:34,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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:31:34,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-02-20 14:31:34,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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:31:34,617 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 56 transitions. [2022-02-20 14:31:34,617 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 56 transitions. [2022-02-20 14:31:34,660 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:34,663 INFO L225 Difference]: With dead ends: 52 [2022-02-20 14:31:34,663 INFO L226 Difference]: Without dead ends: 50 [2022-02-20 14:31:34,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 23 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 75 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=87, Invalid=219, Unknown=0, NotChecked=0, Total=306 [2022-02-20 14:31:34,664 INFO L933 BasicCegarLoop]: 18 mSDtfsCounter, 33 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 98 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 112 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 98 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 78 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:34,664 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [33 Valid, 112 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 98 Invalid, 0 Unknown, 78 Unchecked, 0.1s Time] [2022-02-20 14:31:34,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-02-20 14:31:34,682 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-02-20 14:31:34,683 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:34,683 INFO L82 GeneralOperation]: Start isEquivalent. First operand 50 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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:31:34,683 INFO L74 IsIncluded]: Start isIncluded. First operand 50 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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:31:34,683 INFO L87 Difference]: Start difference. First operand 50 states. Second operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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:31:34,685 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:34,685 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:31:34,685 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:31:34,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:34,686 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:34,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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 50 states. [2022-02-20 14:31:34,686 INFO L87 Difference]: Start difference. First operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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 50 states. [2022-02-20 14:31:34,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:34,689 INFO L93 Difference]: Finished difference Result 50 states and 56 transitions. [2022-02-20 14:31:34,689 INFO L276 IsEmpty]: Start isEmpty. Operand 50 states and 56 transitions. [2022-02-20 14:31:34,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:34,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:34,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:34,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.2) internal successors, (42), 35 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:31:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 42 transitions. [2022-02-20 14:31:34,690 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 42 transitions. Word has length 20 [2022-02-20 14:31:34,691 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:34,692 INFO L470 AbstractCegarLoop]: Abstraction has 36 states and 42 transitions. [2022-02-20 14:31:34,692 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.2666666666666666) internal successors, (34), 15 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:31:34,692 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 42 transitions. [2022-02-20 14:31:34,692 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:31:34,693 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:34,693 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:34,731 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:31:34,899 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:34,899 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:34,900 INFO L85 PathProgramCache]: Analyzing trace with hash 859342364, now seen corresponding path program 2 times [2022-02-20 14:31:34,900 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:34,900 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1430784510] [2022-02-20 14:31:34,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:34,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:34,921 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:34,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2088856631] [2022-02-20 14:31:34,930 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:31:34,930 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:34,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:34,931 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:31:34,932 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:31:34,997 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:31:34,997 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:31:34,998 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:31:35,017 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:35,018 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:35,185 INFO L290 TraceCheckUtils]: 0: Hoare triple {1508#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; {1508#true} is VALID [2022-02-20 14:31:35,185 INFO L290 TraceCheckUtils]: 1: Hoare triple {1508#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1508#true} is VALID [2022-02-20 14:31:35,185 INFO L290 TraceCheckUtils]: 2: Hoare triple {1508#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; {1508#true} is VALID [2022-02-20 14:31:35,185 INFO L290 TraceCheckUtils]: 3: Hoare triple {1508#true} assume !(0 == assume_abort_if_not_~cond#1); {1508#true} is VALID [2022-02-20 14:31:35,196 INFO L290 TraceCheckUtils]: 4: Hoare triple {1508#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:35,196 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:35,197 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1532#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:31:35,197 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,198 INFO L290 TraceCheckUtils]: 8: Hoare triple {1536#(<= ~N~0 2)} main_~i~0#1 := 1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,198 INFO L290 TraceCheckUtils]: 9: Hoare triple {1536#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,198 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= ~N~0 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,199 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,199 INFO L290 TraceCheckUtils]: 12: Hoare triple {1536#(<= ~N~0 2)} main_~i~0#1 := 1; {1552#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:35,200 INFO L290 TraceCheckUtils]: 13: Hoare triple {1552#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1552#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:35,200 INFO L290 TraceCheckUtils]: 14: Hoare triple {1552#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1559#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 15: Hoare triple {1559#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 16: Hoare triple {1509#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 17: Hoare triple {1509#false} assume !(main_~i~0#1 < ~N~0); {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 18: Hoare triple {1509#false} main_~i~0#1 := 0; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 19: Hoare triple {1509#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 20: Hoare triple {1509#false} assume 0 == __VERIFIER_assert_~cond#1; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L290 TraceCheckUtils]: 21: Hoare triple {1509#false} assume !false; {1509#false} is VALID [2022-02-20 14:31:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:35,201 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:35,317 INFO L290 TraceCheckUtils]: 21: Hoare triple {1509#false} assume !false; {1509#false} is VALID [2022-02-20 14:31:35,317 INFO L290 TraceCheckUtils]: 20: Hoare triple {1509#false} assume 0 == __VERIFIER_assert_~cond#1; {1509#false} is VALID [2022-02-20 14:31:35,317 INFO L290 TraceCheckUtils]: 19: Hoare triple {1509#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1509#false} is VALID [2022-02-20 14:31:35,317 INFO L290 TraceCheckUtils]: 18: Hoare triple {1509#false} main_~i~0#1 := 0; {1509#false} is VALID [2022-02-20 14:31:35,317 INFO L290 TraceCheckUtils]: 17: Hoare triple {1509#false} assume !(main_~i~0#1 < ~N~0); {1509#false} is VALID [2022-02-20 14:31:35,318 INFO L290 TraceCheckUtils]: 16: Hoare triple {1509#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1509#false} is VALID [2022-02-20 14:31:35,318 INFO L290 TraceCheckUtils]: 15: Hoare triple {1599#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1509#false} is VALID [2022-02-20 14:31:35,318 INFO L290 TraceCheckUtils]: 14: Hoare triple {1603#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {1599#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:31:35,319 INFO L290 TraceCheckUtils]: 13: Hoare triple {1603#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {1603#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:35,319 INFO L290 TraceCheckUtils]: 12: Hoare triple {1536#(<= ~N~0 2)} main_~i~0#1 := 1; {1603#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:35,319 INFO L290 TraceCheckUtils]: 11: Hoare triple {1536#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,320 INFO L290 TraceCheckUtils]: 10: Hoare triple {1536#(<= ~N~0 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,320 INFO L290 TraceCheckUtils]: 9: Hoare triple {1536#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,320 INFO L290 TraceCheckUtils]: 8: Hoare triple {1536#(<= ~N~0 2)} main_~i~0#1 := 1; {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,321 INFO L290 TraceCheckUtils]: 7: Hoare triple {1532#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {1536#(<= ~N~0 2)} is VALID [2022-02-20 14:31:35,321 INFO L290 TraceCheckUtils]: 6: Hoare triple {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1532#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:31:35,322 INFO L290 TraceCheckUtils]: 5: Hoare triple {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:35,322 INFO L290 TraceCheckUtils]: 4: Hoare triple {1508#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1525#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:35,322 INFO L290 TraceCheckUtils]: 3: Hoare triple {1508#true} assume !(0 == assume_abort_if_not_~cond#1); {1508#true} is VALID [2022-02-20 14:31:35,323 INFO L290 TraceCheckUtils]: 2: Hoare triple {1508#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; {1508#true} is VALID [2022-02-20 14:31:35,323 INFO L290 TraceCheckUtils]: 1: Hoare triple {1508#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1508#true} is VALID [2022-02-20 14:31:35,323 INFO L290 TraceCheckUtils]: 0: Hoare triple {1508#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; {1508#true} is VALID [2022-02-20 14:31:35,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:35,323 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:35,323 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1430784510] [2022-02-20 14:31:35,323 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:35,324 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2088856631] [2022-02-20 14:31:35,324 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2088856631] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:35,324 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:35,324 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:31:35,324 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657354527] [2022-02-20 14:31:35,325 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:35,327 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 22 [2022-02-20 14:31:35,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:35,327 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:31:35,375 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:31:35,388 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:31:35,389 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:35,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:31:35,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:31:35,390 INFO L87 Difference]: Start difference. First operand 36 states and 42 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:31:35,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:35,690 INFO L93 Difference]: Finished difference Result 81 states and 92 transitions. [2022-02-20 14:31:35,690 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:31:35,691 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 22 [2022-02-20 14:31:35,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:35,691 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:31:35,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-20 14:31:35,692 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:31:35,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 84 transitions. [2022-02-20 14:31:35,693 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 84 transitions. [2022-02-20 14:31:35,777 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:35,778 INFO L225 Difference]: With dead ends: 81 [2022-02-20 14:31:35,778 INFO L226 Difference]: Without dead ends: 68 [2022-02-20 14:31:35,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 47 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=123, Unknown=0, NotChecked=0, Total=182 [2022-02-20 14:31:35,779 INFO L933 BasicCegarLoop]: 12 mSDtfsCounter, 63 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 73 mSolverCounterSat, 49 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 36 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 49 IncrementalHoareTripleChecker+Valid, 73 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:35,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [63 Valid, 36 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [49 Valid, 73 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:31:35,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-02-20 14:31:35,820 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 42. [2022-02-20 14:31:35,820 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:35,821 INFO L82 GeneralOperation]: Start isEquivalent. First operand 68 states. Second operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:31:35,821 INFO L74 IsIncluded]: Start isIncluded. First operand 68 states. Second operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:31:35,821 INFO L87 Difference]: Start difference. First operand 68 states. Second operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:31:35,822 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:35,822 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-02-20 14:31:35,823 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-02-20 14:31:35,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:35,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:35,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 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 68 states. [2022-02-20 14:31:35,823 INFO L87 Difference]: Start difference. First operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 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 68 states. [2022-02-20 14:31:35,825 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:35,825 INFO L93 Difference]: Finished difference Result 68 states and 74 transitions. [2022-02-20 14:31:35,825 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 74 transitions. [2022-02-20 14:31:35,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:35,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:35,825 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:35,825 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:35,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 41 states have (on average 1.146341463414634) internal successors, (47), 41 states have internal predecessors, (47), 0 states have call successors, (0), 0 states have 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:31:35,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 47 transitions. [2022-02-20 14:31:35,827 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 47 transitions. Word has length 22 [2022-02-20 14:31:35,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:35,827 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 47 transitions. [2022-02-20 14:31:35,827 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:31:35,827 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 47 transitions. [2022-02-20 14:31:35,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 14:31:35,828 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:35,828 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:35,865 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:31:36,044 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:36,044 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:36,044 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:36,045 INFO L85 PathProgramCache]: Analyzing trace with hash 803751580, now seen corresponding path program 3 times [2022-02-20 14:31:36,045 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:36,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413117304] [2022-02-20 14:31:36,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:36,045 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:36,071 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:36,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1116988184] [2022-02-20 14:31:36,071 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:31:36,071 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:36,071 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:36,072 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:31:36,074 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:31:36,145 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:31:36,146 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:31:36,147 INFO L263 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:31:36,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:36,157 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:36,273 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#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; {1955#true} is VALID [2022-02-20 14:31:36,273 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1955#true} is VALID [2022-02-20 14:31:36,273 INFO L290 TraceCheckUtils]: 2: Hoare triple {1955#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; {1955#true} is VALID [2022-02-20 14:31:36,273 INFO L290 TraceCheckUtils]: 3: Hoare triple {1955#true} assume !(0 == assume_abort_if_not_~cond#1); {1955#true} is VALID [2022-02-20 14:31:36,274 INFO L290 TraceCheckUtils]: 4: Hoare triple {1955#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,274 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,275 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1979#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,276 INFO L290 TraceCheckUtils]: 7: Hoare triple {1979#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,276 INFO L290 TraceCheckUtils]: 8: Hoare triple {1983#(< 2 ~N~0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,276 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,276 INFO L290 TraceCheckUtils]: 10: Hoare triple {1983#(< 2 ~N~0)} main_~i~0#1 := 1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,277 INFO L290 TraceCheckUtils]: 11: Hoare triple {1983#(< 2 ~N~0)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,277 INFO L290 TraceCheckUtils]: 12: Hoare triple {1983#(< 2 ~N~0)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,277 INFO L290 TraceCheckUtils]: 13: Hoare triple {1983#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,278 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(< 2 ~N~0)} main_~i~0#1 := 1; {2005#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} is VALID [2022-02-20 14:31:36,279 INFO L290 TraceCheckUtils]: 15: Hoare triple {2005#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2005#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} is VALID [2022-02-20 14:31:36,279 INFO L290 TraceCheckUtils]: 16: Hoare triple {2005#(and (<= |ULTIMATE.start_main_~i~0#1| 1) (< 2 ~N~0))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2012#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 2 ~N~0))} is VALID [2022-02-20 14:31:36,280 INFO L290 TraceCheckUtils]: 17: Hoare triple {2012#(and (<= |ULTIMATE.start_main_~i~0#1| 2) (< 2 ~N~0))} assume !(main_~i~0#1 < ~N~0); {1956#false} is VALID [2022-02-20 14:31:36,280 INFO L290 TraceCheckUtils]: 18: Hoare triple {1956#false} main_~i~0#1 := 0; {1956#false} is VALID [2022-02-20 14:31:36,280 INFO L290 TraceCheckUtils]: 19: Hoare triple {1956#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1956#false} is VALID [2022-02-20 14:31:36,280 INFO L290 TraceCheckUtils]: 20: Hoare triple {1956#false} assume 0 == __VERIFIER_assert_~cond#1; {1956#false} is VALID [2022-02-20 14:31:36,280 INFO L290 TraceCheckUtils]: 21: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2022-02-20 14:31:36,280 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:36,280 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:36,366 INFO L290 TraceCheckUtils]: 21: Hoare triple {1956#false} assume !false; {1956#false} is VALID [2022-02-20 14:31:36,367 INFO L290 TraceCheckUtils]: 20: Hoare triple {1956#false} assume 0 == __VERIFIER_assert_~cond#1; {1956#false} is VALID [2022-02-20 14:31:36,367 INFO L290 TraceCheckUtils]: 19: Hoare triple {1956#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1956#false} is VALID [2022-02-20 14:31:36,367 INFO L290 TraceCheckUtils]: 18: Hoare triple {1956#false} main_~i~0#1 := 0; {1956#false} is VALID [2022-02-20 14:31:36,370 INFO L290 TraceCheckUtils]: 17: Hoare triple {2040#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} assume !(main_~i~0#1 < ~N~0); {1956#false} is VALID [2022-02-20 14:31:36,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {2044#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2040#(< |ULTIMATE.start_main_~i~0#1| ~N~0)} is VALID [2022-02-20 14:31:36,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2044#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2044#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:31:36,372 INFO L290 TraceCheckUtils]: 14: Hoare triple {1983#(< 2 ~N~0)} main_~i~0#1 := 1; {2044#(< (+ |ULTIMATE.start_main_~i~0#1| 1) ~N~0)} is VALID [2022-02-20 14:31:36,372 INFO L290 TraceCheckUtils]: 13: Hoare triple {1983#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,372 INFO L290 TraceCheckUtils]: 12: Hoare triple {1983#(< 2 ~N~0)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,373 INFO L290 TraceCheckUtils]: 11: Hoare triple {1983#(< 2 ~N~0)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,373 INFO L290 TraceCheckUtils]: 10: Hoare triple {1983#(< 2 ~N~0)} main_~i~0#1 := 1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,373 INFO L290 TraceCheckUtils]: 9: Hoare triple {1983#(< 2 ~N~0)} assume !(main_~i~0#1 < ~N~0); {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,373 INFO L290 TraceCheckUtils]: 8: Hoare triple {1983#(< 2 ~N~0)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,374 INFO L290 TraceCheckUtils]: 7: Hoare triple {1979#(<= 2 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1983#(< 2 ~N~0)} is VALID [2022-02-20 14:31:36,375 INFO L290 TraceCheckUtils]: 6: Hoare triple {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1979#(<= 2 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,375 INFO L290 TraceCheckUtils]: 5: Hoare triple {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,375 INFO L290 TraceCheckUtils]: 4: Hoare triple {1955#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {1972#(<= 1 |ULTIMATE.start_main_~i~0#1|)} is VALID [2022-02-20 14:31:36,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {1955#true} assume !(0 == assume_abort_if_not_~cond#1); {1955#true} is VALID [2022-02-20 14:31:36,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {1955#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; {1955#true} is VALID [2022-02-20 14:31:36,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {1955#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {1955#true} is VALID [2022-02-20 14:31:36,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {1955#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; {1955#true} is VALID [2022-02-20 14:31:36,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:36,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:36,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413117304] [2022-02-20 14:31:36,377 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:36,377 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116988184] [2022-02-20 14:31:36,377 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116988184] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:36,377 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:36,377 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-02-20 14:31:36,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461501543] [2022-02-20 14:31:36,377 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:36,377 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 22 [2022-02-20 14:31:36,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:36,378 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:31:36,400 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:31:36,400 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:31:36,401 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:36,401 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:31:36,401 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:31:36,401 INFO L87 Difference]: Start difference. First operand 42 states and 47 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:31:36,786 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:36,786 INFO L93 Difference]: Finished difference Result 71 states and 77 transitions. [2022-02-20 14:31:36,786 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:31:36,786 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 22 [2022-02-20 14:31:36,786 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:36,786 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:31:36,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-02-20 14:31:36,788 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:31:36,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 75 transitions. [2022-02-20 14:31:36,788 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 75 transitions. [2022-02-20 14:31:36,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:36,860 INFO L225 Difference]: With dead ends: 71 [2022-02-20 14:31:36,860 INFO L226 Difference]: Without dead ends: 60 [2022-02-20 14:31:36,861 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 35 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=68, Invalid=142, Unknown=0, NotChecked=0, Total=210 [2022-02-20 14:31:36,861 INFO L933 BasicCegarLoop]: 20 mSDtfsCounter, 47 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:36,862 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 69 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:31:36,862 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2022-02-20 14:31:36,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 40. [2022-02-20 14:31:36,891 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:36,891 INFO L82 GeneralOperation]: Start isEquivalent. First operand 60 states. Second operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:31:36,891 INFO L74 IsIncluded]: Start isIncluded. First operand 60 states. Second operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:31:36,892 INFO L87 Difference]: Start difference. First operand 60 states. Second operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:31:36,892 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:36,893 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-02-20 14:31:36,893 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 14:31:36,893 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:36,893 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:36,893 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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) Second operand 60 states. [2022-02-20 14:31:36,893 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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) Second operand 60 states. [2022-02-20 14:31:36,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:36,894 INFO L93 Difference]: Finished difference Result 60 states and 64 transitions. [2022-02-20 14:31:36,894 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 64 transitions. [2022-02-20 14:31:36,895 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:36,895 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:36,895 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:36,895 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:36,895 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.1282051282051282) internal successors, (44), 39 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:31:36,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 44 transitions. [2022-02-20 14:31:36,896 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 44 transitions. Word has length 22 [2022-02-20 14:31:36,896 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:36,896 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 44 transitions. [2022-02-20 14:31:36,896 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:31:36,896 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 44 transitions. [2022-02-20 14:31:36,897 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 14:31:36,897 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:36,897 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:36,929 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:31:37,114 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:37,114 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:37,114 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:37,115 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-02-20 14:31:37,115 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:37,115 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560104146] [2022-02-20 14:31:37,115 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:37,115 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:37,130 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:37,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [114540583] [2022-02-20 14:31:37,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:37,131 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:37,131 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:37,132 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:31:37,133 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:31:37,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:37,194 INFO L263 TraceCheckSpWp]: Trace formula consists of 148 conjuncts, 40 conjunts are in the unsatisfiable core [2022-02-20 14:31:37,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:37,205 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:37,248 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:37,248 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-02-20 14:31:37,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:37,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:37,272 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:37,280 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-02-20 14:31:37,284 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:37,288 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:37,374 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:37,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 14:31:37,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:37,472 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:37,472 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 28 treesize of output 30 [2022-02-20 14:31:37,541 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:37,543 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:37,544 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:31:37,902 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:31:37,902 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 56 treesize of output 32 [2022-02-20 14:31:37,944 INFO L290 TraceCheckUtils]: 0: Hoare triple {2371#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; {2371#true} is VALID [2022-02-20 14:31:37,944 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {2371#true} is VALID [2022-02-20 14:31:37,944 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#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; {2371#true} is VALID [2022-02-20 14:31:37,944 INFO L290 TraceCheckUtils]: 3: Hoare triple {2371#true} assume !(0 == assume_abort_if_not_~cond#1); {2371#true} is VALID [2022-02-20 14:31:37,946 INFO L290 TraceCheckUtils]: 4: Hoare triple {2371#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {2388#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,947 INFO L290 TraceCheckUtils]: 5: Hoare triple {2388#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,947 INFO L290 TraceCheckUtils]: 6: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,948 INFO L290 TraceCheckUtils]: 7: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,948 INFO L290 TraceCheckUtils]: 8: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {2402#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,949 INFO L290 TraceCheckUtils]: 9: Hoare triple {2402#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,950 INFO L290 TraceCheckUtils]: 10: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,950 INFO L290 TraceCheckUtils]: 11: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,951 INFO L290 TraceCheckUtils]: 12: Hoare triple {2392#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {2402#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:37,952 INFO L290 TraceCheckUtils]: 13: Hoare triple {2402#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,953 INFO L290 TraceCheckUtils]: 14: Hoare triple {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,954 INFO L290 TraceCheckUtils]: 15: Hoare triple {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !(main_~i~0#1 < ~N~0); {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {2418#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_~i~0#1 := 0; {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,956 INFO L290 TraceCheckUtils]: 17: Hoare triple {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !(0 == __VERIFIER_assert_~cond#1); {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,958 INFO L290 TraceCheckUtils]: 20: Hoare triple {2428#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2441#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:37,959 INFO L290 TraceCheckUtils]: 21: Hoare triple {2441#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2445#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:37,960 INFO L290 TraceCheckUtils]: 22: Hoare triple {2445#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2372#false} is VALID [2022-02-20 14:31:37,960 INFO L290 TraceCheckUtils]: 23: Hoare triple {2372#false} assume !false; {2372#false} is VALID [2022-02-20 14:31:37,960 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:31:37,960 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:38,250 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_488 Int) (v_ArrVal_487 (Array Int Int))) (= (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487))) (let ((.cse0 (store (select .cse1 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_488))) (+ (select .cse0 |c_ULTIMATE.start_main_~b~0#1.offset|) (select (select (store .cse1 |c_ULTIMATE.start_main_~b~0#1.base| .cse0) |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|)))) 1)) is different from false [2022-02-20 14:31:38,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {2372#false} assume !false; {2372#false} is VALID [2022-02-20 14:31:38,405 INFO L290 TraceCheckUtils]: 22: Hoare triple {2445#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2372#false} is VALID [2022-02-20 14:31:38,406 INFO L290 TraceCheckUtils]: 21: Hoare triple {2458#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2445#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:38,408 INFO L290 TraceCheckUtils]: 20: Hoare triple {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {2458#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} is VALID [2022-02-20 14:31:38,409 INFO L290 TraceCheckUtils]: 19: Hoare triple {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:31:38,409 INFO L290 TraceCheckUtils]: 18: Hoare triple {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(0 == __VERIFIER_assert_~cond#1); {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:31:38,410 INFO L290 TraceCheckUtils]: 17: Hoare triple {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:31:38,410 INFO L290 TraceCheckUtils]: 16: Hoare triple {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} main_~i~0#1 := 0; {2462#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:31:38,411 INFO L290 TraceCheckUtils]: 15: Hoare triple {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} assume !(main_~i~0#1 < ~N~0); {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:31:38,411 INFO L290 TraceCheckUtils]: 14: Hoare triple {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:31:38,412 INFO L290 TraceCheckUtils]: 13: Hoare triple {2485#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))))) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2475#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:31:38,413 INFO L290 TraceCheckUtils]: 12: Hoare triple {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} main_~i~0#1 := 1; {2485#(= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))))) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:31:38,413 INFO L290 TraceCheckUtils]: 11: Hoare triple {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} assume !(main_~i~0#1 < ~N~0); {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} is VALID [2022-02-20 14:31:38,413 INFO L290 TraceCheckUtils]: 10: Hoare triple {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} is VALID [2022-02-20 14:31:38,414 INFO L290 TraceCheckUtils]: 9: Hoare triple {2499#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2489#(= (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) 1)} is VALID [2022-02-20 14:31:38,415 INFO L290 TraceCheckUtils]: 8: Hoare triple {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} main_~i~0#1 := 1; {2499#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} is VALID [2022-02-20 14:31:38,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} assume !(main_~i~0#1 < ~N~0); {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} is VALID [2022-02-20 14:31:38,416 INFO L290 TraceCheckUtils]: 6: Hoare triple {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} is VALID [2022-02-20 14:31:38,417 INFO L290 TraceCheckUtils]: 5: Hoare triple {2513#(forall ((v_ArrVal_488 Int) (v_ArrVal_487 (Array Int Int))) (= (+ (select (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2503#(forall ((v_ArrVal_488 Int)) (= (+ (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (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| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} is VALID [2022-02-20 14:31:38,418 INFO L290 TraceCheckUtils]: 4: Hoare triple {2371#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {2513#(forall ((v_ArrVal_488 Int) (v_ArrVal_487 (Array Int Int))) (= (+ (select (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base| (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_487) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_488)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) 1))} is VALID [2022-02-20 14:31:38,419 INFO L290 TraceCheckUtils]: 3: Hoare triple {2371#true} assume !(0 == assume_abort_if_not_~cond#1); {2371#true} is VALID [2022-02-20 14:31:38,419 INFO L290 TraceCheckUtils]: 2: Hoare triple {2371#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; {2371#true} is VALID [2022-02-20 14:31:38,419 INFO L290 TraceCheckUtils]: 1: Hoare triple {2371#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {2371#true} is VALID [2022-02-20 14:31:38,419 INFO L290 TraceCheckUtils]: 0: Hoare triple {2371#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; {2371#true} is VALID [2022-02-20 14:31:38,419 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-02-20 14:31:38,419 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:38,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560104146] [2022-02-20 14:31:38,420 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:38,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [114540583] [2022-02-20 14:31:38,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [114540583] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:38,420 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:38,420 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11] total 17 [2022-02-20 14:31:38,420 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [645083706] [2022-02-20 14:31:38,420 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:38,421 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:31:38,421 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:38,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:31:38,474 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:31:38,474 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 14:31:38,474 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:38,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 14:31:38,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=191, Unknown=1, NotChecked=28, Total=272 [2022-02-20 14:31:38,475 INFO L87 Difference]: Start difference. First operand 40 states and 44 transitions. Second operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:31:38,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:38,738 INFO L93 Difference]: Finished difference Result 46 states and 50 transitions. [2022-02-20 14:31:38,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 14:31:38,738 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 states have internal predecessors, (42), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 14:31:38,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:38,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:31:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 14:31:38,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:31:38,739 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 40 transitions. [2022-02-20 14:31:38,739 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 40 transitions. [2022-02-20 14:31:38,772 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:31:38,772 INFO L225 Difference]: With dead ends: 46 [2022-02-20 14:31:38,772 INFO L226 Difference]: Without dead ends: 44 [2022-02-20 14:31:38,773 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 68 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=261, Unknown=1, NotChecked=34, Total=380 [2022-02-20 14:31:38,773 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 9 mSDsluCounter, 94 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:38,773 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 109 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 49 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-02-20 14:31:38,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2022-02-20 14:31:38,801 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 44. [2022-02-20 14:31:38,802 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:38,802 INFO L82 GeneralOperation]: Start isEquivalent. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:38,802 INFO L74 IsIncluded]: Start isIncluded. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:38,802 INFO L87 Difference]: Start difference. First operand 44 states. Second operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:38,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:38,803 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-20 14:31:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 14:31:38,803 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:38,803 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:38,803 INFO L74 IsIncluded]: Start isIncluded. First operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 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 44 states. [2022-02-20 14:31:38,803 INFO L87 Difference]: Start difference. First operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 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 44 states. [2022-02-20 14:31:38,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:38,804 INFO L93 Difference]: Finished difference Result 44 states and 48 transitions. [2022-02-20 14:31:38,804 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 14:31:38,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:38,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:38,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:38,804 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:38,804 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 44 states, 43 states have (on average 1.1162790697674418) internal successors, (48), 43 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have 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:31:38,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 48 transitions. [2022-02-20 14:31:38,805 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 48 transitions. Word has length 24 [2022-02-20 14:31:38,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:38,806 INFO L470 AbstractCegarLoop]: Abstraction has 44 states and 48 transitions. [2022-02-20 14:31:38,806 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 17 states have (on average 2.4705882352941178) internal successors, (42), 17 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:31:38,806 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 48 transitions. [2022-02-20 14:31:38,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 14:31:38,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:38,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:38,834 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:31:39,007 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,SelfDestructingSolverStorable8 [2022-02-20 14:31:39,007 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:39,007 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:39,007 INFO L85 PathProgramCache]: Analyzing trace with hash 1304966232, now seen corresponding path program 4 times [2022-02-20 14:31:39,007 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:39,007 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1994932906] [2022-02-20 14:31:39,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:39,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:39,043 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:39,043 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [625885084] [2022-02-20 14:31:39,043 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-02-20 14:31:39,043 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:39,043 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:39,054 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:31:39,090 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:31:39,229 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-02-20 14:31:39,230 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:31:39,231 INFO L263 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 29 conjunts are in the unsatisfiable core [2022-02-20 14:31:39,304 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:39,305 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:39,421 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-02-20 14:31:39,421 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-02-20 14:31:39,430 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:39,461 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:39,472 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:41,313 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:41,330 INFO L356 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-02-20 14:31:41,331 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 208 treesize of output 151 [2022-02-20 14:31:41,346 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:41,380 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:41,550 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:41,553 INFO L356 Elim1Store]: treesize reduction 20, result has 4.8 percent of original size [2022-02-20 14:31:41,554 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 98 treesize of output 57 [2022-02-20 14:31:41,573 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:41,585 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:41,594 INFO L356 Elim1Store]: treesize reduction 24, result has 25.0 percent of original size [2022-02-20 14:31:41,594 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 3 new quantified variables, introduced 3 case distinctions, treesize of input 241 treesize of output 192 [2022-02-20 14:31:41,613 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:41,759 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:41,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:42,130 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 14 treesize of output 12 [2022-02-20 14:31:42,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:42,417 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:42,452 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-20 14:31:42,455 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 113 [2022-02-20 14:31:42,465 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:42,471 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:31:42,582 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 14 treesize of output 16 [2022-02-20 14:31:42,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 14:31:42,726 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 14 treesize of output 16 [2022-02-20 14:31:42,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:42,800 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:31:42,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:42,858 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:31:42,951 INFO L290 TraceCheckUtils]: 0: Hoare triple {2746#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; {2746#true} is VALID [2022-02-20 14:31:42,951 INFO L290 TraceCheckUtils]: 1: Hoare triple {2746#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {2746#true} is VALID [2022-02-20 14:31:42,951 INFO L290 TraceCheckUtils]: 2: Hoare triple {2746#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; {2746#true} is VALID [2022-02-20 14:31:42,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {2746#true} assume !(0 == assume_abort_if_not_~cond#1); {2746#true} is VALID [2022-02-20 14:31:42,954 WARN L290 TraceCheckUtils]: 4: Hoare triple {2746#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {2763#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_36 (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base|)) (= (select v_DerPreprocessor_44 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~b~0#1.base|)) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~b~0#1.base|)) (= (select v_DerPreprocessor_38 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_42 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base|)))))} is UNKNOWN [2022-02-20 14:31:42,956 INFO L290 TraceCheckUtils]: 5: Hoare triple {2763#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((v_DerPreprocessor_42 (Array Int Int)) (v_DerPreprocessor_43 (Array Int Int)) (v_DerPreprocessor_37 (Array Int Int)) (v_DerPreprocessor_38 (Array Int Int)) (v_DerPreprocessor_44 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (and (= (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|)) (= v_DerPreprocessor_36 (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base|)) (= (select v_DerPreprocessor_44 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_36) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_37) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_38) |ULTIMATE.start_main_~b~0#1.base|)) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~b~0#1.base|)) (= (select v_DerPreprocessor_38 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= v_DerPreprocessor_42 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_42) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_43) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_44) |ULTIMATE.start_main_~a~0#1.base|)))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2767#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,957 INFO L290 TraceCheckUtils]: 6: Hoare triple {2767#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2767#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,957 INFO L290 TraceCheckUtils]: 7: Hoare triple {2767#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,958 INFO L290 TraceCheckUtils]: 8: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,959 INFO L290 TraceCheckUtils]: 11: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,960 INFO L290 TraceCheckUtils]: 12: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,961 INFO L290 TraceCheckUtils]: 13: Hoare triple {2774#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,961 INFO L290 TraceCheckUtils]: 14: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,962 INFO L290 TraceCheckUtils]: 15: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,962 INFO L290 TraceCheckUtils]: 16: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {2803#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,963 INFO L290 TraceCheckUtils]: 17: Hoare triple {2803#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2803#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,963 INFO L290 TraceCheckUtils]: 18: Hoare triple {2803#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2810#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,964 INFO L290 TraceCheckUtils]: 19: Hoare triple {2810#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,964 INFO L290 TraceCheckUtils]: 20: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,965 INFO L290 TraceCheckUtils]: 21: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,965 INFO L290 TraceCheckUtils]: 22: Hoare triple {2793#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 0; {2823#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:42,966 INFO L290 TraceCheckUtils]: 23: Hoare triple {2823#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2827#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:42,966 INFO L290 TraceCheckUtils]: 24: Hoare triple {2827#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2747#false} is VALID [2022-02-20 14:31:42,966 INFO L290 TraceCheckUtils]: 25: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2022-02-20 14:31:42,967 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 10 refuted. 1 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:42,967 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:45,159 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-02-20 14:31:45,585 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) is different from false [2022-02-20 14:31:45,955 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-02-20 14:31:46,202 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) is different from false [2022-02-20 14:31:46,659 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)))) is different from false [2022-02-20 14:31:47,159 INFO L290 TraceCheckUtils]: 25: Hoare triple {2747#false} assume !false; {2747#false} is VALID [2022-02-20 14:31:47,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {2827#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {2747#false} is VALID [2022-02-20 14:31:47,160 INFO L290 TraceCheckUtils]: 23: Hoare triple {2840#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {2827#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:47,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_~i~0#1 := 0; {2840#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} is VALID [2022-02-20 14:31:47,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:47,162 INFO L290 TraceCheckUtils]: 20: Hoare triple {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:47,163 INFO L290 TraceCheckUtils]: 19: Hoare triple {2854#(forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2844#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:31:47,164 INFO L290 TraceCheckUtils]: 18: Hoare triple {2858#(forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {2854#(forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:31:47,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {2862#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {2858#(forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,167 INFO L290 TraceCheckUtils]: 16: Hoare triple {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_~i~0#1 := 1; {2862#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,168 INFO L290 TraceCheckUtils]: 15: Hoare triple {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !(main_~i~0#1 < ~N~0); {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:31:47,170 INFO L290 TraceCheckUtils]: 14: Hoare triple {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:31:47,172 WARN L290 TraceCheckUtils]: 13: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2866#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:31:47,173 INFO L290 TraceCheckUtils]: 12: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,178 WARN L290 TraceCheckUtils]: 11: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is UNKNOWN [2022-02-20 14:31:47,179 INFO L290 TraceCheckUtils]: 10: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} main_~i~0#1 := 1; {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,179 INFO L290 TraceCheckUtils]: 9: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} assume !(main_~i~0#1 < ~N~0); {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,180 INFO L290 TraceCheckUtils]: 8: Hoare triple {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is VALID [2022-02-20 14:31:47,183 WARN L290 TraceCheckUtils]: 7: Hoare triple {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2876#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))} is UNKNOWN [2022-02-20 14:31:47,185 WARN L290 TraceCheckUtils]: 6: Hoare triple {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:31:47,188 WARN L290 TraceCheckUtils]: 5: Hoare triple {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:31:47,190 INFO L290 TraceCheckUtils]: 4: Hoare triple {2746#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {2895#(forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_575) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:31:47,190 INFO L290 TraceCheckUtils]: 3: Hoare triple {2746#true} assume !(0 == assume_abort_if_not_~cond#1); {2746#true} is VALID [2022-02-20 14:31:47,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {2746#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; {2746#true} is VALID [2022-02-20 14:31:47,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {2746#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {2746#true} is VALID [2022-02-20 14:31:47,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {2746#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; {2746#true} is VALID [2022-02-20 14:31:47,191 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 9 not checked. [2022-02-20 14:31:47,191 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:47,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1994932906] [2022-02-20 14:31:47,191 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:47,191 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [625885084] [2022-02-20 14:31:47,191 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [625885084] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:47,192 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:47,192 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11] total 18 [2022-02-20 14:31:47,192 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145601715] [2022-02-20 14:31:47,192 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:47,193 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:31:47,193 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:47,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:47,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 46 edges. 39 inductive. 0 not inductive. 7 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:47,258 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2022-02-20 14:31:47,258 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:47,258 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2022-02-20 14:31:47,258 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=117, Unknown=6, NotChecked=130, Total=306 [2022-02-20 14:31:47,259 INFO L87 Difference]: Start difference. First operand 44 states and 48 transitions. Second operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:48,380 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_571 (Array Int Int)) (v_ArrVal_573 (Array Int Int))) (or (= (select (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_571) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))) is different from false [2022-02-20 14:31:50,528 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-02-20 14:31:50,559 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int) (v_ArrVal_573 (Array Int Int))) (or (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|)) (= 0 (select (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_573) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|)))) (forall ((v_ArrVal_576 Int) (v_ArrVal_575 Int) (|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_575) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_68|))))) is different from false [2022-02-20 14:31:52,656 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_68| Int)) (or (forall ((v_ArrVal_576 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ |c_ULTIMATE.start_main_~c~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_68| 8)) v_ArrVal_576) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_68|)))) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-02-20 14:31:52,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:52,861 INFO L93 Difference]: Finished difference Result 91 states and 100 transitions. [2022-02-20 14:31:52,861 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2022-02-20 14:31:52,861 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 14:31:52,862 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:52,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2022-02-20 14:31:52,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:52,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 88 transitions. [2022-02-20 14:31:52,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 28 states and 88 transitions. [2022-02-20 14:31:53,335 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 78 inductive. 0 not inductive. 10 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:53,336 INFO L225 Difference]: With dead ends: 91 [2022-02-20 14:31:53,336 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 14:31:53,337 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 34 SyntacticMatches, 11 SemanticMatches, 31 ConstructedPredicates, 9 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=148, Invalid=425, Unknown=15, NotChecked=468, Total=1056 [2022-02-20 14:31:53,337 INFO L933 BasicCegarLoop]: 19 mSDtfsCounter, 72 mSDsluCounter, 86 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 226 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:53,337 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 105 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 120 Invalid, 0 Unknown, 226 Unchecked, 0.1s Time] [2022-02-20 14:31:53,337 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 14:31:53,384 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 61. [2022-02-20 14:31:53,384 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:53,384 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:53,385 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:53,385 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:53,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:53,386 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 14:31:53,386 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 14:31:53,386 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:53,386 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:53,387 INFO L74 IsIncluded]: Start isIncluded. First operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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 89 states. [2022-02-20 14:31:53,387 INFO L87 Difference]: Start difference. First operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 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 89 states. [2022-02-20 14:31:53,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:53,388 INFO L93 Difference]: Finished difference Result 89 states and 97 transitions. [2022-02-20 14:31:53,388 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 97 transitions. [2022-02-20 14:31:53,388 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:53,388 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:53,388 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:53,389 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:53,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 61 states, 60 states have (on average 1.15) internal successors, (69), 60 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have 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:31:53,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 69 transitions. [2022-02-20 14:31:53,390 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 69 transitions. Word has length 26 [2022-02-20 14:31:53,390 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:53,390 INFO L470 AbstractCegarLoop]: Abstraction has 61 states and 69 transitions. [2022-02-20 14:31:53,390 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 2.5555555555555554) internal successors, (46), 18 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have 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:31:53,390 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 69 transitions. [2022-02-20 14:31:53,390 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 14:31:53,391 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:53,391 INFO L514 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:53,409 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:31:53,591 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2022-02-20 14:31:53,591 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:53,592 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:53,592 INFO L85 PathProgramCache]: Analyzing trace with hash -231193078, now seen corresponding path program 2 times [2022-02-20 14:31:53,592 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:53,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1519676927] [2022-02-20 14:31:53,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:53,592 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:53,609 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:53,610 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1146190054] [2022-02-20 14:31:53,610 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 14:31:53,610 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:53,610 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:53,615 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:31:53,616 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:31:53,691 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-02-20 14:31:53,691 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:31:53,692 INFO L263 TraceCheckSpWp]: Trace formula consists of 159 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 14:31:53,714 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:53,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:53,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {3341#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; {3341#true} is VALID [2022-02-20 14:31:53,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {3341#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {3341#true} is VALID [2022-02-20 14:31:53,863 INFO L290 TraceCheckUtils]: 2: Hoare triple {3341#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; {3341#true} is VALID [2022-02-20 14:31:53,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {3341#true} assume !(0 == assume_abort_if_not_~cond#1); {3341#true} is VALID [2022-02-20 14:31:53,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {3341#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:53,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:53,865 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:31:53,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,866 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,866 INFO L290 TraceCheckUtils]: 9: Hoare triple {3369#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,867 INFO L290 TraceCheckUtils]: 10: Hoare triple {3369#(<= ~N~0 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,867 INFO L290 TraceCheckUtils]: 11: Hoare triple {3369#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,867 INFO L290 TraceCheckUtils]: 12: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,867 INFO L290 TraceCheckUtils]: 13: Hoare triple {3369#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,868 INFO L290 TraceCheckUtils]: 14: Hoare triple {3369#(<= ~N~0 2)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,868 INFO L290 TraceCheckUtils]: 15: Hoare triple {3369#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:53,868 INFO L290 TraceCheckUtils]: 16: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 0; {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,869 INFO L290 TraceCheckUtils]: 18: Hoare triple {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,869 INFO L290 TraceCheckUtils]: 19: Hoare triple {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {3397#(and (<= 0 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,874 INFO L290 TraceCheckUtils]: 22: Hoare triple {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !(0 == __VERIFIER_assert_~cond#1); {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,875 INFO L290 TraceCheckUtils]: 23: Hoare triple {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,875 INFO L290 TraceCheckUtils]: 24: Hoare triple {3410#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3423#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} is VALID [2022-02-20 14:31:53,876 INFO L290 TraceCheckUtils]: 25: Hoare triple {3423#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 2))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3342#false} is VALID [2022-02-20 14:31:53,876 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#false} assume 0 == __VERIFIER_assert_~cond#1; {3342#false} is VALID [2022-02-20 14:31:53,877 INFO L290 TraceCheckUtils]: 27: Hoare triple {3342#false} assume !false; {3342#false} is VALID [2022-02-20 14:31:53,877 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:31:53,877 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:54,019 INFO L290 TraceCheckUtils]: 27: Hoare triple {3342#false} assume !false; {3342#false} is VALID [2022-02-20 14:31:54,020 INFO L290 TraceCheckUtils]: 26: Hoare triple {3342#false} assume 0 == __VERIFIER_assert_~cond#1; {3342#false} is VALID [2022-02-20 14:31:54,020 INFO L290 TraceCheckUtils]: 25: Hoare triple {3439#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3342#false} is VALID [2022-02-20 14:31:54,021 INFO L290 TraceCheckUtils]: 24: Hoare triple {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3439#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:31:54,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:54,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !(0 == __VERIFIER_assert_~cond#1); {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:54,022 INFO L290 TraceCheckUtils]: 21: Hoare triple {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:54,022 INFO L290 TraceCheckUtils]: 20: Hoare triple {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3443#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:31:54,023 INFO L290 TraceCheckUtils]: 19: Hoare triple {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:31:54,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !(0 == __VERIFIER_assert_~cond#1); {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:31:54,023 INFO L290 TraceCheckUtils]: 17: Hoare triple {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:31:54,024 INFO L290 TraceCheckUtils]: 16: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 0; {3456#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:31:54,024 INFO L290 TraceCheckUtils]: 15: Hoare triple {3369#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,025 INFO L290 TraceCheckUtils]: 14: Hoare triple {3369#(<= ~N~0 2)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,025 INFO L290 TraceCheckUtils]: 13: Hoare triple {3369#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,025 INFO L290 TraceCheckUtils]: 12: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,025 INFO L290 TraceCheckUtils]: 11: Hoare triple {3369#(<= ~N~0 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {3369#(<= ~N~0 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,027 INFO L290 TraceCheckUtils]: 9: Hoare triple {3369#(<= ~N~0 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,027 INFO L290 TraceCheckUtils]: 8: Hoare triple {3369#(<= ~N~0 2)} main_~i~0#1 := 1; {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,028 INFO L290 TraceCheckUtils]: 7: Hoare triple {3365#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !(main_~i~0#1 < ~N~0); {3369#(<= ~N~0 2)} is VALID [2022-02-20 14:31:54,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3365#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:31:54,033 INFO L290 TraceCheckUtils]: 5: Hoare triple {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:54,034 INFO L290 TraceCheckUtils]: 4: Hoare triple {3341#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {3358#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:31:54,034 INFO L290 TraceCheckUtils]: 3: Hoare triple {3341#true} assume !(0 == assume_abort_if_not_~cond#1); {3341#true} is VALID [2022-02-20 14:31:54,035 INFO L290 TraceCheckUtils]: 2: Hoare triple {3341#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; {3341#true} is VALID [2022-02-20 14:31:54,035 INFO L290 TraceCheckUtils]: 1: Hoare triple {3341#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {3341#true} is VALID [2022-02-20 14:31:54,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {3341#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; {3341#true} is VALID [2022-02-20 14:31:54,036 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:31:54,036 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:31:54,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1519676927] [2022-02-20 14:31:54,036 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:31:54,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1146190054] [2022-02-20 14:31:54,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1146190054] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:31:54,036 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:31:54,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 11 [2022-02-20 14:31:54,037 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [156704975] [2022-02-20 14:31:54,037 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:31:54,037 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 28 [2022-02-20 14:31:54,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:31:54,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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:31:54,067 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:31:54,067 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:31:54,067 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:31:54,067 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:31:54,067 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=75, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:31:54,068 INFO L87 Difference]: Start difference. First operand 61 states and 69 transitions. Second operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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:31:54,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:54,368 INFO L93 Difference]: Finished difference Result 87 states and 95 transitions. [2022-02-20 14:31:54,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 14:31:54,368 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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 28 [2022-02-20 14:31:54,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:31:54,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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:31:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2022-02-20 14:31:54,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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:31:54,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 72 transitions. [2022-02-20 14:31:54,369 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 72 transitions. [2022-02-20 14:31:54,419 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 72 edges. 72 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:31:54,420 INFO L225 Difference]: With dead ends: 87 [2022-02-20 14:31:54,420 INFO L226 Difference]: Without dead ends: 63 [2022-02-20 14:31:54,420 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 31 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=80, Invalid=160, Unknown=0, NotChecked=0, Total=240 [2022-02-20 14:31:54,421 INFO L933 BasicCegarLoop]: 16 mSDtfsCounter, 54 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 45 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 140 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 45 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:31:54,421 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 55 Invalid, 140 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [45 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:31:54,421 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2022-02-20 14:31:54,459 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 48. [2022-02-20 14:31:54,459 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:31:54,459 INFO L82 GeneralOperation]: Start isEquivalent. First operand 63 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:31:54,459 INFO L74 IsIncluded]: Start isIncluded. First operand 63 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:31:54,459 INFO L87 Difference]: Start difference. First operand 63 states. Second operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:31:54,460 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:54,460 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 14:31:54,460 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 14:31:54,460 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:54,460 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:54,461 INFO L74 IsIncluded]: Start isIncluded. First operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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 63 states. [2022-02-20 14:31:54,461 INFO L87 Difference]: Start difference. First operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 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 63 states. [2022-02-20 14:31:54,461 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:31:54,461 INFO L93 Difference]: Finished difference Result 63 states and 70 transitions. [2022-02-20 14:31:54,461 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 70 transitions. [2022-02-20 14:31:54,461 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:31:54,461 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:31:54,461 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:31:54,461 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:31:54,462 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 48 states, 47 states have (on average 1.1702127659574468) internal successors, (55), 47 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have 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:31:54,462 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 48 states to 48 states and 55 transitions. [2022-02-20 14:31:54,462 INFO L78 Accepts]: Start accepts. Automaton has 48 states and 55 transitions. Word has length 28 [2022-02-20 14:31:54,462 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:31:54,462 INFO L470 AbstractCegarLoop]: Abstraction has 48 states and 55 transitions. [2022-02-20 14:31:54,462 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.4545454545454546) internal successors, (38), 11 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:31:54,463 INFO L276 IsEmpty]: Start isEmpty. Operand 48 states and 55 transitions. [2022-02-20 14:31:54,463 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:31:54,463 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:31:54,463 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:31:54,482 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2022-02-20 14:31:54,673 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2022-02-20 14:31:54,673 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:31:54,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:31:54,673 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 3 times [2022-02-20 14:31:54,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:31:54,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777424312] [2022-02-20 14:31:54,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:31:54,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:31:54,700 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:31:54,700 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1568621472] [2022-02-20 14:31:54,700 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-02-20 14:31:54,700 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:31:54,700 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:31:54,701 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 14:31:54,702 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2022-02-20 14:31:54,790 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2022-02-20 14:31:54,790 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:31:54,792 INFO L263 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 50 conjunts are in the unsatisfiable core [2022-02-20 14:31:54,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:31:54,806 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:31:54,838 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:54,838 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 19 [2022-02-20 14:31:54,852 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:54,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:54,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:54,864 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 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 22 treesize of output 22 [2022-02-20 14:31:54,868 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:54,871 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:31:54,915 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:54,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 14:31:55,001 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:55,001 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 26 [2022-02-20 14:31:55,127 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,129 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:55,130 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 30 treesize of output 32 [2022-02-20 14:31:55,231 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,233 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:55,234 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 30 treesize of output 32 [2022-02-20 14:31:55,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,300 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,301 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,301 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:55,302 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:31:55,304 INFO L356 Elim1Store]: treesize reduction 38, result has 2.6 percent of original size [2022-02-20 14:31:55,305 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 49 treesize of output 57 [2022-02-20 14:31:55,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,421 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,422 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:31:55,423 INFO L356 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-02-20 14:31:55,424 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 49 treesize of output 46 [2022-02-20 14:31:55,767 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 14:31:55,767 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 58 treesize of output 34 [2022-02-20 14:31:55,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {3835#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; {3835#true} is VALID [2022-02-20 14:31:55,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3835#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {3835#true} is VALID [2022-02-20 14:31:55,805 INFO L290 TraceCheckUtils]: 2: Hoare triple {3835#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; {3835#true} is VALID [2022-02-20 14:31:55,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {3835#true} assume !(0 == assume_abort_if_not_~cond#1); {3835#true} is VALID [2022-02-20 14:31:55,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {3835#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,810 INFO L290 TraceCheckUtils]: 7: Hoare triple {3852#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (not (= |ULTIMATE.start_main_~b~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,810 INFO L290 TraceCheckUtils]: 8: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,811 INFO L290 TraceCheckUtils]: 9: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,811 INFO L290 TraceCheckUtils]: 10: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,812 INFO L290 TraceCheckUtils]: 11: Hoare triple {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,813 INFO L290 TraceCheckUtils]: 12: Hoare triple {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3879#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,813 INFO L290 TraceCheckUtils]: 13: Hoare triple {3879#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (<= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,814 INFO L290 TraceCheckUtils]: 14: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,814 INFO L290 TraceCheckUtils]: 15: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,815 INFO L290 TraceCheckUtils]: 16: Hoare triple {3862#(and (= 1 (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {3872#(and (= 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) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= |ULTIMATE.start_main_~b~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3895#(and (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))))) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {3895#(and (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))))) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3899#(and (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (- 16) (* |ULTIMATE.start_main_~i~0#1| 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (- 16) (* |ULTIMATE.start_main_~i~0#1| 8)))))))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,818 INFO L290 TraceCheckUtils]: 19: Hoare triple {3899#(and (= 1 (+ (- 1) |ULTIMATE.start_main_~i~0#1|)) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (- 16) (* |ULTIMATE.start_main_~i~0#1| 8))) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (- 16) (* |ULTIMATE.start_main_~i~0#1| 8)))))))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,819 INFO L290 TraceCheckUtils]: 20: Hoare triple {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,820 INFO L290 TraceCheckUtils]: 21: Hoare triple {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !(main_~i~0#1 < ~N~0); {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,821 INFO L290 TraceCheckUtils]: 22: Hoare triple {3903#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_~i~0#1 := 0; {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,822 INFO L290 TraceCheckUtils]: 23: Hoare triple {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume !(0 == __VERIFIER_assert_~cond#1); {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,823 INFO L290 TraceCheckUtils]: 25: Hoare triple {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} is VALID [2022-02-20 14:31:55,829 INFO L290 TraceCheckUtils]: 26: Hoare triple {3913#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))))))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3895#(and (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))))) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:31:55,830 INFO L290 TraceCheckUtils]: 27: Hoare triple {3895#(and (= |ULTIMATE.start_main_~i~0#1| 1) (exists ((|ULTIMATE.start_main_~b~0#1.base| Int)) (and (= (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) 0) 1) (= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (+ (* (- 1) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |ULTIMATE.start_main_~i~0#1| 8) (- 8)))) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))))) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3929#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:31:55,831 INFO L290 TraceCheckUtils]: 28: Hoare triple {3929#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3836#false} is VALID [2022-02-20 14:31:55,831 INFO L290 TraceCheckUtils]: 29: Hoare triple {3836#false} assume !false; {3836#false} is VALID [2022-02-20 14:31:55,831 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:31:55,831 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:31:58,362 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (select (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_727) .cse1)) 1)))) is different from false [2022-02-20 14:32:11,542 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719))) (let ((.cse2 (store (store (select .cse3 |c_ULTIMATE.start_main_~b~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723))) (let ((.cse0 (select (store .cse3 |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|)))))) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_727) .cse1)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|)))) is different from false [2022-02-20 14:32:12,231 INFO L290 TraceCheckUtils]: 29: Hoare triple {3836#false} assume !false; {3836#false} is VALID [2022-02-20 14:32:12,231 INFO L290 TraceCheckUtils]: 28: Hoare triple {3929#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {3836#false} is VALID [2022-02-20 14:32:12,232 INFO L290 TraceCheckUtils]: 27: Hoare triple {3942#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3929#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:32:12,234 INFO L290 TraceCheckUtils]: 26: Hoare triple {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} main_#t~post16#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post16#1;havoc main_#t~post16#1; {3942#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} is VALID [2022-02-20 14:32:12,234 INFO L290 TraceCheckUtils]: 25: Hoare triple {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume { :end_inline___VERIFIER_assert } true;havoc main_#t~mem17#1; {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:32:12,234 INFO L290 TraceCheckUtils]: 24: Hoare triple {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !(0 == __VERIFIER_assert_~cond#1); {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:32:12,235 INFO L290 TraceCheckUtils]: 23: Hoare triple {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:32:12,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} main_~i~0#1 := 0; {3946#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8)) (* (+ |ULTIMATE.start_main_~i~0#1| 1) (+ |ULTIMATE.start_main_~i~0#1| 1)))} is VALID [2022-02-20 14:32:12,236 INFO L290 TraceCheckUtils]: 21: Hoare triple {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} assume !(main_~i~0#1 < ~N~0); {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:32:12,236 INFO L290 TraceCheckUtils]: 20: Hoare triple {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:32:12,237 INFO L290 TraceCheckUtils]: 19: Hoare triple {3969#(forall ((v_ArrVal_727 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3959#(= (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)} is VALID [2022-02-20 14:32:12,239 INFO L290 TraceCheckUtils]: 18: Hoare triple {3973#(forall ((v_ArrVal_727 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {3969#(forall ((v_ArrVal_727 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,240 INFO L290 TraceCheckUtils]: 17: Hoare triple {3977#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))))) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {3973#(forall ((v_ArrVal_727 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,240 INFO L290 TraceCheckUtils]: 16: Hoare triple {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} main_~i~0#1 := 1; {3977#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) (- 8))))) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,241 INFO L290 TraceCheckUtils]: 15: Hoare triple {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} assume !(main_~i~0#1 < ~N~0); {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,241 INFO L290 TraceCheckUtils]: 14: Hoare triple {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,242 INFO L290 TraceCheckUtils]: 13: Hoare triple {3991#(forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (select (store (store (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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3981#(forall ((v_ArrVal_727 Int)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,244 INFO L290 TraceCheckUtils]: 12: Hoare triple {3995#(forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {3991#(forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (select (store (store (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| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))} is VALID [2022-02-20 14:32:12,245 INFO L290 TraceCheckUtils]: 11: Hoare triple {3999#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {3995#(forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1))))} is VALID [2022-02-20 14:32:12,246 INFO L290 TraceCheckUtils]: 10: Hoare triple {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} main_~i~0#1 := 1; {3999#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1)))} is VALID [2022-02-20 14:32:12,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} assume !(main_~i~0#1 < ~N~0); {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is VALID [2022-02-20 14:32:12,247 INFO L290 TraceCheckUtils]: 8: Hoare triple {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is VALID [2022-02-20 14:32:12,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4003#(forall ((v_ArrVal_720 Int) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|) (select (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| (store (store (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8)) 1) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is VALID [2022-02-20 14:32:12,250 INFO L290 TraceCheckUtils]: 6: Hoare triple {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is VALID [2022-02-20 14:32:12,254 WARN L290 TraceCheckUtils]: 5: Hoare triple {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is UNKNOWN [2022-02-20 14:32:12,255 INFO L290 TraceCheckUtils]: 4: Hoare triple {3835#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {4013#(forall ((v_ArrVal_720 Int) (v_ArrVal_719 (Array Int Int)) (v_ArrVal_727 Int) (|v_ULTIMATE.start_main_~i~0#1_97| Int) (v_ArrVal_723 Int)) (or (= 1 (select (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) (+ (select (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base| (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723)) |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|) (select (store (store (select (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_719) |ULTIMATE.start_main_~b~0#1.base|) (+ |ULTIMATE.start_main_~b~0#1.offset| 8) v_ArrVal_720) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723) |ULTIMATE.start_main_~b~0#1.offset|))) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_727) (+ |ULTIMATE.start_main_~c~0#1.offset| 8))) (not (<= 2 |v_ULTIMATE.start_main_~i~0#1_97|))))} is VALID [2022-02-20 14:32:12,255 INFO L290 TraceCheckUtils]: 3: Hoare triple {3835#true} assume !(0 == assume_abort_if_not_~cond#1); {3835#true} is VALID [2022-02-20 14:32:12,255 INFO L290 TraceCheckUtils]: 2: Hoare triple {3835#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; {3835#true} is VALID [2022-02-20 14:32:12,256 INFO L290 TraceCheckUtils]: 1: Hoare triple {3835#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {3835#true} is VALID [2022-02-20 14:32:12,256 INFO L290 TraceCheckUtils]: 0: Hoare triple {3835#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; {3835#true} is VALID [2022-02-20 14:32:12,256 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 1 trivial. 4 not checked. [2022-02-20 14:32:12,256 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:32:12,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777424312] [2022-02-20 14:32:12,256 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:32:12,256 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1568621472] [2022-02-20 14:32:12,257 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1568621472] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:32:12,257 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:32:12,257 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 23 [2022-02-20 14:32:12,257 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180484372] [2022-02-20 14:32:12,257 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:32:12,257 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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:32:12,258 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:32:12,258 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32:12,325 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 53 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 14:32:12,325 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 14:32:12,325 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:32:12,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 14:32:12,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=330, Unknown=20, NotChecked=78, Total=506 [2022-02-20 14:32:12,326 INFO L87 Difference]: Start difference. First operand 48 states and 55 transitions. Second operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32:17,140 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (select (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_727) .cse1)) 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~a~0#1.base|)) (= |c_ULTIMATE.start_main_~i~0#1| 1)) is different from false [2022-02-20 14:32:19,157 WARN L838 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_97| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_97|)) (forall ((v_ArrVal_727 Int) (v_ArrVal_723 Int)) (= (let ((.cse1 (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|))) (select (store (let ((.cse2 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_97| 8) |c_ULTIMATE.start_main_~b~0#1.offset|) v_ArrVal_723))) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| .cse2) |c_ULTIMATE.start_main_~c~0#1.base|))) (store .cse0 .cse1 (+ (select .cse2 |c_ULTIMATE.start_main_~b~0#1.offset|) (select .cse0 |c_ULTIMATE.start_main_~c~0#1.offset|))))) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_727) .cse1)) 1)))) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= 0 |c_ULTIMATE.start_main_~b~0#1.offset|) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base|) |c_ULTIMATE.start_main_~b~0#1.offset|) 1) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) is different from false [2022-02-20 14:32:22,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:22,069 INFO L93 Difference]: Finished difference Result 102 states and 118 transitions. [2022-02-20 14:32:22,069 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2022-02-20 14:32:22,069 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 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:32:22,069 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:32:22,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-02-20 14:32:22,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32:22,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 64 transitions. [2022-02-20 14:32:22,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 26 states and 64 transitions. [2022-02-20 14:32:22,158 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 64 edges. 64 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:32:22,159 INFO L225 Difference]: With dead ends: 102 [2022-02-20 14:32:22,159 INFO L226 Difference]: Without dead ends: 100 [2022-02-20 14:32:22,160 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 36 SyntacticMatches, 4 SemanticMatches, 30 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 171 ImplicationChecksByTransitivity, 24.4s TimeCoverageRelationStatistics Valid=148, Invalid=599, Unknown=25, NotChecked=220, Total=992 [2022-02-20 14:32:22,160 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 13 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 152 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 101 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:32:22,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 83 Invalid, 152 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 44 Invalid, 0 Unknown, 101 Unchecked, 0.0s Time] [2022-02-20 14:32:22,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2022-02-20 14:32:22,242 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 90. [2022-02-20 14:32:22,243 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:32:22,243 INFO L82 GeneralOperation]: Start isEquivalent. First operand 100 states. Second operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:32:22,243 INFO L74 IsIncluded]: Start isIncluded. First operand 100 states. Second operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:32:22,243 INFO L87 Difference]: Start difference. First operand 100 states. Second operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:32:22,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:22,245 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-02-20 14:32:22,245 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-02-20 14:32:22,245 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:32:22,245 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:32:22,246 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 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 100 states. [2022-02-20 14:32:22,246 INFO L87 Difference]: Start difference. First operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 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 100 states. [2022-02-20 14:32:22,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:22,247 INFO L93 Difference]: Finished difference Result 100 states and 116 transitions. [2022-02-20 14:32:22,247 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 116 transitions. [2022-02-20 14:32:22,247 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:32:22,247 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:32:22,248 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:32:22,248 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:32:22,248 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 89 states have (on average 1.202247191011236) internal successors, (107), 89 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have 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:32:22,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 107 transitions. [2022-02-20 14:32:22,249 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 107 transitions. Word has length 30 [2022-02-20 14:32:22,249 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:32:22,249 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 107 transitions. [2022-02-20 14:32:22,249 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.347826086956522) internal successors, (54), 23 states have internal predecessors, (54), 0 states have call successors, (0), 0 states have 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:32:22,249 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 107 transitions. [2022-02-20 14:32:22,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 14:32:22,250 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:32:22,251 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:32:22,268 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2022-02-20 14:32:22,471 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 14:32:22,471 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:32:22,471 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:32:22,472 INFO L85 PathProgramCache]: Analyzing trace with hash 2124248148, now seen corresponding path program 5 times [2022-02-20 14:32:22,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:32:22,472 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [114146002] [2022-02-20 14:32:22,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:32:22,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:32:22,497 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:32:22,497 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [743347602] [2022-02-20 14:32:22,497 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-02-20 14:32:22,498 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:32:22,498 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:32:22,501 INFO L229 MonitoredProcess]: Starting monitored process 13 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:32:22,502 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2022-02-20 14:32:22,613 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2022-02-20 14:32:22,614 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:32:22,615 INFO L263 TraceCheckSpWp]: Trace formula consists of 172 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:32:22,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:32:22,632 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:32:22,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {4526#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; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {4526#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {4526#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; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 3: Hoare triple {4526#true} assume !(0 == assume_abort_if_not_~cond#1); {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 4: Hoare triple {4526#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 5: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 6: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,792 INFO L290 TraceCheckUtils]: 7: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,793 INFO L290 TraceCheckUtils]: 8: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,793 INFO L290 TraceCheckUtils]: 9: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,793 INFO L290 TraceCheckUtils]: 10: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,793 INFO L290 TraceCheckUtils]: 11: Hoare triple {4526#true} assume !(main_~i~0#1 < ~N~0); {4526#true} is VALID [2022-02-20 14:32:22,793 INFO L290 TraceCheckUtils]: 12: Hoare triple {4526#true} main_~i~0#1 := 1; {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:32:22,794 INFO L290 TraceCheckUtils]: 13: Hoare triple {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:32:22,794 INFO L290 TraceCheckUtils]: 14: Hoare triple {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:32:22,795 INFO L290 TraceCheckUtils]: 15: Hoare triple {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:32:22,795 INFO L290 TraceCheckUtils]: 16: Hoare triple {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4581#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:32:22,796 INFO L290 TraceCheckUtils]: 17: Hoare triple {4581#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {4585#(<= ~N~0 3)} is VALID [2022-02-20 14:32:22,796 INFO L290 TraceCheckUtils]: 18: Hoare triple {4585#(<= ~N~0 3)} main_~i~0#1 := 1; {4589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:32:22,796 INFO L290 TraceCheckUtils]: 19: Hoare triple {4589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:32:22,797 INFO L290 TraceCheckUtils]: 20: Hoare triple {4589#(and (<= 1 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4596#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:32:22,798 INFO L290 TraceCheckUtils]: 21: Hoare triple {4596#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4596#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:32:22,798 INFO L290 TraceCheckUtils]: 22: Hoare triple {4596#(and (<= 2 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4603#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 23: Hoare triple {4603#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (<= ~N~0 3))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 24: Hoare triple {4527#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 25: Hoare triple {4527#false} assume !(main_~i~0#1 < ~N~0); {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 26: Hoare triple {4527#false} main_~i~0#1 := 0; {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 27: Hoare triple {4527#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 28: Hoare triple {4527#false} assume 0 == __VERIFIER_assert_~cond#1; {4527#false} is VALID [2022-02-20 14:32:22,799 INFO L290 TraceCheckUtils]: 29: Hoare triple {4527#false} assume !false; {4527#false} is VALID [2022-02-20 14:32:22,800 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:32:22,800 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 29: Hoare triple {4527#false} assume !false; {4527#false} is VALID [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 28: Hoare triple {4527#false} assume 0 == __VERIFIER_assert_~cond#1; {4527#false} is VALID [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 27: Hoare triple {4527#false} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {4527#false} is VALID [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 26: Hoare triple {4527#false} main_~i~0#1 := 0; {4527#false} is VALID [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 25: Hoare triple {4527#false} assume !(main_~i~0#1 < ~N~0); {4527#false} is VALID [2022-02-20 14:32:22,921 INFO L290 TraceCheckUtils]: 24: Hoare triple {4527#false} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4527#false} is VALID [2022-02-20 14:32:22,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {4643#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4527#false} is VALID [2022-02-20 14:32:22,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {4647#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4643#(not (< |ULTIMATE.start_main_~i~0#1| ~N~0))} is VALID [2022-02-20 14:32:22,923 INFO L290 TraceCheckUtils]: 21: Hoare triple {4647#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4647#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:32:22,923 INFO L290 TraceCheckUtils]: 20: Hoare triple {4654#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {4647#(<= ~N~0 (+ |ULTIMATE.start_main_~i~0#1| 1))} is VALID [2022-02-20 14:32:22,924 INFO L290 TraceCheckUtils]: 19: Hoare triple {4654#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {4654#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:32:22,924 INFO L290 TraceCheckUtils]: 18: Hoare triple {4585#(<= ~N~0 3)} main_~i~0#1 := 1; {4654#(<= ~N~0 (+ 2 |ULTIMATE.start_main_~i~0#1|))} is VALID [2022-02-20 14:32:22,924 INFO L290 TraceCheckUtils]: 17: Hoare triple {4581#(<= |ULTIMATE.start_main_~i~0#1| 3)} assume !(main_~i~0#1 < ~N~0); {4585#(<= ~N~0 3)} is VALID [2022-02-20 14:32:22,925 INFO L290 TraceCheckUtils]: 16: Hoare triple {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4581#(<= |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 14:32:22,925 INFO L290 TraceCheckUtils]: 15: Hoare triple {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:32:22,926 INFO L290 TraceCheckUtils]: 14: Hoare triple {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {4574#(<= |ULTIMATE.start_main_~i~0#1| 2)} is VALID [2022-02-20 14:32:22,926 INFO L290 TraceCheckUtils]: 13: Hoare triple {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:32:22,926 INFO L290 TraceCheckUtils]: 12: Hoare triple {4526#true} main_~i~0#1 := 1; {4567#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 14:32:22,926 INFO L290 TraceCheckUtils]: 11: Hoare triple {4526#true} assume !(main_~i~0#1 < ~N~0); {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 10: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 9: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 8: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {4526#true} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 5: Hoare triple {4526#true} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 4: Hoare triple {4526#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 3: Hoare triple {4526#true} assume !(0 == assume_abort_if_not_~cond#1); {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 2: Hoare triple {4526#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; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 1: Hoare triple {4526#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L290 TraceCheckUtils]: 0: Hoare triple {4526#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; {4526#true} is VALID [2022-02-20 14:32:22,927 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-02-20 14:32:22,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:32:22,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [114146002] [2022-02-20 14:32:22,928 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:32:22,928 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [743347602] [2022-02-20 14:32:22,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [743347602] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:32:22,928 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:32:22,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-02-20 14:32:22,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1865323705] [2022-02-20 14:32:22,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:32:22,928 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:32:22,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:32:22,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:22,952 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:32:22,952 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 14:32:22,952 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:32:22,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 14:32:22,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-02-20 14:32:22,952 INFO L87 Difference]: Start difference. First operand 90 states and 107 transitions. Second operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:23,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:23,346 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2022-02-20 14:32:23,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 14:32:23,346 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 14:32:23,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:32:23,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2022-02-20 14:32:23,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:23,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 104 transitions. [2022-02-20 14:32:23,347 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 104 transitions. [2022-02-20 14:32:23,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 104 edges. 104 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:32:23,421 INFO L225 Difference]: With dead ends: 139 [2022-02-20 14:32:23,421 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 14:32:23,422 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=99, Invalid=243, Unknown=0, NotChecked=0, Total=342 [2022-02-20 14:32:23,422 INFO L933 BasicCegarLoop]: 14 mSDtfsCounter, 79 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 57 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 57 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:32:23,422 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 58 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [57 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:32:23,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 14:32:23,471 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 63. [2022-02-20 14:32:23,472 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:32:23,472 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:32:23,472 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:32:23,473 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:32:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:23,474 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-02-20 14:32:23,474 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-02-20 14:32:23,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:32:23,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:32:23,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 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 101 states. [2022-02-20 14:32:23,476 INFO L87 Difference]: Start difference. First operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 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 101 states. [2022-02-20 14:32:23,477 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:32:23,477 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2022-02-20 14:32:23,477 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2022-02-20 14:32:23,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:32:23,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:32:23,478 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:32:23,478 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:32:23,478 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 63 states, 62 states have (on average 1.1451612903225807) internal successors, (71), 62 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have 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:32:23,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63 states to 63 states and 71 transitions. [2022-02-20 14:32:23,479 INFO L78 Accepts]: Start accepts. Automaton has 63 states and 71 transitions. Word has length 30 [2022-02-20 14:32:23,479 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:32:23,479 INFO L470 AbstractCegarLoop]: Abstraction has 63 states and 71 transitions. [2022-02-20 14:32:23,479 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.6666666666666665) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:23,479 INFO L276 IsEmpty]: Start isEmpty. Operand 63 states and 71 transitions. [2022-02-20 14:32:23,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 14:32:23,480 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:32:23,480 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:32:23,497 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2022-02-20 14:32:23,695 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 14:32:23,696 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:32:23,696 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:32:23,696 INFO L85 PathProgramCache]: Analyzing trace with hash -1505554158, now seen corresponding path program 6 times [2022-02-20 14:32:23,696 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:32:23,696 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2131262632] [2022-02-20 14:32:23,696 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:32:23,697 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:32:23,723 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:32:23,724 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [291855643] [2022-02-20 14:32:23,724 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2022-02-20 14:32:23,724 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:32:23,724 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:32:23,731 INFO L229 MonitoredProcess]: Starting monitored process 14 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:32:23,732 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2022-02-20 14:32:23,894 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 4 check-sat command(s) [2022-02-20 14:32:23,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 14:32:23,896 INFO L263 TraceCheckSpWp]: Trace formula consists of 179 conjuncts, 43 conjunts are in the unsatisfiable core [2022-02-20 14:32:23,907 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:32:23,908 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:32:24,048 INFO L356 Elim1Store]: treesize reduction 117, result has 35.4 percent of original size [2022-02-20 14:32:24,049 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 3 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 194 treesize of output 281 [2022-02-20 14:32:24,056 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:32:24,062 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:32:24,069 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2022-02-20 14:32:25,689 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:25,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:25,701 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:32:25,714 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:32:25,715 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 0 case distinctions, treesize of input 56 treesize of output 17 [2022-02-20 14:32:25,720 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:25,817 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:25,891 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:32:25,897 INFO L356 Elim1Store]: treesize reduction 13, result has 38.1 percent of original size [2022-02-20 14:32:25,897 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 3 case distinctions, treesize of input 96 treesize of output 67 [2022-02-20 14:32:25,910 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:26,058 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:26,191 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 14 treesize of output 12 [2022-02-20 14:32:26,260 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:26,265 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:26,292 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-20 14:32:26,292 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 110 treesize of output 113 [2022-02-20 14:32:26,300 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:26,304 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2022-02-20 14:32:26,371 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 14 treesize of output 16 [2022-02-20 14:32:26,410 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 14 treesize of output 16 [2022-02-20 14:32:26,447 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 14 treesize of output 16 [2022-02-20 14:32:26,465 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 14 treesize of output 16 [2022-02-20 14:32:26,498 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 14 treesize of output 16 [2022-02-20 14:32:26,542 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:26,543 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:32:26,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:26,566 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:32:26,600 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:32:26,600 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-02-20 14:32:26,653 INFO L290 TraceCheckUtils]: 0: Hoare triple {5206#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; {5206#true} is VALID [2022-02-20 14:32:26,653 INFO L290 TraceCheckUtils]: 1: Hoare triple {5206#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {5206#true} is VALID [2022-02-20 14:32:26,654 INFO L290 TraceCheckUtils]: 2: Hoare triple {5206#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; {5206#true} is VALID [2022-02-20 14:32:26,654 INFO L290 TraceCheckUtils]: 3: Hoare triple {5206#true} assume !(0 == assume_abort_if_not_~cond#1); {5206#true} is VALID [2022-02-20 14:32:26,662 WARN L290 TraceCheckUtils]: 4: Hoare triple {5206#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {5223#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_56 (Array Int Int))) (and (or (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (and (= v_DerPreprocessor_54 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base|)) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~b~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_51 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select v_DerPreprocessor_53 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~b~0#1.base|)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (and (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))) (= (select v_DerPreprocessor_56 |ULTIMATE.start_main_~c~0#1.offset|) 0))))} is UNKNOWN [2022-02-20 14:32:26,663 INFO L290 TraceCheckUtils]: 5: Hoare triple {5223#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (exists ((v_DerPreprocessor_56 (Array Int Int))) (and (or (and (exists ((v_DerPreprocessor_51 (Array Int Int)) (v_DerPreprocessor_52 (Array Int Int)) (v_DerPreprocessor_53 (Array Int Int)) (v_DerPreprocessor_54 (Array Int Int)) (v_DerPreprocessor_55 (Array Int Int))) (and (= v_DerPreprocessor_54 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base|)) (= (select |#memory_int| |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~b~0#1.base|) (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|)) (= v_DerPreprocessor_51 (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_51) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_52) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_53) |ULTIMATE.start_main_~a~0#1.base|)) (= (select v_DerPreprocessor_53 |ULTIMATE.start_main_~c~0#1.offset|) 0) (= (select |#memory_int| |ULTIMATE.start_main_~b~0#1.base|) (select (store (store (store (store (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~a~0#1.base| v_DerPreprocessor_54) |ULTIMATE.start_main_~b~0#1.base| v_DerPreprocessor_55) |ULTIMATE.start_main_~c~0#1.base| v_DerPreprocessor_56) |ULTIMATE.start_main_~b~0#1.base|)))) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))) (and (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))) (= (select v_DerPreprocessor_56 |ULTIMATE.start_main_~c~0#1.offset|) 0))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5227#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,664 INFO L290 TraceCheckUtils]: 6: Hoare triple {5227#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,665 INFO L290 TraceCheckUtils]: 7: Hoare triple {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,666 INFO L290 TraceCheckUtils]: 8: Hoare triple {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,667 INFO L290 TraceCheckUtils]: 9: Hoare triple {5231#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~a~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,667 INFO L290 TraceCheckUtils]: 10: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,667 INFO L290 TraceCheckUtils]: 11: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,668 INFO L290 TraceCheckUtils]: 12: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,669 INFO L290 TraceCheckUtils]: 14: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,670 INFO L290 TraceCheckUtils]: 16: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,671 INFO L290 TraceCheckUtils]: 17: Hoare triple {5241#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |ULTIMATE.start_main_~c~0#1.base| |ULTIMATE.start_main_~b~0#1.base|)) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,671 INFO L290 TraceCheckUtils]: 18: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,671 INFO L290 TraceCheckUtils]: 19: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,672 INFO L290 TraceCheckUtils]: 20: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 1; {5276#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,672 INFO L290 TraceCheckUtils]: 21: Hoare triple {5276#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5276#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,673 INFO L290 TraceCheckUtils]: 22: Hoare triple {5276#(and (= |ULTIMATE.start_main_~i~0#1| 1) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5283#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,673 INFO L290 TraceCheckUtils]: 23: Hoare triple {5283#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5283#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,674 INFO L290 TraceCheckUtils]: 24: Hoare triple {5283#(and (= 2 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5290#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,674 INFO L290 TraceCheckUtils]: 25: Hoare triple {5290#(and (<= 3 |ULTIMATE.start_main_~i~0#1|) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,675 INFO L290 TraceCheckUtils]: 26: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,675 INFO L290 TraceCheckUtils]: 27: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !(main_~i~0#1 < ~N~0); {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,675 INFO L290 TraceCheckUtils]: 28: Hoare triple {5266#(and (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} main_~i~0#1 := 0; {5303#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} is VALID [2022-02-20 14:32:26,676 INFO L290 TraceCheckUtils]: 29: Hoare triple {5303#(and (= |ULTIMATE.start_main_~i~0#1| 0) (= |ULTIMATE.start_main_~c~0#1.offset| 0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5307#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:32:26,676 INFO L290 TraceCheckUtils]: 30: Hoare triple {5307#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5207#false} is VALID [2022-02-20 14:32:26,676 INFO L290 TraceCheckUtils]: 31: Hoare triple {5207#false} assume !false; {5207#false} is VALID [2022-02-20 14:32:26,677 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:32:26,677 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:32:28,839 WARN L838 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (forall ((v_ArrVal_908 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) is different from false [2022-02-20 14:32:29,295 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_905) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) is different from false [2022-02-20 14:32:30,758 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_903) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_905) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) is different from false [2022-02-20 14:32:31,085 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_903) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_905) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) is different from false [2022-02-20 14:32:31,952 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |c_ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |c_ULTIMATE.start_main_~c~0#1.base|) (+ 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_903) (+ 16 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_905) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) is different from false [2022-02-20 14:32:32,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {5207#false} assume !false; {5207#false} is VALID [2022-02-20 14:32:32,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {5307#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {5207#false} is VALID [2022-02-20 14:32:32,812 INFO L290 TraceCheckUtils]: 29: Hoare triple {5320#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem17#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if main_#t~mem17#1 == main_~i~0#1 * main_~i~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {5307#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:32:32,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_~i~0#1 := 0; {5320#(= (* |ULTIMATE.start_main_~i~0#1| |ULTIMATE.start_main_~i~0#1|) (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8))))} is VALID [2022-02-20 14:32:32,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} assume !(main_~i~0#1 < ~N~0); {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:32:32,813 INFO L290 TraceCheckUtils]: 26: Hoare triple {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:32:32,814 INFO L290 TraceCheckUtils]: 25: Hoare triple {5334#(forall ((v_ArrVal_908 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5324#(= 0 (select (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) |ULTIMATE.start_main_~c~0#1.offset|))} is VALID [2022-02-20 14:32:32,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {5338#(forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (forall ((v_ArrVal_908 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5334#(forall ((v_ArrVal_908 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0))} is VALID [2022-02-20 14:32:32,816 INFO L290 TraceCheckUtils]: 23: Hoare triple {5342#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5338#(forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (forall ((v_ArrVal_908 Int)) (= (select (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0))))} is VALID [2022-02-20 14:32:32,818 INFO L290 TraceCheckUtils]: 22: Hoare triple {5346#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_119|))))} main_#t~post13#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post13#1;havoc main_#t~post13#1; {5342#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ |ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,822 INFO L290 TraceCheckUtils]: 21: Hoare triple {5350#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem14#1 := read~int(main_~c~0#1.base, main_~c~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem15#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem14#1 + main_#t~mem15#1, main_~c~0#1.base, main_~c~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem14#1;havoc main_#t~mem15#1; {5346#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (= (select (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0) (not (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_119|))))} is VALID [2022-02-20 14:32:32,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_~i~0#1 := 1; {5350#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ 2 |ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8)) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| (* |ULTIMATE.start_main_~i~0#1| 8) 8) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,824 INFO L290 TraceCheckUtils]: 19: Hoare triple {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !(main_~i~0#1 < ~N~0); {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,824 INFO L290 TraceCheckUtils]: 18: Hoare triple {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5354#(forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select |#memory_int| |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,829 WARN L290 TraceCheckUtils]: 15: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:32:32,830 INFO L290 TraceCheckUtils]: 14: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post10#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post10#1;havoc main_#t~post10#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,835 WARN L290 TraceCheckUtils]: 13: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem11#1 := read~int(main_~b~0#1.base, main_~b~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call main_#t~mem12#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(main_#t~mem11#1 + main_#t~mem12#1, main_~b~0#1.base, main_~b~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem11#1;havoc main_#t~mem12#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:32:32,836 INFO L290 TraceCheckUtils]: 12: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_~i~0#1 := 1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,836 INFO L290 TraceCheckUtils]: 11: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !(main_~i~0#1 < ~N~0); {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,837 INFO L290 TraceCheckUtils]: 10: Hoare triple {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,838 WARN L290 TraceCheckUtils]: 9: Hoare triple {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5364#(forall ((v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store |#memory_int| |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:32:32,839 INFO L290 TraceCheckUtils]: 8: Hoare triple {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,841 WARN L290 TraceCheckUtils]: 7: Hoare triple {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:32:32,842 INFO L290 TraceCheckUtils]: 6: Hoare triple {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} main_#t~post8#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,844 WARN L290 TraceCheckUtils]: 5: Hoare triple {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} assume !!(main_~i~0#1 < ~N~0);call main_#t~mem9#1 := read~int(main_~a~0#1.base, main_~a~0#1.offset + 8 * (main_~i~0#1 - 1), 8);call write~int(6 + main_#t~mem9#1, main_~a~0#1.base, main_~a~0#1.offset + 8 * main_~i~0#1, 8);havoc main_#t~mem9#1; {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is UNKNOWN [2022-02-20 14:32:32,846 INFO L290 TraceCheckUtils]: 4: Hoare triple {5206#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;call main_#t~malloc7#1.base, main_#t~malloc7#1.offset := #Ultimate.allocOnHeap(8 * ~N~0);main_~c~0#1.base, main_~c~0#1.offset := main_#t~malloc7#1.base, main_#t~malloc7#1.offset;havoc main_#t~malloc7#1.base, main_#t~malloc7#1.offset;call write~int(6, main_~a~0#1.base, main_~a~0#1.offset, 8);call write~int(1, main_~b~0#1.base, main_~b~0#1.offset, 8);call write~int(0, main_~c~0#1.base, main_~c~0#1.offset, 8);main_~i~0#1 := 1; {5389#(forall ((v_ArrVal_899 (Array Int Int)) (v_ArrVal_902 (Array Int Int)) (v_ArrVal_908 Int) (v_ArrVal_905 Int) (v_ArrVal_903 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= 3 |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (store (select (store (store |#memory_int| |ULTIMATE.start_main_~a~0#1.base| v_ArrVal_899) |ULTIMATE.start_main_~b~0#1.base| v_ArrVal_902) |ULTIMATE.start_main_~c~0#1.base|) (+ |ULTIMATE.start_main_~c~0#1.offset| 8) v_ArrVal_903) (+ |ULTIMATE.start_main_~c~0#1.offset| 16) v_ArrVal_905) (+ |ULTIMATE.start_main_~c~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_119|)) v_ArrVal_908) |ULTIMATE.start_main_~c~0#1.offset|) 0)))} is VALID [2022-02-20 14:32:32,846 INFO L290 TraceCheckUtils]: 3: Hoare triple {5206#true} assume !(0 == assume_abort_if_not_~cond#1); {5206#true} is VALID [2022-02-20 14:32:32,846 INFO L290 TraceCheckUtils]: 2: Hoare triple {5206#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; {5206#true} is VALID [2022-02-20 14:32:32,848 INFO L290 TraceCheckUtils]: 1: Hoare triple {5206#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~malloc7#1.base, main_#t~malloc7#1.offset, main_#t~mem9#1, main_#t~post8#1, main_#t~mem11#1, main_#t~mem12#1, main_#t~post10#1, main_#t~mem14#1, main_#t~mem15#1, main_#t~post13#1, main_#t~mem17#1, main_#t~post16#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, main_~c~0#1.base, main_~c~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; {5206#true} is VALID [2022-02-20 14:32:32,848 INFO L290 TraceCheckUtils]: 0: Hoare triple {5206#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; {5206#true} is VALID [2022-02-20 14:32:32,848 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 8 trivial. 15 not checked. [2022-02-20 14:32:32,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:32:32,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2131262632] [2022-02-20 14:32:32,848 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:32:32,849 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [291855643] [2022-02-20 14:32:32,849 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [291855643] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:32:32,849 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:32:32,849 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 22 [2022-02-20 14:32:32,850 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [841070078] [2022-02-20 14:32:32,850 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:32:32,850 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2022-02-20 14:32:32,858 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:32:32,858 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:32,926 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 46 inductive. 0 not inductive. 6 times theorem prover too weak to decide inductivity. [2022-02-20 14:32:32,926 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2022-02-20 14:32:32,926 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:32:32,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2022-02-20 14:32:32,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=196, Unknown=8, NotChecked=170, Total=462 [2022-02-20 14:32:32,926 INFO L87 Difference]: Start difference. First operand 63 states and 71 transitions. Second operand has 22 states, 22 states have (on average 2.3636363636363638) internal successors, (52), 22 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:32:35,254 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (= 2 |c_ULTIMATE.start_main_~i~0#1|) (not (= |c_ULTIMATE.start_main_~a~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (forall ((v_ArrVal_908 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0) (not (= |c_ULTIMATE.start_main_~b~0#1.base| |c_ULTIMATE.start_main_~c~0#1.base|))) is different from false [2022-02-20 14:32:37,376 WARN L838 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) |c_ULTIMATE.start_main_~c~0#1.offset|) 0) (forall ((v_ArrVal_908 Int) (v_ArrVal_905 Int) (|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (not (<= (+ 2 |c_ULTIMATE.start_main_~i~0#1|) |v_ULTIMATE.start_main_~i~0#1_119|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) 8 |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_905) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0))) (forall ((|v_ULTIMATE.start_main_~i~0#1_119| Int)) (or (forall ((v_ArrVal_908 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~c~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_119|) |c_ULTIMATE.start_main_~c~0#1.offset|) v_ArrVal_908) |c_ULTIMATE.start_main_~c~0#1.offset|) 0)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_119|)))) (= |c_ULTIMATE.start_main_~c~0#1.offset| 0)) is different from false