./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/array-fpi/indp2.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6c24879c Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/array-fpi/indp2.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 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 --- Real Ultimate output --- This is Ultimate 0.2.2-?-6c24879 [2022-07-11 23:20:40,787 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-07-11 23:20:40,805 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-07-11 23:20:40,839 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-07-11 23:20:40,841 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-07-11 23:20:40,843 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-07-11 23:20:40,846 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-07-11 23:20:40,849 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-07-11 23:20:40,850 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-07-11 23:20:40,853 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-07-11 23:20:40,854 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-07-11 23:20:40,856 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-07-11 23:20:40,856 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-07-11 23:20:40,858 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-07-11 23:20:40,859 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-07-11 23:20:40,860 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-07-11 23:20:40,861 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-07-11 23:20:40,862 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-07-11 23:20:40,865 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-07-11 23:20:40,870 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-07-11 23:20:40,873 INFO L181 SettingsManager]: Resetting HornVerifier preferences to default values [2022-07-11 23:20:40,873 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-07-11 23:20:40,874 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-07-11 23:20:40,875 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-07-11 23:20:40,876 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-07-11 23:20:40,881 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-07-11 23:20:40,881 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-07-11 23:20:40,881 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-07-11 23:20:40,883 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-07-11 23:20:40,883 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-07-11 23:20:40,884 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-07-11 23:20:40,884 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-07-11 23:20:40,885 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-07-11 23:20:40,885 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-07-11 23:20:40,886 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-07-11 23:20:40,887 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-07-11 23:20:40,887 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-07-11 23:20:40,888 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-07-11 23:20:40,888 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-07-11 23:20:40,888 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-07-11 23:20:40,889 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-07-11 23:20:40,890 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-07-11 23:20:40,891 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-07-11 23:20:40,912 INFO L113 SettingsManager]: Loading preferences was successful [2022-07-11 23:20:40,913 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-07-11 23:20:40,913 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-07-11 23:20:40,913 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-07-11 23:20:40,914 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-07-11 23:20:40,914 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-07-11 23:20:40,914 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-07-11 23:20:40,914 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-07-11 23:20:40,915 INFO L138 SettingsManager]: * Use SBE=true [2022-07-11 23:20:40,915 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * sizeof long=4 [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-07-11 23:20:40,916 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-07-11 23:20:40,917 INFO L138 SettingsManager]: * sizeof long double=12 [2022-07-11 23:20:40,917 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-07-11 23:20:40,918 INFO L138 SettingsManager]: * Use constant arrays=true [2022-07-11 23:20:40,918 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-07-11 23:20:40,918 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-07-11 23:20:40,918 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-07-11 23:20:40,918 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-07-11 23:20:40,918 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:20:40,919 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-07-11 23:20:40,919 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-07-11 23:20:40,919 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-07-11 23:20:40,919 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-07-11 23:20:40,919 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-07-11 23:20:40,920 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-07-11 23:20:40,920 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-07-11 23:20:40,920 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-07-11 23:20:40,920 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 -> 22448626353835b24dede83f92858a925e988e04b05430a9ca91763be927cf92 [2022-07-11 23:20:41,142 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-07-11 23:20:41,157 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-07-11 23:20:41,158 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-07-11 23:20:41,159 INFO L271 PluginConnector]: Initializing CDTParser... [2022-07-11 23:20:41,160 INFO L275 PluginConnector]: CDTParser initialized [2022-07-11 23:20:41,161 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/array-fpi/indp2.c [2022-07-11 23:20:41,219 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f131291/3ca5321d541b4a8da78876d5afe5fe34/FLAGf9f3a5fb7 [2022-07-11 23:20:41,550 INFO L306 CDTParser]: Found 1 translation units. [2022-07-11 23:20:41,550 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp2.c [2022-07-11 23:20:41,554 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f131291/3ca5321d541b4a8da78876d5afe5fe34/FLAGf9f3a5fb7 [2022-07-11 23:20:41,562 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/56f131291/3ca5321d541b4a8da78876d5afe5fe34 [2022-07-11 23:20:41,564 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-07-11 23:20:41,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-07-11 23:20:41,566 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-07-11 23:20:41,567 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-07-11 23:20:41,569 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-07-11 23:20:41,569 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,570 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@41569733 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41, skipping insertion in model container [2022-07-11 23:20:41,570 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,575 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-07-11 23:20:41,583 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-07-11 23:20:41,694 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp2.c[588,601] [2022-07-11 23:20:41,706 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:20:41,712 INFO L203 MainTranslator]: Completed pre-run [2022-07-11 23:20:41,722 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/array-fpi/indp2.c[588,601] [2022-07-11 23:20:41,726 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-07-11 23:20:41,735 INFO L208 MainTranslator]: Completed translation [2022-07-11 23:20:41,736 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41 WrapperNode [2022-07-11 23:20:41,736 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-07-11 23:20:41,737 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-07-11 23:20:41,737 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-07-11 23:20:41,737 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-07-11 23:20:41,742 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,747 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,759 INFO L137 Inliner]: procedures = 16, calls = 16, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 74 [2022-07-11 23:20:41,759 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-07-11 23:20:41,760 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-07-11 23:20:41,760 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-07-11 23:20:41,760 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-07-11 23:20:41,766 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,766 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,767 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,768 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,771 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,774 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,775 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,776 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-07-11 23:20:41,777 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-07-11 23:20:41,777 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-07-11 23:20:41,777 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-07-11 23:20:41,778 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (1/1) ... [2022-07-11 23:20:41,782 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-07-11 23:20:41,790 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:41,800 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-07-11 23:20:41,823 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-07-11 23:20:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-07-11 23:20:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-07-11 23:20:41,831 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-07-11 23:20:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-07-11 23:20:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-07-11 23:20:41,832 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-07-11 23:20:41,832 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-07-11 23:20:41,872 INFO L234 CfgBuilder]: Building ICFG [2022-07-11 23:20:41,873 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-07-11 23:20:42,024 INFO L275 CfgBuilder]: Performing block encoding [2022-07-11 23:20:42,029 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-07-11 23:20:42,029 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-07-11 23:20:42,030 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:20:42 BoogieIcfgContainer [2022-07-11 23:20:42,030 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-07-11 23:20:42,039 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-07-11 23:20:42,043 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-07-11 23:20:42,045 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-07-11 23:20:42,045 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.07 11:20:41" (1/3) ... [2022-07-11 23:20:42,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48208391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:20:42, skipping insertion in model container [2022-07-11 23:20:42,046 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.07 11:20:41" (2/3) ... [2022-07-11 23:20:42,046 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@48208391 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.07 11:20:42, skipping insertion in model container [2022-07-11 23:20:42,047 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.07 11:20:42" (3/3) ... [2022-07-11 23:20:42,047 INFO L111 eAbstractionObserver]: Analyzing ICFG indp2.c [2022-07-11 23:20:42,057 INFO L201 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-07-11 23:20:42,057 INFO L160 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-07-11 23:20:42,101 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-07-11 23:20:42,108 INFO L357 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, mPorIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6289d493, mLbeIndependenceSettings=de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings@6aa9cdfb [2022-07-11 23:20:42,108 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-07-11 23:20:42,118 INFO L276 IsEmpty]: Start isEmpty. Operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:20:42,125 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:42,126 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:42,126 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:42,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:42,131 INFO L85 PathProgramCache]: Analyzing trace with hash -592971038, now seen corresponding path program 1 times [2022-07-11 23:20:42,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:42,140 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [967773532] [2022-07-11 23:20:42,140 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:42,141 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:42,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:20:42,260 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:42,261 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:42,261 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [967773532] [2022-07-11 23:20:42,262 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [967773532] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:20:42,262 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:20:42,262 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-07-11 23:20:42,264 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [831559937] [2022-07-11 23:20:42,264 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:20:42,268 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-07-11 23:20:42,268 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:42,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-07-11 23:20:42,290 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-07-11 23:20:42,292 INFO L87 Difference]: Start difference. First operand has 24 states, 22 states have (on average 1.5454545454545454) internal successors, (34), 23 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:42,303 INFO L93 Difference]: Finished difference Result 44 states and 62 transitions. [2022-07-11 23:20:42,303 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-07-11 23:20:42,304 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-11 23:20:42,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:42,310 INFO L225 Difference]: With dead ends: 44 [2022-07-11 23:20:42,310 INFO L226 Difference]: Without dead ends: 20 [2022-07-11 23:20:42,315 INFO L412 NwaCegarLoop]: 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-07-11 23:20:42,319 INFO L413 NwaCegarLoop]: 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-07-11 23:20:42,320 INFO L414 NwaCegarLoop]: 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-07-11 23:20:42,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2022-07-11 23:20:42,342 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2022-07-11 23:20:42,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2022-07-11 23:20:42,345 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 14 [2022-07-11 23:20:42,346 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:42,346 INFO L495 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2022-07-11 23:20:42,346 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 7.0) internal successors, (14), 2 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,346 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2022-07-11 23:20:42,347 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-07-11 23:20:42,347 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:42,347 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:42,347 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-07-11 23:20:42,348 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:42,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:42,349 INFO L85 PathProgramCache]: Analyzing trace with hash 108093540, now seen corresponding path program 1 times [2022-07-11 23:20:42,349 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:42,350 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81230124] [2022-07-11 23:20:42,350 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:42,350 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:42,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:20:42,434 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:42,435 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:42,435 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81230124] [2022-07-11 23:20:42,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81230124] provided 1 perfect and 0 imperfect interpolant sequences [2022-07-11 23:20:42,438 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-07-11 23:20:42,438 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-07-11 23:20:42,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296708437] [2022-07-11 23:20:42,439 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-07-11 23:20:42,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-07-11 23:20:42,441 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:42,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-07-11 23:20:42,442 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:20:42,442 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:42,504 INFO L93 Difference]: Finished difference Result 45 states and 53 transitions. [2022-07-11 23:20:42,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-07-11 23:20:42,505 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-07-11 23:20:42,505 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:42,505 INFO L225 Difference]: With dead ends: 45 [2022-07-11 23:20:42,506 INFO L226 Difference]: Without dead ends: 32 [2022-07-11 23:20:42,507 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-07-11 23:20:42,508 INFO L413 NwaCegarLoop]: 11 mSDtfsCounter, 24 mSDsluCounter, 5 mSDsCounter, 0 mSdLazyCounter, 28 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 16 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 28 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:42,511 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 16 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 28 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-07-11 23:20:42,511 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-07-11 23:20:42,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 23. [2022-07-11 23:20:42,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 1.1818181818181819) internal successors, (26), 22 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 26 transitions. [2022-07-11 23:20:42,518 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 26 transitions. Word has length 14 [2022-07-11 23:20:42,518 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:42,518 INFO L495 AbstractCegarLoop]: Abstraction has 23 states and 26 transitions. [2022-07-11 23:20:42,518 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:42,519 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 26 transitions. [2022-07-11 23:20:42,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-07-11 23:20:42,519 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:42,519 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:42,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-07-11 23:20:42,520 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:42,520 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:42,523 INFO L85 PathProgramCache]: Analyzing trace with hash 615941150, now seen corresponding path program 1 times [2022-07-11 23:20:42,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:42,524 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1250274379] [2022-07-11 23:20:42,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:42,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:42,545 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:42,545 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1212698588] [2022-07-11 23:20:42,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:42,546 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:42,546 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:42,547 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-07-11 23:20:42,548 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-07-11 23:20:42,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:20:42,598 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 27 conjunts are in the unsatisfiable core [2022-07-11 23:20:42,604 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:42,672 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-07-11 23:20:42,746 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 23 treesize of output 11 [2022-07-11 23:20:42,815 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 25 treesize of output 13 [2022-07-11 23:20:42,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:42,925 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:43,030 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 22 treesize of output 20 [2022-07-11 23:20:43,033 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2022-07-11 23:20:43,048 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-07-11 23:20:43,049 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1250274379] [2022-07-11 23:20:43,049 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:20:43,049 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1212698588] [2022-07-11 23:20:43,049 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1212698588] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:20:43,049 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:20:43,049 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 13 [2022-07-11 23:20:43,049 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [181019069] [2022-07-11 23:20:43,050 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:20:43,050 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-07-11 23:20:43,050 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:43,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-07-11 23:20:43,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2022-07-11 23:20:43,051 INFO L87 Difference]: Start difference. First operand 23 states and 26 transitions. Second operand has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-07-11 23:20:43,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:43,234 INFO L93 Difference]: Finished difference Result 70 states and 78 transitions. [2022-07-11 23:20:43,234 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-07-11 23:20:43,234 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 states have internal predecessors, (34), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-07-11 23:20:43,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:43,237 INFO L225 Difference]: With dead ends: 70 [2022-07-11 23:20:43,237 INFO L226 Difference]: Without dead ends: 68 [2022-07-11 23:20:43,238 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 43 GetRequests, 25 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=72, Invalid=234, Unknown=0, NotChecked=0, Total=306 [2022-07-11 23:20:43,241 INFO L413 NwaCegarLoop]: 13 mSDtfsCounter, 62 mSDsluCounter, 67 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 43 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 43 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:43,242 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 80 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [43 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:20:43,244 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2022-07-11 23:20:43,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 32. [2022-07-11 23:20:43,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 31 states have (on average 1.2258064516129032) internal successors, (38), 31 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-07-11 23:20:43,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2022-07-11 23:20:43,251 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 20 [2022-07-11 23:20:43,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:43,252 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2022-07-11 23:20:43,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 2.6153846153846154) internal successors, (34), 13 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-07-11 23:20:43,252 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2022-07-11 23:20:43,252 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-07-11 23:20:43,252 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:43,252 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:43,273 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-07-11 23:20:43,471 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:43,471 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:43,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:43,472 INFO L85 PathProgramCache]: Analyzing trace with hash 678263444, now seen corresponding path program 1 times [2022-07-11 23:20:43,472 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:43,472 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491747430] [2022-07-11 23:20:43,472 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:43,472 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:43,483 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:43,483 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1922674643] [2022-07-11 23:20:43,483 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:43,483 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:43,484 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:43,487 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-07-11 23:20:43,488 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-07-11 23:20:43,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-07-11 23:20:43,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 6 conjunts are in the unsatisfiable core [2022-07-11 23:20:43,527 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:43,580 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:20:43,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:43,643 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-07-11 23:20:43,643 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491747430] [2022-07-11 23:20:43,644 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:20:43,644 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1922674643] [2022-07-11 23:20:43,644 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1922674643] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:20:43,644 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:20:43,644 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 9 [2022-07-11 23:20:43,645 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [512573123] [2022-07-11 23:20:43,645 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:20:43,645 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-07-11 23:20:43,645 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:43,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-07-11 23:20:43,646 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=49, Unknown=0, NotChecked=0, Total=72 [2022-07-11 23:20:43,647 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:43,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:43,738 INFO L93 Difference]: Finished difference Result 88 states and 103 transitions. [2022-07-11 23:20:43,738 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-07-11 23:20:43,739 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-07-11 23:20:43,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:43,739 INFO L225 Difference]: With dead ends: 88 [2022-07-11 23:20:43,739 INFO L226 Difference]: Without dead ends: 50 [2022-07-11 23:20:43,740 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 49 GetRequests, 39 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:20:43,741 INFO L413 NwaCegarLoop]: 14 mSDtfsCounter, 49 mSDsluCounter, 32 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 46 SdHoareTripleChecker+Invalid, 134 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:43,741 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [49 Valid, 46 Invalid, 134 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:20:43,741 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2022-07-11 23:20:43,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 36. [2022-07-11 23:20:43,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1714285714285715) internal successors, (41), 35 states have internal predecessors, (41), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:43,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 41 transitions. [2022-07-11 23:20:43,745 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 41 transitions. Word has length 24 [2022-07-11 23:20:43,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:43,746 INFO L495 AbstractCegarLoop]: Abstraction has 36 states and 41 transitions. [2022-07-11 23:20:43,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:43,746 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 41 transitions. [2022-07-11 23:20:43,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:20:43,746 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:43,747 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:43,775 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-07-11 23:20:43,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2022-07-11 23:20:43,964 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:43,965 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:43,965 INFO L85 PathProgramCache]: Analyzing trace with hash 341343694, now seen corresponding path program 2 times [2022-07-11 23:20:43,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:43,966 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1316476746] [2022-07-11 23:20:43,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:43,966 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:43,986 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:43,989 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [563176718] [2022-07-11 23:20:43,989 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:20:43,989 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:43,989 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:43,990 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-07-11 23:20:43,992 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-07-11 23:20:44,049 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:20:44,049 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:20:44,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 37 conjunts are in the unsatisfiable core [2022-07-11 23:20:44,054 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:44,068 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-07-11 23:20:44,100 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:20:44,101 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:20:44,122 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 31 treesize of output 15 [2022-07-11 23:20:44,158 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:20:44,158 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-11 23:20:44,181 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 33 treesize of output 17 [2022-07-11 23:20:44,243 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:44,245 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:44,447 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 22 treesize of output 20 [2022-07-11 23:20:44,450 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 34 [2022-07-11 23:20:44,462 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:44,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1316476746] [2022-07-11 23:20:44,462 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:20:44,462 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [563176718] [2022-07-11 23:20:44,462 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [563176718] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:20:44,463 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:20:44,463 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 15] total 19 [2022-07-11 23:20:44,463 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [916009540] [2022-07-11 23:20:44,463 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:20:44,463 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2022-07-11 23:20:44,464 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:44,464 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2022-07-11 23:20:44,464 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=285, Unknown=0, NotChecked=0, Total=342 [2022-07-11 23:20:44,464 INFO L87 Difference]: Start difference. First operand 36 states and 41 transitions. Second operand has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:44,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:44,815 INFO L93 Difference]: Finished difference Result 107 states and 120 transitions. [2022-07-11 23:20:44,815 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-07-11 23:20:44,816 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-11 23:20:44,816 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:44,816 INFO L225 Difference]: With dead ends: 107 [2022-07-11 23:20:44,816 INFO L226 Difference]: Without dead ends: 105 [2022-07-11 23:20:44,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=105, Invalid=545, Unknown=0, NotChecked=0, Total=650 [2022-07-11 23:20:44,817 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 106 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 320 mSolverCounterSat, 84 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 459 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 84 IncrementalHoareTripleChecker+Valid, 320 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 55 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:44,817 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [106 Valid, 169 Invalid, 459 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [84 Valid, 320 Invalid, 0 Unknown, 55 Unchecked, 0.2s Time] [2022-07-11 23:20:44,818 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-07-11 23:20:44,824 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 60. [2022-07-11 23:20:44,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 60 states, 59 states have (on average 1.2203389830508475) internal successors, (72), 59 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:44,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 60 states to 60 states and 72 transitions. [2022-07-11 23:20:44,825 INFO L78 Accepts]: Start accepts. Automaton has 60 states and 72 transitions. Word has length 30 [2022-07-11 23:20:44,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:44,825 INFO L495 AbstractCegarLoop]: Abstraction has 60 states and 72 transitions. [2022-07-11 23:20:44,825 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.3157894736842106) internal successors, (44), 19 states have internal predecessors, (44), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:44,825 INFO L276 IsEmpty]: Start isEmpty. Operand 60 states and 72 transitions. [2022-07-11 23:20:44,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-07-11 23:20:44,826 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:44,826 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:44,852 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-07-11 23:20:45,039 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:45,040 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:45,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:45,040 INFO L85 PathProgramCache]: Analyzing trace with hash -1792212012, now seen corresponding path program 2 times [2022-07-11 23:20:45,040 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:45,040 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [354727470] [2022-07-11 23:20:45,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:45,040 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:45,055 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:45,055 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [670616722] [2022-07-11 23:20:45,055 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-07-11 23:20:45,055 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:45,055 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:45,059 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-07-11 23:20:45,060 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-07-11 23:20:45,096 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-07-11 23:20:45,096 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:20:45,097 INFO L263 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 8 conjunts are in the unsatisfiable core [2022-07-11 23:20:45,098 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:45,145 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 23:20:45,145 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:45,193 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 14 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2022-07-11 23:20:45,193 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:45,193 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [354727470] [2022-07-11 23:20:45,193 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:20:45,194 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [670616722] [2022-07-11 23:20:45,194 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [670616722] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:20:45,194 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:20:45,194 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 12 [2022-07-11 23:20:45,194 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1663190559] [2022-07-11 23:20:45,194 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:20:45,195 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-07-11 23:20:45,195 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:45,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-07-11 23:20:45,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=93, Unknown=0, NotChecked=0, Total=132 [2022-07-11 23:20:45,196 INFO L87 Difference]: Start difference. First operand 60 states and 72 transitions. Second operand has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:45,310 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:45,310 INFO L93 Difference]: Finished difference Result 160 states and 185 transitions. [2022-07-11 23:20:45,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-07-11 23:20:45,311 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-07-11 23:20:45,311 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:45,311 INFO L225 Difference]: With dead ends: 160 [2022-07-11 23:20:45,312 INFO L226 Difference]: Without dead ends: 92 [2022-07-11 23:20:45,312 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 34 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=74, Invalid=166, Unknown=0, NotChecked=0, Total=240 [2022-07-11 23:20:45,313 INFO L413 NwaCegarLoop]: 16 mSDtfsCounter, 87 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 126 mSolverCounterSat, 58 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 87 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 58 IncrementalHoareTripleChecker+Valid, 126 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:45,313 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [87 Valid, 63 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [58 Valid, 126 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:20:45,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2022-07-11 23:20:45,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 69. [2022-07-11 23:20:45,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 68 states have (on average 1.161764705882353) internal successors, (79), 68 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:45,321 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 79 transitions. [2022-07-11 23:20:45,322 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 79 transitions. Word has length 30 [2022-07-11 23:20:45,322 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:45,322 INFO L495 AbstractCegarLoop]: Abstraction has 69 states and 79 transitions. [2022-07-11 23:20:45,322 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.75) internal successors, (33), 12 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:45,322 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 79 transitions. [2022-07-11 23:20:45,323 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-07-11 23:20:45,323 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:45,323 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:45,349 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-07-11 23:20:45,535 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:45,535 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:45,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:45,535 INFO L85 PathProgramCache]: Analyzing trace with hash -2083150320, now seen corresponding path program 3 times [2022-07-11 23:20:45,536 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:45,536 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1460791521] [2022-07-11 23:20:45,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:45,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:45,551 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:45,551 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1076381970] [2022-07-11 23:20:45,551 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:20:45,551 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:45,551 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:45,564 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-07-11 23:20:45,568 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-07-11 23:20:45,632 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2022-07-11 23:20:45,632 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:20:45,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 10 conjunts are in the unsatisfiable core [2022-07-11 23:20:45,635 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:45,717 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:20:45,717 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:45,763 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 16 proven. 9 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2022-07-11 23:20:45,763 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:20:45,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1460791521] [2022-07-11 23:20:45,763 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:20:45,763 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1076381970] [2022-07-11 23:20:45,763 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1076381970] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:20:45,763 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:20:45,764 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 15 [2022-07-11 23:20:45,764 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [381782921] [2022-07-11 23:20:45,764 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:20:45,764 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 15 states [2022-07-11 23:20:45,764 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:20:45,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2022-07-11 23:20:45,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=151, Unknown=0, NotChecked=0, Total=210 [2022-07-11 23:20:45,765 INFO L87 Difference]: Start difference. First operand 69 states and 79 transitions. Second operand has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-07-11 23:20:45,948 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:20:45,948 INFO L93 Difference]: Finished difference Result 187 states and 207 transitions. [2022-07-11 23:20:45,948 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-07-11 23:20:45,948 INFO L78 Accepts]: Start accepts. Automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 states have internal predecessors, (38), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 34 [2022-07-11 23:20:45,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:20:45,949 INFO L225 Difference]: With dead ends: 187 [2022-07-11 23:20:45,949 INFO L226 Difference]: Without dead ends: 135 [2022-07-11 23:20:45,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 85 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=143, Invalid=363, Unknown=0, NotChecked=0, Total=506 [2022-07-11 23:20:45,950 INFO L413 NwaCegarLoop]: 23 mSDtfsCounter, 150 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 82 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 102 SdHoareTripleChecker+Invalid, 278 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 82 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:20:45,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 102 Invalid, 278 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [82 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-07-11 23:20:45,950 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2022-07-11 23:20:45,965 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 95. [2022-07-11 23:20:45,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.1382978723404256) internal successors, (107), 94 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:20:45,968 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 107 transitions. [2022-07-11 23:20:45,968 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 107 transitions. Word has length 34 [2022-07-11 23:20:45,968 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:20:45,969 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 107 transitions. [2022-07-11 23:20:45,969 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 15 states, 15 states have (on average 2.533333333333333) internal successors, (38), 15 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-07-11 23:20:45,969 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 107 transitions. [2022-07-11 23:20:45,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-07-11 23:20:45,972 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:20:45,972 INFO L195 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:20:45,999 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-07-11 23:20:46,187 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:46,188 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:20:46,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:20:46,188 INFO L85 PathProgramCache]: Analyzing trace with hash -389301684, now seen corresponding path program 4 times [2022-07-11 23:20:46,188 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:20:46,188 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1317475249] [2022-07-11 23:20:46,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:20:46,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:20:46,205 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:20:46,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [401876022] [2022-07-11 23:20:46,206 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-07-11 23:20:46,206 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:20:46,206 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:20:46,211 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-07-11 23:20:46,212 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-07-11 23:20:46,256 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-07-11 23:20:46,256 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:20:46,257 INFO L263 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 54 conjunts are in the unsatisfiable core [2022-07-11 23:20:46,261 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:20:46,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-11 23:20:46,295 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,296 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,325 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,326 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,347 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,348 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,372 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 47 treesize of output 27 [2022-07-11 23:20:46,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,397 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,398 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,409 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,410 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,431 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 43 treesize of output 23 [2022-07-11 23:20:46,457 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,480 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,480 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,514 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-07-11 23:20:46,515 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 22 [2022-07-11 23:20:46,545 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 12 proven. 36 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:20:46,545 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:20:48,615 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_235 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) is different from false [2022-07-11 23:20:49,015 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:20:51,031 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2022-07-11 23:20:53,048 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:20:55,082 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|)))) is different from false [2022-07-11 23:20:57,105 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (= (select (store (store (store (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse1 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|)))) is different from false [2022-07-11 23:20:59,245 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_103| Int)) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (= (select (store (store (store (let ((.cse0 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_103|)))) is different from false [2022-07-11 23:21:01,272 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)))) is different from false [2022-07-11 23:21:03,300 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_104| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (= (select (store (store (store (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)))))) is different from false [2022-07-11 23:21:05,345 WARN L833 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (= (select (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_104|)))) is different from false [2022-07-11 23:21:07,380 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_105| Int)) (or (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= 0 (select (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)))) is different from false [2022-07-11 23:21:08,177 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)))) is different from false [2022-07-11 23:21:08,895 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) is different from false [2022-07-11 23:21:09,790 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:21:11,832 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_108|)))) is different from false [2022-07-11 23:21:13,876 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) is different from false [2022-07-11 23:21:15,957 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_109| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) is different from false [2022-07-11 23:21:18,006 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_216 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_109| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_216) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) is different from false [2022-07-11 23:21:20,065 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_216 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_216) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_109| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)))) is different from false [2022-07-11 23:21:20,106 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 229 treesize of output 221 [2022-07-11 23:21:20,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49048 treesize of output 48792 [2022-07-11 23:21:24,492 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 46 not checked. [2022-07-11 23:21:24,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-07-11 23:21:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1317475249] [2022-07-11 23:21:24,492 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-07-11 23:21:24,492 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [401876022] [2022-07-11 23:21:24,492 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [401876022] provided 0 perfect and 2 imperfect interpolant sequences [2022-07-11 23:21:24,493 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-07-11 23:21:24,493 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 28] total 39 [2022-07-11 23:21:24,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [483948283] [2022-07-11 23:21:24,493 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-07-11 23:21:24,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2022-07-11 23:21:24,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-07-11 23:21:24,494 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2022-07-11 23:21:24,494 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=324, Unknown=19, NotChecked=1026, Total=1482 [2022-07-11 23:21:24,495 INFO L87 Difference]: Start difference. First operand 95 states and 107 transitions. Second operand has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:21:26,510 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_110| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_216 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_109| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* 8 |v_ULTIMATE.start_main_~i~0#1_110|)) v_ArrVal_216) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_109| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_110| 1) |v_ULTIMATE.start_main_~i~0#1_109|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_110|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-07-11 23:21:28,524 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_109| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_109|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_218 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_109| 1) |v_ULTIMATE.start_main_~i~0#1_108|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_109|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_218) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:30,540 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_108| Int)) (or (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_219 Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_108|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_219))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_108|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:31,374 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:32,158 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (<= 3 |c_ULTIMATE.start_main_~i~0#1|) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:32,976 WARN L833 $PredicateComparison]: unable to prove that (and (= (- 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|))) (store .cse1 |c_ULTIMATE.start_main_~a~0#1.offset| (select .cse1 |c_ULTIMATE.start_main_~a~0#1.offset|))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_105|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:33,785 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int) (v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (|v_ULTIMATE.start_main_~i~0#1_105| Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= (select (store (store (store (let ((.cse0 (store (store (store (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|)) (.cse2 (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse1 .cse2 (+ (* (- 1) (* |c_ULTIMATE.start_main_~i~0#1| |c_ULTIMATE.start_main_~i~0#1|)) (select .cse1 .cse2)))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)))) is different from false [2022-07-11 23:21:35,799 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_105| Int)) (or (forall ((v_ArrVal_225 Int) (|v_ULTIMATE.start_main_~i~0#1_103| Int) (v_ArrVal_235 Int) (v_ArrVal_223 Int) (|v_ULTIMATE.start_main_~i~0#1_104| Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_100| Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int) (v_ArrVal_227 Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_104| 1) |v_ULTIMATE.start_main_~i~0#1_103|)) (= 0 (select (store (store (store (let ((.cse0 (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_105|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_223) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_104|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_225) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_103|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_227))) (store .cse0 |c_ULTIMATE.start_main_~a~0#1.offset| (+ (select .cse0 |c_ULTIMATE.start_main_~a~0#1.offset|) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|)) (not (<= 1 |v_ULTIMATE.start_main_~i~0#1_100|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_105| 1) |v_ULTIMATE.start_main_~i~0#1_104|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_105|))))) is different from false [2022-07-11 23:21:37,826 WARN L833 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~i~0#1| 0) (= (+ (* (+ |c_ULTIMATE.start_main_~i~0#1| 1) (+ (- 1) |c_ULTIMATE.start_main_~i~0#1|)) 1) (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~i~0#1_100| Int)) (or (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (v_ArrVal_232 Int) (|v_ULTIMATE.start_main_~i~0#1_99| Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_100| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_100|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_232) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))) (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_100|)))) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:39,842 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_99| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_99|)) (forall ((v_ArrVal_235 Int) (v_ArrVal_233 Int) (|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |v_ULTIMATE.start_main_~i~0#1_99| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (= (select (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* |v_ULTIMATE.start_main_~i~0#1_99| 8) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_233) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0))))) (<= 1 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:41,852 WARN L833 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~i~0#1_98| Int)) (or (not (<= (+ |c_ULTIMATE.start_main_~i~0#1| 1) |v_ULTIMATE.start_main_~i~0#1_98|)) (forall ((v_ArrVal_235 Int)) (= (select (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ |c_ULTIMATE.start_main_~a~0#1.offset| (* |v_ULTIMATE.start_main_~i~0#1_98| 8)) v_ArrVal_235) |c_ULTIMATE.start_main_~a~0#1.offset|) 0)))) (<= 2 |c_ULTIMATE.start_main_~i~0#1|) (= 0 (select (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) |c_ULTIMATE.start_main_~a~0#1.offset|)) (= |c_ULTIMATE.start_main_~a~0#1.offset| 0)) is different from false [2022-07-11 23:21:41,910 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-07-11 23:21:41,910 INFO L93 Difference]: Finished difference Result 124 states and 137 transitions. [2022-07-11 23:21:41,910 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2022-07-11 23:21:41,910 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2022-07-11 23:21:41,911 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-07-11 23:21:41,911 INFO L225 Difference]: With dead ends: 124 [2022-07-11 23:21:41,911 INFO L226 Difference]: Without dead ends: 122 [2022-07-11 23:21:41,912 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 32 SyntacticMatches, 12 SemanticMatches, 50 ConstructedPredicates, 30 IntricatePredicates, 0 DeprecatedPredicates, 167 ImplicationChecksByTransitivity, 50.2s TimeCoverageRelationStatistics Valid=151, Invalid=401, Unknown=30, NotChecked=2070, Total=2652 [2022-07-11 23:21:41,912 INFO L413 NwaCegarLoop]: 19 mSDtfsCounter, 62 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 159 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 126 SdHoareTripleChecker+Invalid, 1079 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 159 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 892 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-07-11 23:21:41,913 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 126 Invalid, 1079 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 159 Invalid, 0 Unknown, 892 Unchecked, 0.1s Time] [2022-07-11 23:21:41,913 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2022-07-11 23:21:41,920 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 95. [2022-07-11 23:21:41,920 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 94 states have (on average 1.127659574468085) internal successors, (106), 94 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:21:41,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 106 transitions. [2022-07-11 23:21:41,921 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 106 transitions. Word has length 38 [2022-07-11 23:21:41,921 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-07-11 23:21:41,921 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 106 transitions. [2022-07-11 23:21:41,921 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 39 states have (on average 1.794871794871795) internal successors, (70), 39 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-07-11 23:21:41,921 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 106 transitions. [2022-07-11 23:21:41,922 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2022-07-11 23:21:41,922 INFO L187 NwaCegarLoop]: Found error trace [2022-07-11 23:21:41,922 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-07-11 23:21:41,951 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-07-11 23:21:42,123 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:21:42,123 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-07-11 23:21:42,123 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-07-11 23:21:42,124 INFO L85 PathProgramCache]: Analyzing trace with hash -441278722, now seen corresponding path program 3 times [2022-07-11 23:21:42,124 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-07-11 23:21:42,124 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982241890] [2022-07-11 23:21:42,124 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-07-11 23:21:42,124 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-07-11 23:21:42,133 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-07-11 23:21:42,133 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1429241453] [2022-07-11 23:21:42,133 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-07-11 23:21:42,133 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-07-11 23:21:42,133 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-07-11 23:21:42,135 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-07-11 23:21:42,136 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-07-11 23:21:42,209 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 4 check-sat command(s) [2022-07-11 23:21:42,209 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-07-11 23:21:42,211 INFO L263 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 52 conjunts are in the unsatisfiable core [2022-07-11 23:21:42,216 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-07-11 23:21:42,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 17 [2022-07-11 23:21:42,289 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:21:42,290 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:21:42,313 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:21:42,313 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2022-07-11 23:21:42,346 INFO L356 Elim1Store]: treesize reduction 57, result has 5.0 percent of original size [2022-07-11 23:21:42,347 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 39 treesize of output 24 [2022-07-11 23:21:42,419 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:21:42,419 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-11 23:21:42,458 INFO L356 Elim1Store]: treesize reduction 31, result has 22.5 percent of original size [2022-07-11 23:21:42,458 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 26 [2022-07-11 23:21:42,495 INFO L356 Elim1Store]: treesize reduction 30, result has 46.4 percent of original size [2022-07-11 23:21:42,495 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 44 [2022-07-11 23:21:42,709 INFO L356 Elim1Store]: treesize reduction 11, result has 21.4 percent of original size [2022-07-11 23:21:42,709 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 23 [2022-07-11 23:21:42,723 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 29 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-07-11 23:21:42,723 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-07-11 23:22:21,529 WARN L833 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_main_~i~0#1_127| Int) (v_ArrVal_287 Int) (v_ArrVal_286 Int) (|v_ULTIMATE.start_main_~i~0#1_122| Int) (|v_ULTIMATE.start_main_~i~0#1_128| Int)) (or (= (select (let ((.cse0 (store (store (select |c_#memory_int| |c_ULTIMATE.start_main_~a~0#1.base|) (+ (* 8 |c_ULTIMATE.start_main_~i~0#1|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_286) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_128|) |c_ULTIMATE.start_main_~a~0#1.offset|) v_ArrVal_287)) (.cse1 (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_127|) |c_ULTIMATE.start_main_~a~0#1.offset|))) (store .cse0 .cse1 (+ (select .cse0 .cse1) 1))) (+ (* 8 |v_ULTIMATE.start_main_~i~0#1_122|) |c_ULTIMATE.start_main_~a~0#1.offset|)) 0) (not (< |v_ULTIMATE.start_main_~i~0#1_127| c_~N~0)) (not (<= |v_ULTIMATE.start_main_~i~0#1_128| (+ |c_ULTIMATE.start_main_~i~0#1| 1))) (<= c_~N~0 |v_ULTIMATE.start_main_~i~0#1_122|) (< |v_ULTIMATE.start_main_~i~0#1_122| 2) (< (+ |v_ULTIMATE.start_main_~i~0#1_127| 1) c_~N~0))) is different from false [2022-07-11 23:22:45,014 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 142 treesize of output 134 [2022-07-11 23:22:45,053 INFO L356 Elim1Store]: treesize reduction 36, result has 20.0 percent of original size [2022-07-11 23:22:45,055 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 441243438 treesize of output 435475670