./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-patterns/array26_pattern.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-patterns/array26_pattern.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 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 14:23:58,679 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 14:23:58,681 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 14:23:58,701 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 14:23:58,702 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 14:23:58,703 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 14:23:58,703 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 14:23:58,705 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 14:23:58,706 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 14:23:58,706 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 14:23:58,707 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 14:23:58,708 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 14:23:58,708 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 14:23:58,709 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 14:23:58,709 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 14:23:58,710 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 14:23:58,711 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 14:23:58,711 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 14:23:58,712 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 14:23:58,714 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 14:23:58,715 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 14:23:58,728 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 14:23:58,729 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 14:23:58,729 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 14:23:58,731 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 14:23:58,731 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 14:23:58,731 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 14:23:58,732 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 14:23:58,732 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 14:23:58,733 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 14:23:58,733 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 14:23:58,734 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 14:23:58,734 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 14:23:58,735 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 14:23:58,735 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 14:23:58,736 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 14:23:58,736 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 14:23:58,736 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 14:23:58,737 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 14:23:58,737 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 14:23:58,738 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 14:23:58,738 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:23:58,752 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 14:23:58,752 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 14:23:58,752 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 14:23:58,753 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 14:23:58,753 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 14:23:58,753 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 14:23:58,754 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 14:23:58,754 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 14:23:58,754 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 14:23:58,754 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 14:23:58,754 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 14:23:58,754 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 14:23:58,755 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 14:23:58,756 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 14:23:58,756 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 14:23:58,756 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 14:23:58,756 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 14:23:58,756 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 14:23:58,756 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:58,757 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 14:23:58,757 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 14:23:58,758 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 14:23:58,758 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 14:23:58,758 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 -> 56ad35a361c83538323b9be55683beef9c8271c8f67221c1a0924c8496da71d0 [2022-02-20 14:23:58,911 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 14:23:58,924 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 14:23:58,926 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 14:23:58,926 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 14:23:58,927 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 14:23:58,928 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-patterns/array26_pattern.c [2022-02-20 14:23:58,965 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0fe7d8c/277967b52bdc4306b7842d9292fcee36/FLAG5c070456f [2022-02-20 14:23:59,420 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 14:23:59,421 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-patterns/array26_pattern.c [2022-02-20 14:23:59,425 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0fe7d8c/277967b52bdc4306b7842d9292fcee36/FLAG5c070456f [2022-02-20 14:23:59,436 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1e0fe7d8c/277967b52bdc4306b7842d9292fcee36 [2022-02-20 14:23:59,442 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 14:23:59,445 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 14:23:59,447 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:59,448 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 14:23:59,450 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 14:23:59,451 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,452 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@13de9ec3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59, skipping insertion in model container [2022-02-20 14:23:59,452 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,457 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 14:23:59,470 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 14:23:59,611 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-patterns/array26_pattern.c[1324,1337] [2022-02-20 14:23:59,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:59,656 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 14:23:59,669 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-patterns/array26_pattern.c[1324,1337] [2022-02-20 14:23:59,687 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 14:23:59,697 INFO L208 MainTranslator]: Completed translation [2022-02-20 14:23:59,698 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59 WrapperNode [2022-02-20 14:23:59,698 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 14:23:59,699 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:59,699 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 14:23:59,700 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 14:23:59,704 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:23:59" (1/1) ... [2022-02-20 14:23:59,716 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:23:59" (1/1) ... [2022-02-20 14:23:59,742 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 78 [2022-02-20 14:23:59,742 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 14:23:59,743 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 14:23:59,743 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 14:23:59,743 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 14:23:59,749 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,749 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,754 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,755 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,766 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,769 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,776 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,778 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 14:23:59,780 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 14:23:59,781 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 14:23:59,781 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 14:23:59,782 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (1/1) ... [2022-02-20 14:23:59,788 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 14:23:59,795 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:23:59,808 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:23:59,817 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:23:59,838 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 14:23:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 14:23:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 14:23:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 14:23:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 14:23:59,839 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 14:23:59,839 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 14:23:59,840 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 14:23:59,890 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 14:23:59,892 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 14:24:00,094 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 14:24:00,099 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 14:24:00,099 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 14:24:00,100 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:00 BoogieIcfgContainer [2022-02-20 14:24:00,100 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 14:24:00,101 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 14:24:00,101 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 14:24:00,104 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 14:24:00,104 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 02:23:59" (1/3) ... [2022-02-20 14:24:00,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58334e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:00, skipping insertion in model container [2022-02-20 14:24:00,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 02:23:59" (2/3) ... [2022-02-20 14:24:00,105 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@58334e7f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 02:24:00, skipping insertion in model container [2022-02-20 14:24:00,105 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 02:24:00" (3/3) ... [2022-02-20 14:24:00,106 INFO L111 eAbstractionObserver]: Analyzing ICFG array26_pattern.c [2022-02-20 14:24:00,110 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 14:24:00,110 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 14:24:00,149 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 14:24:00,160 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:24:00,160 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 14:24:00,172 INFO L276 IsEmpty]: Start isEmpty. Operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 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:24:00,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:00,175 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:00,175 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:00,176 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:00,180 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:00,180 INFO L85 PathProgramCache]: Analyzing trace with hash -320975489, now seen corresponding path program 1 times [2022-02-20 14:24:00,187 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:00,187 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [656359010] [2022-02-20 14:24:00,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:00,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:00,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:00,348 INFO L290 TraceCheckUtils]: 0: Hoare triple {26#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {26#true} is VALID [2022-02-20 14:24:00,349 INFO L290 TraceCheckUtils]: 1: Hoare triple {26#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {26#true} is VALID [2022-02-20 14:24:00,350 INFO L290 TraceCheckUtils]: 2: Hoare triple {26#true} assume 0 == assume_abort_if_not_~cond#1;assume false; {27#false} is VALID [2022-02-20 14:24:00,350 INFO L290 TraceCheckUtils]: 3: Hoare triple {27#false} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {27#false} is VALID [2022-02-20 14:24:00,350 INFO L290 TraceCheckUtils]: 4: Hoare triple {27#false} assume !true; {27#false} is VALID [2022-02-20 14:24:00,351 INFO L290 TraceCheckUtils]: 5: Hoare triple {27#false} main_~row~0#1 := 0; {27#false} is VALID [2022-02-20 14:24:00,359 INFO L290 TraceCheckUtils]: 6: Hoare triple {27#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {27#false} is VALID [2022-02-20 14:24:00,360 INFO L290 TraceCheckUtils]: 7: Hoare triple {27#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {27#false} is VALID [2022-02-20 14:24:00,360 INFO L290 TraceCheckUtils]: 8: Hoare triple {27#false} assume 0 == __VERIFIER_assert_~cond#1; {27#false} is VALID [2022-02-20 14:24:00,361 INFO L290 TraceCheckUtils]: 9: Hoare triple {27#false} assume !false; {27#false} is VALID [2022-02-20 14:24:00,362 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:24:00,363 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:00,363 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [656359010] [2022-02-20 14:24:00,364 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [656359010] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:00,365 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:00,365 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 14:24:00,368 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [326328189] [2022-02-20 14:24:00,368 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:00,373 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 14:24:00,377 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:00,379 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:00,399 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 14:24:00,400 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:00,413 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 14:24:00,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 14:24:00,415 INFO L87 Difference]: Start difference. First operand has 23 states, 21 states have (on average 1.619047619047619) internal successors, (34), 22 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 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,454 INFO L93 Difference]: Finished difference Result 43 states and 64 transitions. [2022-02-20 14:24:00,454 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 14:24:00,454 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 14:24:00,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:00,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,461 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:24:00,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 64 transitions. [2022-02-20 14:24:00,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 64 transitions. [2022-02-20 14:24:00,530 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:24:00,535 INFO L225 Difference]: With dead ends: 43 [2022-02-20 14:24:00,536 INFO L226 Difference]: Without dead ends: 19 [2022-02-20 14:24:00,538 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:24:00,541 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:24:00,542 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:24:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2022-02-20 14:24:00,560 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2022-02-20 14:24:00,561 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:00,561 INFO L82 GeneralOperation]: Start isEquivalent. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,562 INFO L74 IsIncluded]: Start isIncluded. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,563 INFO L87 Difference]: Start difference. First operand 19 states. Second operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,565 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:24:00,565 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:00,565 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:24:00,566 INFO L87 Difference]: Start difference. First operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 19 states. [2022-02-20 14:24:00,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,569 INFO L93 Difference]: Finished difference Result 19 states and 24 transitions. [2022-02-20 14:24:00,569 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:00,569 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,569 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:00,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:00,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.3333333333333333) internal successors, (24), 18 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 24 transitions. [2022-02-20 14:24:00,573 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 24 transitions. Word has length 10 [2022-02-20 14:24:00,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:00,574 INFO L470 AbstractCegarLoop]: Abstraction has 19 states and 24 transitions. [2022-02-20 14:24:00,574 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,574 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 24 transitions. [2022-02-20 14:24:00,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 14:24:00,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:00,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:00,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 14:24:00,576 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:00,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:00,577 INFO L85 PathProgramCache]: Analyzing trace with hash -1931938343, now seen corresponding path program 1 times [2022-02-20 14:24:00,577 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:00,577 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377030362] [2022-02-20 14:24:00,577 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:00,578 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:00,592 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:00,592 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [314935018] [2022-02-20 14:24:00,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:00,593 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:00,593 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:00,620 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:24:00,621 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:24:00,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:00,704 INFO L263 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 14:24:00,712 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:00,715 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:00,829 INFO L290 TraceCheckUtils]: 0: Hoare triple {144#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {144#true} is VALID [2022-02-20 14:24:00,829 INFO L290 TraceCheckUtils]: 1: Hoare triple {144#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {144#true} is VALID [2022-02-20 14:24:00,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {144#true} assume !(0 == assume_abort_if_not_~cond#1); {144#true} is VALID [2022-02-20 14:24:00,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {144#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:00,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:00,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_~row~0#1 := 0; {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:00,832 INFO L290 TraceCheckUtils]: 6: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:00,834 INFO L290 TraceCheckUtils]: 7: Hoare triple {158#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {171#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:00,834 INFO L290 TraceCheckUtils]: 8: Hoare triple {171#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {145#false} is VALID [2022-02-20 14:24:00,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {145#false} assume !false; {145#false} is VALID [2022-02-20 14:24:00,835 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:24:00,835 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:00,835 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:00,836 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377030362] [2022-02-20 14:24:00,836 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:00,837 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [314935018] [2022-02-20 14:24:00,839 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [314935018] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:00,839 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:00,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:00,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176692394] [2022-02-20 14:24:00,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:00,842 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 14:24:00,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:00,843 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,851 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:00,851 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:00,851 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:00,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:00,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:00,853 INFO L87 Difference]: Start difference. First operand 19 states and 24 transitions. Second operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,933 INFO L93 Difference]: Finished difference Result 26 states and 32 transitions. [2022-02-20 14:24:00,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:00,934 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 14:24:00,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:00,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:24:00,942 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,943 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 32 transitions. [2022-02-20 14:24:00,944 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 32 transitions. [2022-02-20 14:24:00,974 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:24:00,977 INFO L225 Difference]: With dead ends: 26 [2022-02-20 14:24:00,977 INFO L226 Difference]: Without dead ends: 22 [2022-02-20 14:24:00,977 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:00,979 INFO L933 BasicCegarLoop]: 22 mSDtfsCounter, 13 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 8 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 52 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 8 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:00,980 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 52 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 8 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:00,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2022-02-20 14:24:00,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 22. [2022-02-20 14:24:00,985 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:00,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,985 INFO L74 IsIncluded]: Start isIncluded. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,986 INFO L87 Difference]: Start difference. First operand 22 states. Second operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,987 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:24:00,987 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:00,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,988 INFO L74 IsIncluded]: Start isIncluded. First operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 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 22 states. [2022-02-20 14:24:00,988 INFO L87 Difference]: Start difference. First operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 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 22 states. [2022-02-20 14:24:00,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:00,989 INFO L93 Difference]: Finished difference Result 22 states and 28 transitions. [2022-02-20 14:24:00,989 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:00,990 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:00,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:00,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:00,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:00,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.3333333333333333) internal successors, (28), 21 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 28 transitions. [2022-02-20 14:24:00,992 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 28 transitions. Word has length 10 [2022-02-20 14:24:00,992 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:00,992 INFO L470 AbstractCegarLoop]: Abstraction has 22 states and 28 transitions. [2022-02-20 14:24:00,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.5) internal successors, (10), 4 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:00,992 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 28 transitions. [2022-02-20 14:24:00,993 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 14:24:00,993 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:00,993 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:01,015 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 14:24:01,212 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:24:01,212 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:01,213 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:01,213 INFO L85 PathProgramCache]: Analyzing trace with hash -94215630, now seen corresponding path program 1 times [2022-02-20 14:24:01,213 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:01,213 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622907175] [2022-02-20 14:24:01,214 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:01,245 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:01,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [230942515] [2022-02-20 14:24:01,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,246 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:01,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:01,267 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:24:01,271 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:24:01,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,321 INFO L263 TraceCheckSpWp]: Trace formula consists of 78 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:01,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:01,445 INFO L290 TraceCheckUtils]: 0: Hoare triple {283#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {283#true} is VALID [2022-02-20 14:24:01,445 INFO L290 TraceCheckUtils]: 1: Hoare triple {283#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {283#true} is VALID [2022-02-20 14:24:01,446 INFO L290 TraceCheckUtils]: 2: Hoare triple {283#true} assume !(0 == assume_abort_if_not_~cond#1); {283#true} is VALID [2022-02-20 14:24:01,446 INFO L290 TraceCheckUtils]: 3: Hoare triple {283#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {297#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:01,447 INFO L290 TraceCheckUtils]: 4: Hoare triple {297#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {301#(<= ~ARR_SIZE~0 0)} is VALID [2022-02-20 14:24:01,447 INFO L290 TraceCheckUtils]: 5: Hoare triple {301#(<= ~ARR_SIZE~0 0)} main_~row~0#1 := 0; {305#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} is VALID [2022-02-20 14:24:01,448 INFO L290 TraceCheckUtils]: 6: Hoare triple {305#(and (<= ~ARR_SIZE~0 0) (<= 0 |ULTIMATE.start_main_~row~0#1|))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {284#false} is VALID [2022-02-20 14:24:01,448 INFO L290 TraceCheckUtils]: 7: Hoare triple {284#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {284#false} is VALID [2022-02-20 14:24:01,448 INFO L290 TraceCheckUtils]: 8: Hoare triple {284#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {284#false} is VALID [2022-02-20 14:24:01,449 INFO L290 TraceCheckUtils]: 9: Hoare triple {284#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:24:01,449 INFO L290 TraceCheckUtils]: 10: Hoare triple {284#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {284#false} is VALID [2022-02-20 14:24:01,449 INFO L290 TraceCheckUtils]: 11: Hoare triple {284#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {284#false} is VALID [2022-02-20 14:24:01,449 INFO L290 TraceCheckUtils]: 12: Hoare triple {284#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {284#false} is VALID [2022-02-20 14:24:01,449 INFO L290 TraceCheckUtils]: 13: Hoare triple {284#false} assume 0 == __VERIFIER_assert_~cond#1; {284#false} is VALID [2022-02-20 14:24:01,450 INFO L290 TraceCheckUtils]: 14: Hoare triple {284#false} assume !false; {284#false} is VALID [2022-02-20 14:24:01,450 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 14:24:01,450 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:01,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622907175] [2022-02-20 14:24:01,451 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:01,451 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [230942515] [2022-02-20 14:24:01,451 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [230942515] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:01,451 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:01,451 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 14:24:01,452 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1164090820] [2022-02-20 14:24:01,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:01,452 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:24:01,453 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:01,453 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,464 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:01,464 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 14:24:01,464 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:01,465 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 14:24:01,465 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:01,465 INFO L87 Difference]: Start difference. First operand 22 states and 28 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,562 INFO L93 Difference]: Finished difference Result 54 states and 72 transitions. [2022-02-20 14:24:01,563 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 14:24:01,563 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2022-02-20 14:24:01,563 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:01,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:24:01,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 61 transitions. [2022-02-20 14:24:01,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 61 transitions. [2022-02-20 14:24:01,615 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:01,616 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:24:01,616 INFO L226 Difference]: Without dead ends: 34 [2022-02-20 14:24:01,616 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 11 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:24:01,617 INFO L933 BasicCegarLoop]: 15 mSDtfsCounter, 13 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:01,617 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 32 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:01,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2022-02-20 14:24:01,622 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 27. [2022-02-20 14:24:01,622 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:01,622 INFO L82 GeneralOperation]: Start isEquivalent. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,623 INFO L74 IsIncluded]: Start isIncluded. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,623 INFO L87 Difference]: Start difference. First operand 34 states. Second operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,624 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,624 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 14:24:01,624 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 14:24:01,624 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:01,625 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:01,625 INFO L74 IsIncluded]: Start isIncluded. First operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:24:01,625 INFO L87 Difference]: Start difference. First operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 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 34 states. [2022-02-20 14:24:01,626 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:01,626 INFO L93 Difference]: Finished difference Result 34 states and 44 transitions. [2022-02-20 14:24:01,626 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 44 transitions. [2022-02-20 14:24:01,627 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:01,627 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:01,627 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:01,627 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:01,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 26 states have (on average 1.3461538461538463) internal successors, (35), 26 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,628 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 35 transitions. [2022-02-20 14:24:01,628 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 35 transitions. Word has length 15 [2022-02-20 14:24:01,629 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:01,629 INFO L470 AbstractCegarLoop]: Abstraction has 27 states and 35 transitions. [2022-02-20 14:24:01,629 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:01,629 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 35 transitions. [2022-02-20 14:24:01,629 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 14:24:01,629 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:01,630 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:01,650 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:24:01,851 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:24:01,851 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:01,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:01,852 INFO L85 PathProgramCache]: Analyzing trace with hash -169454663, now seen corresponding path program 1 times [2022-02-20 14:24:01,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:01,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1273397563] [2022-02-20 14:24:01,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,853 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:01,864 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:01,864 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [904918281] [2022-02-20 14:24:01,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:01,865 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:01,865 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:01,884 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:24:01,926 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:24:01,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,976 INFO L263 TraceCheckSpWp]: Trace formula consists of 84 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 14:24:01,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:01,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:02,074 INFO L290 TraceCheckUtils]: 0: Hoare triple {511#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {511#true} is VALID [2022-02-20 14:24:02,074 INFO L290 TraceCheckUtils]: 1: Hoare triple {511#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {511#true} is VALID [2022-02-20 14:24:02,075 INFO L290 TraceCheckUtils]: 2: Hoare triple {511#true} assume !(0 == assume_abort_if_not_~cond#1); {511#true} is VALID [2022-02-20 14:24:02,075 INFO L290 TraceCheckUtils]: 3: Hoare triple {511#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {525#(<= 0 |ULTIMATE.start_main_~row~0#1|)} is VALID [2022-02-20 14:24:02,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {525#(<= 0 |ULTIMATE.start_main_~row~0#1|)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {529#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 5: Hoare triple {529#(and (< 0 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 6: Hoare triple {512#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {512#false} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 7: Hoare triple {512#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 8: Hoare triple {512#false} main_~row~0#1 := 0; {512#false} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 9: Hoare triple {512#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {512#false} is VALID [2022-02-20 14:24:02,077 INFO L290 TraceCheckUtils]: 10: Hoare triple {512#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {512#false} is VALID [2022-02-20 14:24:02,078 INFO L290 TraceCheckUtils]: 11: Hoare triple {512#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {512#false} is VALID [2022-02-20 14:24:02,078 INFO L290 TraceCheckUtils]: 12: Hoare triple {512#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:24:02,078 INFO L290 TraceCheckUtils]: 13: Hoare triple {512#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {512#false} is VALID [2022-02-20 14:24:02,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {512#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {512#false} is VALID [2022-02-20 14:24:02,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {512#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {512#false} is VALID [2022-02-20 14:24:02,079 INFO L290 TraceCheckUtils]: 16: Hoare triple {512#false} assume 0 == __VERIFIER_assert_~cond#1; {512#false} is VALID [2022-02-20 14:24:02,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {512#false} assume !false; {512#false} is VALID [2022-02-20 14:24:02,079 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:02,079 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 14:24:02,079 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:02,079 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1273397563] [2022-02-20 14:24:02,080 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:02,080 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [904918281] [2022-02-20 14:24:02,080 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [904918281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 14:24:02,080 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 14:24:02,080 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 14:24:02,080 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282594851] [2022-02-20 14:24:02,080 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 14:24:02,081 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,081 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:02,081 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,092 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:24:02,093 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 14:24:02,093 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:02,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 14:24:02,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 14:24:02,094 INFO L87 Difference]: Start difference. First operand 27 states and 35 transitions. Second operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,194 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,195 INFO L93 Difference]: Finished difference Result 54 states and 74 transitions. [2022-02-20 14:24:02,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 14:24:02,195 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,195 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:02,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:02,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 54 transitions. [2022-02-20 14:24:02,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 54 transitions. [2022-02-20 14:24:02,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 54 edges. 54 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:02,244 INFO L225 Difference]: With dead ends: 54 [2022-02-20 14:24:02,244 INFO L226 Difference]: Without dead ends: 36 [2022-02-20 14:24:02,244 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 14:24:02,245 INFO L933 BasicCegarLoop]: 10 mSDtfsCounter, 27 mSDsluCounter, 7 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 17 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:02,245 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [27 Valid, 17 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 14:24:02,246 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2022-02-20 14:24:02,261 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 30. [2022-02-20 14:24:02,261 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:02,262 INFO L82 GeneralOperation]: Start isEquivalent. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:24:02,262 INFO L74 IsIncluded]: Start isIncluded. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:24:02,262 INFO L87 Difference]: Start difference. First operand 36 states. Second operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:24:02,263 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,263 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:24:02,263 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:24:02,264 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:02,264 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:02,264 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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) Second operand 36 states. [2022-02-20 14:24:02,264 INFO L87 Difference]: Start difference. First operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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) Second operand 36 states. [2022-02-20 14:24:02,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:02,265 INFO L93 Difference]: Finished difference Result 36 states and 45 transitions. [2022-02-20 14:24:02,265 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 45 transitions. [2022-02-20 14:24:02,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:02,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:02,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:02,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:02,266 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.3103448275862069) internal successors, (38), 29 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:24:02,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 38 transitions. [2022-02-20 14:24:02,267 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 38 transitions. Word has length 18 [2022-02-20 14:24:02,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:02,267 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 38 transitions. [2022-02-20 14:24:02,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.5) internal successors, (18), 4 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:24:02,268 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 38 transitions. [2022-02-20 14:24:02,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 14:24:02,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:02,268 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:02,288 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-02-20 14:24:02,488 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:24:02,489 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:02,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:02,489 INFO L85 PathProgramCache]: Analyzing trace with hash -308201553, now seen corresponding path program 1 times [2022-02-20 14:24:02,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:02,489 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1931595553] [2022-02-20 14:24:02,489 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:02,489 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:02,503 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:02,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1911616741] [2022-02-20 14:24:02,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:02,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:02,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:02,505 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:24:02,506 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:24:02,546 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:02,547 INFO L263 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 14:24:02,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:02,555 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:02,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {753#true} is VALID [2022-02-20 14:24:02,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {761#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} is VALID [2022-02-20 14:24:02,704 INFO L290 TraceCheckUtils]: 2: Hoare triple {761#(or (and (not (< 1 ~ARR_SIZE~0)) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) (and (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 1) (< 1 ~ARR_SIZE~0)))} assume !(0 == assume_abort_if_not_~cond#1); {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,704 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,705 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:02,705 INFO L290 TraceCheckUtils]: 5: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:02,706 INFO L290 TraceCheckUtils]: 6: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} is VALID [2022-02-20 14:24:02,711 INFO L290 TraceCheckUtils]: 7: Hoare triple {772#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {782#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} is VALID [2022-02-20 14:24:02,712 INFO L290 TraceCheckUtils]: 8: Hoare triple {782#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~column~0#1| 1))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,712 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {754#false} is VALID [2022-02-20 14:24:02,712 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,712 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#false} main_~row~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {754#false} is VALID [2022-02-20 14:24:02,713 INFO L290 TraceCheckUtils]: 17: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,714 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {754#false} is VALID [2022-02-20 14:24:02,714 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume 0 == __VERIFIER_assert_~cond#1; {754#false} is VALID [2022-02-20 14:24:02,714 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 14:24:02,714 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:02,714 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:02,850 INFO L290 TraceCheckUtils]: 20: Hoare triple {754#false} assume !false; {754#false} is VALID [2022-02-20 14:24:02,851 INFO L290 TraceCheckUtils]: 19: Hoare triple {754#false} assume 0 == __VERIFIER_assert_~cond#1; {754#false} is VALID [2022-02-20 14:24:02,851 INFO L290 TraceCheckUtils]: 18: Hoare triple {754#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {754#false} is VALID [2022-02-20 14:24:02,851 INFO L290 TraceCheckUtils]: 17: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,851 INFO L290 TraceCheckUtils]: 16: Hoare triple {754#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 15: Hoare triple {754#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 14: Hoare triple {754#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 13: Hoare triple {754#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 12: Hoare triple {754#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 11: Hoare triple {754#false} main_~row~0#1 := 0; {754#false} is VALID [2022-02-20 14:24:02,852 INFO L290 TraceCheckUtils]: 10: Hoare triple {754#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,853 INFO L290 TraceCheckUtils]: 9: Hoare triple {754#false} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {754#false} is VALID [2022-02-20 14:24:02,853 INFO L290 TraceCheckUtils]: 8: Hoare triple {858#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {754#false} is VALID [2022-02-20 14:24:02,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {858#(< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,854 INFO L290 TraceCheckUtils]: 5: Hoare triple {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,855 INFO L290 TraceCheckUtils]: 4: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {862#(< (+ |ULTIMATE.start_main_~column~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,855 INFO L290 TraceCheckUtils]: 3: Hoare triple {765#(< 1 ~ARR_SIZE~0)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,856 INFO L290 TraceCheckUtils]: 2: Hoare triple {878#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} assume !(0 == assume_abort_if_not_~cond#1); {765#(< 1 ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:02,856 INFO L290 TraceCheckUtils]: 1: Hoare triple {753#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {878#(or (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_assume_abort_if_not_~cond#1| 0))} is VALID [2022-02-20 14:24:02,857 INFO L290 TraceCheckUtils]: 0: Hoare triple {753#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {753#true} is VALID [2022-02-20 14:24:02,857 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 14:24:02,857 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:02,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1931595553] [2022-02-20 14:24:02,857 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:02,857 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1911616741] [2022-02-20 14:24:02,858 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1911616741] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:02,858 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:02,858 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 9 [2022-02-20 14:24:02,858 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237746274] [2022-02-20 14:24:02,858 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:02,859 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:02,859 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:02,859 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:02,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:02,882 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 14:24:02,882 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:02,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 14:24:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 14:24:02,883 INFO L87 Difference]: Start difference. First operand 30 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,148 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:03,148 INFO L93 Difference]: Finished difference Result 65 states and 86 transitions. [2022-02-20 14:24:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 14:24:03,149 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 14:24:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,149 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 14:24:03,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 62 transitions. [2022-02-20 14:24:03,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 62 transitions. [2022-02-20 14:24:03,199 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:24:03,200 INFO L225 Difference]: With dead ends: 65 [2022-02-20 14:24:03,200 INFO L226 Difference]: Without dead ends: 45 [2022-02-20 14:24:03,200 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=59, Invalid=97, Unknown=0, NotChecked=0, Total=156 [2022-02-20 14:24:03,201 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 94 mSDsluCounter, 24 mSDsCounter, 0 mSdLazyCounter, 70 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 94 SdHoareTripleChecker+Valid, 32 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 70 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:03,201 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [94 Valid, 32 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 70 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 14:24:03,202 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2022-02-20 14:24:03,224 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 40. [2022-02-20 14:24:03,224 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:03,224 INFO L82 GeneralOperation]: Start isEquivalent. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,225 INFO L74 IsIncluded]: Start isIncluded. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,225 INFO L87 Difference]: Start difference. First operand 45 states. Second operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,226 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:03,226 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:24:03,226 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:24:03,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:03,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:03,227 INFO L74 IsIncluded]: Start isIncluded. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:24:03,227 INFO L87 Difference]: Start difference. First operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 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 45 states. [2022-02-20 14:24:03,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:03,228 INFO L93 Difference]: Finished difference Result 45 states and 57 transitions. [2022-02-20 14:24:03,228 INFO L276 IsEmpty]: Start isEmpty. Operand 45 states and 57 transitions. [2022-02-20 14:24:03,228 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:03,228 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:03,229 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:03,229 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:03,229 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 40 states, 39 states have (on average 1.3076923076923077) internal successors, (51), 39 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,230 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 40 states to 40 states and 51 transitions. [2022-02-20 14:24:03,230 INFO L78 Accepts]: Start accepts. Automaton has 40 states and 51 transitions. Word has length 21 [2022-02-20 14:24:03,230 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:03,230 INFO L470 AbstractCegarLoop]: Abstraction has 40 states and 51 transitions. [2022-02-20 14:24:03,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.111111111111111) internal successors, (28), 9 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:03,230 INFO L276 IsEmpty]: Start isEmpty. Operand 40 states and 51 transitions. [2022-02-20 14:24:03,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 14:24:03,231 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:03,231 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:03,258 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:24:03,445 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:24:03,445 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:03,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:03,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1610723178, now seen corresponding path program 1 times [2022-02-20 14:24:03,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:03,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1760389166] [2022-02-20 14:24:03,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:03,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:03,462 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:03,463 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [2080061580] [2022-02-20 14:24:03,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:03,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:03,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:03,464 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:24:03,465 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:24:03,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:03,506 INFO L263 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 14:24:03,513 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:03,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:03,673 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1120#true} is VALID [2022-02-20 14:24:03,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1120#true} is VALID [2022-02-20 14:24:03,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume !(0 == assume_abort_if_not_~cond#1); {1120#true} is VALID [2022-02-20 14:24:03,674 INFO L290 TraceCheckUtils]: 3: Hoare triple {1120#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:03,674 INFO L290 TraceCheckUtils]: 4: Hoare triple {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:03,675 INFO L290 TraceCheckUtils]: 5: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:03,676 INFO L290 TraceCheckUtils]: 6: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:03,676 INFO L290 TraceCheckUtils]: 7: Hoare triple {1138#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 0 |ULTIMATE.start_main_~column~0#1|))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1148#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} is VALID [2022-02-20 14:24:03,677 INFO L290 TraceCheckUtils]: 8: Hoare triple {1148#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (<= 1 |ULTIMATE.start_main_~column~0#1|))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:03,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:03,678 INFO L290 TraceCheckUtils]: 10: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:03,680 INFO L290 TraceCheckUtils]: 11: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:03,681 INFO L290 TraceCheckUtils]: 12: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} is VALID [2022-02-20 14:24:03,681 INFO L290 TraceCheckUtils]: 13: Hoare triple {1152#(and (<= |ULTIMATE.start_main_~row~0#1| 0) (< 1 ~ARR_SIZE~0))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1168#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 14: Hoare triple {1168#(and (< 1 ~ARR_SIZE~0) (<= |ULTIMATE.start_main_~row~0#1| 1))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#false} main_~row~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 18: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:03,682 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 20: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1121#false} is VALID [2022-02-20 14:24:03,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#false} assume 0 == __VERIFIER_assert_~cond#1; {1121#false} is VALID [2022-02-20 14:24:03,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-02-20 14:24:03,684 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:03,684 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:03,815 INFO L290 TraceCheckUtils]: 26: Hoare triple {1121#false} assume !false; {1121#false} is VALID [2022-02-20 14:24:03,815 INFO L290 TraceCheckUtils]: 25: Hoare triple {1121#false} assume 0 == __VERIFIER_assert_~cond#1; {1121#false} is VALID [2022-02-20 14:24:03,815 INFO L290 TraceCheckUtils]: 24: Hoare triple {1121#false} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1121#false} is VALID [2022-02-20 14:24:03,815 INFO L290 TraceCheckUtils]: 23: Hoare triple {1121#false} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,815 INFO L290 TraceCheckUtils]: 22: Hoare triple {1121#false} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 21: Hoare triple {1121#false} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 20: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 19: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 18: Hoare triple {1121#false} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {1121#false} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#false} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:03,816 INFO L290 TraceCheckUtils]: 15: Hoare triple {1121#false} main_~row~0#1 := 0; {1121#false} is VALID [2022-02-20 14:24:03,817 INFO L290 TraceCheckUtils]: 14: Hoare triple {1244#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1121#false} is VALID [2022-02-20 14:24:03,817 INFO L290 TraceCheckUtils]: 13: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1244#(< |ULTIMATE.start_main_~row~0#1| ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,818 INFO L290 TraceCheckUtils]: 12: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,819 INFO L290 TraceCheckUtils]: 9: Hoare triple {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,819 INFO L290 TraceCheckUtils]: 8: Hoare triple {1264#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1248#(< (+ |ULTIMATE.start_main_~row~0#1| 1) ~ARR_SIZE~0)} is VALID [2022-02-20 14:24:03,820 INFO L290 TraceCheckUtils]: 7: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1264#(<= (+ |ULTIMATE.start_main_~row~0#1| 1) |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:03,820 INFO L290 TraceCheckUtils]: 6: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:03,820 INFO L290 TraceCheckUtils]: 5: Hoare triple {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:03,821 INFO L290 TraceCheckUtils]: 4: Hoare triple {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1268#(<= |ULTIMATE.start_main_~row~0#1| |ULTIMATE.start_main_~column~0#1|)} is VALID [2022-02-20 14:24:03,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {1120#true} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1134#(<= |ULTIMATE.start_main_~row~0#1| 0)} is VALID [2022-02-20 14:24:03,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {1120#true} assume !(0 == assume_abort_if_not_~cond#1); {1120#true} is VALID [2022-02-20 14:24:03,822 INFO L290 TraceCheckUtils]: 1: Hoare triple {1120#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1120#true} is VALID [2022-02-20 14:24:03,822 INFO L290 TraceCheckUtils]: 0: Hoare triple {1120#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1120#true} is VALID [2022-02-20 14:24:03,822 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 14:24:03,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:24:03,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1760389166] [2022-02-20 14:24:03,822 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:24:03,823 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2080061580] [2022-02-20 14:24:03,823 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2080061580] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 14:24:03,823 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 14:24:03,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 11 [2022-02-20 14:24:03,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2077602985] [2022-02-20 14:24:03,823 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 14:24:03,824 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 27 [2022-02-20 14:24:03,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 14:24:03,824 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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:24:03,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:03,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 14:24:03,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 14:24:03,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 14:24:03,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 14:24:03,866 INFO L87 Difference]: Start difference. First operand 40 states and 51 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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:24:04,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:04,498 INFO L93 Difference]: Finished difference Result 113 states and 152 transitions. [2022-02-20 14:24:04,498 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 14:24:04,499 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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) Word has length 27 [2022-02-20 14:24:04,499 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 14:24:04,499 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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:24:04,500 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions. [2022-02-20 14:24:04,500 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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:24:04,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 110 transitions. [2022-02-20 14:24:04,501 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 110 transitions. [2022-02-20 14:24:04,603 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 14:24:04,604 INFO L225 Difference]: With dead ends: 113 [2022-02-20 14:24:04,604 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 14:24:04,605 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 43 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 84 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-02-20 14:24:04,605 INFO L933 BasicCegarLoop]: 8 mSDtfsCounter, 97 mSDsluCounter, 18 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 26 SdHoareTripleChecker+Invalid, 193 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 14:24:04,606 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 26 Invalid, 193 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 14:24:04,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 14:24:04,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 67. [2022-02-20 14:24:04,656 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 14:24:04,657 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:04,657 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:04,657 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:04,659 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:04,659 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 14:24:04,659 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-02-20 14:24:04,659 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:04,659 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:04,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 states. [2022-02-20 14:24:04,660 INFO L87 Difference]: Start difference. First operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 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 88 states. [2022-02-20 14:24:04,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 14:24:04,662 INFO L93 Difference]: Finished difference Result 88 states and 115 transitions. [2022-02-20 14:24:04,662 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 115 transitions. [2022-02-20 14:24:04,662 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 14:24:04,662 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 14:24:04,662 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 14:24:04,662 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 14:24:04,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 66 states have (on average 1.3333333333333333) internal successors, (88), 66 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 14:24:04,664 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 88 transitions. [2022-02-20 14:24:04,664 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 88 transitions. Word has length 27 [2022-02-20 14:24:04,664 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 14:24:04,664 INFO L470 AbstractCegarLoop]: Abstraction has 67 states and 88 transitions. [2022-02-20 14:24:04,664 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 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:24:04,664 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 88 transitions. [2022-02-20 14:24:04,665 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 14:24:04,665 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 14:24:04,665 INFO L514 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 14:24:04,682 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:24:04,879 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:24:04,879 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 14:24:04,880 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 14:24:04,880 INFO L85 PathProgramCache]: Analyzing trace with hash -1943339208, now seen corresponding path program 1 times [2022-02-20 14:24:04,880 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 14:24:04,880 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611740375] [2022-02-20 14:24:04,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:04,880 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 14:24:04,913 ERROR L252 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-02-20 14:24:04,920 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1503268653] [2022-02-20 14:24:04,920 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 14:24:04,920 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 14:24:04,921 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 14:24:04,922 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:24:04,922 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:24:05,211 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:05,213 INFO L263 TraceCheckSpWp]: Trace formula consists of 156 conjuncts, 65 conjunts are in the unsatisfiable core [2022-02-20 14:24:05,234 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 14:24:05,235 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 14:24:05,425 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 61 treesize of output 56 [2022-02-20 14:24:05,433 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 19 treesize of output 18 [2022-02-20 14:24:05,443 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 21 treesize of output 20 [2022-02-20 14:24:05,660 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 75 [2022-02-20 14:24:05,671 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:05,672 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:05,673 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:05,675 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 163 [2022-02-20 14:24:05,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:05,755 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:05,756 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 14:24:05,758 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 105 treesize of output 28 [2022-02-20 14:24:06,134 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 100 treesize of output 91 [2022-02-20 14:24:06,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,144 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,147 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,149 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 6 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 196 [2022-02-20 14:24:06,519 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 69 [2022-02-20 14:24:06,524 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,525 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,529 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,530 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,531 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,532 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:06,534 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 3 select indices, 3 select index equivalence classes, 10 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 0 case distinctions, treesize of input 68 treesize of output 145 [2022-02-20 14:24:07,735 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,738 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,741 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,743 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 14:24:07,745 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:07,746 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 101 treesize of output 39 [2022-02-20 14:24:07,827 INFO L290 TraceCheckUtils]: 0: Hoare triple {1729#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(18, 2);call #Ultimate.allocInit(12, 3);~ARR_SIZE~0 := 0; {1729#true} is VALID [2022-02-20 14:24:07,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {1729#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~post6#1, main_#t~post5#1, main_#t~mem9#1, main_#t~post8#1, main_#t~post7#1, main_~#array~0#1.base, main_~#array~0#1.offset, main_~row~0#1, main_~column~0#1, main_~num~0#1, main_~value~0#1, main_~sum~0#1;assume -32768 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 32767;~ARR_SIZE~0 := main_#t~nondet4#1;havoc main_#t~nondet4#1;assume { :begin_inline_assume_abort_if_not } true;assume_abort_if_not_#in~cond#1 := (if ~ARR_SIZE~0 > 1 then 1 else 0);havoc assume_abort_if_not_~cond#1;assume_abort_if_not_~cond#1 := assume_abort_if_not_#in~cond#1; {1737#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:24:07,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {1737#(<= ~ARR_SIZE~0 32767)} assume !(0 == assume_abort_if_not_~cond#1); {1737#(<= ~ARR_SIZE~0 32767)} is VALID [2022-02-20 14:24:07,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {1737#(<= ~ARR_SIZE~0 32767)} assume { :end_inline_assume_abort_if_not } true;call main_~#array~0#1.base, main_~#array~0#1.offset := #Ultimate.allocOnStack(4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296) * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296));main_~row~0#1 := 0;main_~column~0#1 := 0;main_~num~0#1 := -1;main_~value~0#1 := 1;main_~sum~0#1 := 0;main_~row~0#1 := 0; {1744#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {1744#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,830 INFO L290 TraceCheckUtils]: 6: Hoare triple {1748#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~value~0#1| 1) (= (- 1) |ULTIMATE.start_main_~num~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (<= ~ARR_SIZE~0 32767))} assume 0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {1755#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {1755#(and (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~sum~0#1| 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1759#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {1759#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,832 INFO L290 TraceCheckUtils]: 9: Hoare triple {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,833 INFO L290 TraceCheckUtils]: 10: Hoare triple {1763#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1770#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,834 INFO L290 TraceCheckUtils]: 11: Hoare triple {1770#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4) (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (< |ULTIMATE.start_main_~column~0#1| ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1774#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (< 1 ~ARR_SIZE~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} is VALID [2022-02-20 14:24:07,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {1774#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (<= |ULTIMATE.start_main_~column~0#1| 2) (< 1 ~ARR_SIZE~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 32767))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1778#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {1778#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= 0 (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4)))))) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* |ULTIMATE.start_main_~row~0#1| (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1782#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,836 INFO L290 TraceCheckUtils]: 14: Hoare triple {1782#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,837 INFO L290 TraceCheckUtils]: 15: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,837 INFO L290 TraceCheckUtils]: 16: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,840 INFO L290 TraceCheckUtils]: 17: Hoare triple {1786#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !(1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2));call write~int(0, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4); {1796#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,841 INFO L290 TraceCheckUtils]: 18: Hoare triple {1796#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,842 INFO L290 TraceCheckUtils]: 19: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !!(main_~column~0#1 < ~ARR_SIZE~0); {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,843 INFO L290 TraceCheckUtils]: 20: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume !(0 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 0 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2)); {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} is VALID [2022-02-20 14:24:07,848 INFO L290 TraceCheckUtils]: 21: Hoare triple {1800#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (= |ULTIMATE.start_main_~sum~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4 (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| (* (+ (- 1) |ULTIMATE.start_main_~row~0#1|) (+ (- 17179869184) (* (mod ~ARR_SIZE~0 4294967296) 4))))) 1) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (+ |ULTIMATE.start_main_~value~0#1| 1) 0) (<= ~ARR_SIZE~0 2))} assume 1 == (if main_~row~0#1 < 0 && 0 != main_~row~0#1 % 2 then main_~row~0#1 % 2 - 2 else main_~row~0#1 % 2) && 1 == (if main_~column~0#1 < 0 && 0 != main_~column~0#1 % 2 then main_~column~0#1 % 2 - 2 else main_~column~0#1 % 2);call write~int(main_~value~0#1, main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~value~0#1 := main_~value~0#1 * main_~num~0#1; {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,849 INFO L290 TraceCheckUtils]: 22: Hoare triple {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post6#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post6#1;havoc main_#t~post6#1; {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,850 INFO L290 TraceCheckUtils]: 23: Hoare triple {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,850 INFO L290 TraceCheckUtils]: 24: Hoare triple {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post5#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post5#1;havoc main_#t~post5#1; {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,851 INFO L290 TraceCheckUtils]: 25: Hoare triple {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,852 INFO L290 TraceCheckUtils]: 26: Hoare triple {1810#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_~row~0#1 := 0; {1826#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,852 INFO L290 TraceCheckUtils]: 27: Hoare triple {1826#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1830#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,853 INFO L290 TraceCheckUtils]: 28: Hoare triple {1830#(and (= |ULTIMATE.start_main_~sum~0#1| 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1834#(and (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,854 INFO L290 TraceCheckUtils]: 29: Hoare triple {1834#(and (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset|)) |ULTIMATE.start_main_~sum~0#1|) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1838#(and (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,856 INFO L290 TraceCheckUtils]: 30: Hoare triple {1838#(and (< 1 ~ARR_SIZE~0) (= |ULTIMATE.start_main_~sum~0#1| (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) (* |ULTIMATE.start_main_~column~0#1| 4) |ULTIMATE.start_main_~#array~0#1.offset| (- 4)))) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (+ (- 1) |ULTIMATE.start_main_~column~0#1|) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,857 INFO L290 TraceCheckUtils]: 31: Hoare triple {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,858 INFO L290 TraceCheckUtils]: 32: Hoare triple {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,859 INFO L290 TraceCheckUtils]: 33: Hoare triple {1842#(and (< 1 ~ARR_SIZE~0) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~row~0#1|) |ULTIMATE.start_main_~#array~0#1.offset|))) |ULTIMATE.start_main_~sum~0#1|) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~row~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,859 INFO L290 TraceCheckUtils]: 34: Hoare triple {1852#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~row~0#1 < ~ARR_SIZE~0);main_~column~0#1 := 0; {1856#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,861 INFO L290 TraceCheckUtils]: 35: Hoare triple {1856#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1856#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,862 INFO L290 TraceCheckUtils]: 36: Hoare triple {1856#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= |ULTIMATE.start_main_~column~0#1| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1863#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} is VALID [2022-02-20 14:24:07,863 INFO L290 TraceCheckUtils]: 37: Hoare triple {1863#(and (= (+ (- 1) |ULTIMATE.start_main_~row~0#1|) 0) (< 1 ~ARR_SIZE~0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset|)) 0) (= |ULTIMATE.start_main_~column~0#1| 1) (= |ULTIMATE.start_main_~#array~0#1.offset| 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ |ULTIMATE.start_main_~#array~0#1.offset| 4)) 0) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) |ULTIMATE.start_main_~#array~0#1.offset|) 1) (= (+ (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset|)) (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (* (mod ~ARR_SIZE~0 4294967296) 4) (+ (- 1) |ULTIMATE.start_main_~row~0#1|)) |ULTIMATE.start_main_~#array~0#1.offset| 4))) |ULTIMATE.start_main_~sum~0#1|) (<= ~ARR_SIZE~0 2) (= (select (select |#memory_int| |ULTIMATE.start_main_~#array~0#1.base|) (+ (* (mod ~ARR_SIZE~0 4294967296) 4) |ULTIMATE.start_main_~#array~0#1.offset| 4)) (- 1)))} assume !!(main_~column~0#1 < ~ARR_SIZE~0);call main_#t~mem9#1 := read~int(main_~#array~0#1.base, main_~#array~0#1.offset + main_~row~0#1 * (4 * (if ~ARR_SIZE~0 % 4294967296 <= 2147483647 then ~ARR_SIZE~0 % 4294967296 else ~ARR_SIZE~0 % 4294967296 - 4294967296)) + 4 * main_~column~0#1, 4);main_~sum~0#1 := main_~sum~0#1 + main_#t~mem9#1;havoc main_#t~mem9#1; {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:07,864 INFO L290 TraceCheckUtils]: 38: Hoare triple {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_#t~post8#1 := main_~column~0#1;main_~column~0#1 := 1 + main_#t~post8#1;havoc main_#t~post8#1; {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:07,864 INFO L290 TraceCheckUtils]: 39: Hoare triple {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~column~0#1 < ~ARR_SIZE~0); {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:07,864 INFO L290 TraceCheckUtils]: 40: Hoare triple {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} main_#t~post7#1 := main_~row~0#1;main_~row~0#1 := 1 + main_#t~post7#1;havoc main_#t~post7#1; {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:07,865 INFO L290 TraceCheckUtils]: 41: Hoare triple {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume !(main_~row~0#1 < ~ARR_SIZE~0); {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} is VALID [2022-02-20 14:24:07,865 INFO L290 TraceCheckUtils]: 42: Hoare triple {1867#(= |ULTIMATE.start_main_~sum~0#1| 0)} assume { :begin_inline___VERIFIER_assert } true;__VERIFIER_assert_#in~cond#1 := (if 0 == main_~sum~0#1 || 1 == main_~sum~0#1 then 1 else 0);havoc __VERIFIER_assert_~cond#1;__VERIFIER_assert_~cond#1 := __VERIFIER_assert_#in~cond#1; {1883#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} is VALID [2022-02-20 14:24:07,865 INFO L290 TraceCheckUtils]: 43: Hoare triple {1883#(<= 1 |ULTIMATE.start___VERIFIER_assert_~cond#1|)} assume 0 == __VERIFIER_assert_~cond#1; {1730#false} is VALID [2022-02-20 14:24:07,866 INFO L290 TraceCheckUtils]: 44: Hoare triple {1730#false} assume !false; {1730#false} is VALID [2022-02-20 14:24:07,866 INFO L134 CoverageAnalysis]: Checked inductivity of 59 backedges. 0 proven. 59 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 14:24:07,866 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 14:24:25,555 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 52 [2022-02-20 14:24:25,926 INFO L356 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-02-20 14:24:25,926 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 52 treesize of output 121 [2022-02-20 14:24:26,422 INFO L356 Elim1Store]: treesize reduction 59, result has 1.7 percent of original size [2022-02-20 14:24:26,422 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 80 treesize of output 4 [2022-02-20 14:24:54,019 WARN L228 SmtUtils]: Spent 23.37s on a formula simplification. DAG size of input: 142 DAG size of output: 98 (called from [L 353] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2022-02-20 14:24:54,034 INFO L356 Elim1Store]: treesize reduction 260, result has 56.4 percent of original size [2022-02-20 14:24:54,038 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 4829266 treesize of output 4542853 [2022-02-20 14:25:12,895 WARN L228 SmtUtils]: Spent 18.85s on a formula simplification. DAG size of input: 3595 DAG size of output: 3593 (called from [L1067] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.simplify) [2022-02-20 14:25:13,085 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 14:25:13,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611740375] [2022-02-20 14:25:13,085 WARN L317 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-02-20 14:25:13,085 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1503268653] [2022-02-20 14:25:13,086 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 14:25:13,119 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:25:13,299 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:25:13,300 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.ArithmeticException: BigInteger out of long range at java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.computeDerApplicabilityScore(QuantifierPusher.java:685) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.selectBestEliminatee(QuantifierPusher.java:668) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.doit(QuantifierPusher.java:604) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:446) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeBackwardSequence(IterativePredicateTransformer.java:399) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeWeakestPreconditionSequence(IterativePredicateTransformer.java:271) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:342) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 14:25:13,304 INFO L158 Benchmark]: Toolchain (without parser) took 73859.28ms. Allocated memory was 109.1MB in the beginning and 650.1MB in the end (delta: 541.1MB). Free memory was 76.9MB in the beginning and 272.0MB in the end (delta: -195.0MB). Peak memory consumption was 388.9MB. Max. memory is 16.1GB. [2022-02-20 14:25:13,304 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:25:13,304 INFO L158 Benchmark]: CACSL2BoogieTranslator took 250.84ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 82.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 14:25:13,305 INFO L158 Benchmark]: Boogie Procedure Inliner took 43.03ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 80.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 14:25:13,305 INFO L158 Benchmark]: Boogie Preprocessor took 36.36ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 78.9MB in the end (delta: 958.8kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 14:25:13,305 INFO L158 Benchmark]: RCFGBuilder took 320.41ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 65.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2022-02-20 14:25:13,305 INFO L158 Benchmark]: TraceAbstraction took 73201.98ms. Allocated memory was 109.1MB in the beginning and 650.1MB in the end (delta: 541.1MB). Free memory was 64.8MB in the beginning and 272.0MB in the end (delta: -207.1MB). Peak memory consumption was 379.1MB. Max. memory is 16.1GB. [2022-02-20 14:25:13,309 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 109.1MB. Free memory was 64.3MB in the beginning and 64.2MB in the end (delta: 83.9kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 250.84ms. Allocated memory is still 109.1MB. Free memory was 76.7MB in the beginning and 82.0MB in the end (delta: -5.3MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 43.03ms. Allocated memory is still 109.1MB. Free memory was 82.0MB in the beginning and 80.3MB in the end (delta: 1.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 36.36ms. Allocated memory is still 109.1MB. Free memory was 79.9MB in the beginning and 78.9MB in the end (delta: 958.8kB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 320.41ms. Allocated memory is still 109.1MB. Free memory was 78.6MB in the beginning and 65.2MB in the end (delta: 13.3MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * TraceAbstraction took 73201.98ms. Allocated memory was 109.1MB in the beginning and 650.1MB in the end (delta: 541.1MB). Free memory was 64.8MB in the beginning and 272.0MB in the end (delta: -207.1MB). Peak memory consumption was 379.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: ArithmeticException: BigInteger out of long range de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: ArithmeticException: BigInteger out of long range: java.base/java.math.BigInteger.longValueExact(BigInteger.java:4765) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 14:25:13,372 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request...