./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 6b4ec56b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN --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 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 --- Real Ultimate output --- [0.001s][warning][os,container] Duplicate cpuset controllers detected. Picking /sys/fs/cgroup/cpuset, skipping /sys/fs/cgroup/cpuset. This is Ultimate 0.2.2-dev-6b4ec56 [2022-11-20 09:32:52,046 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 09:32:52,049 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 09:32:52,075 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 09:32:52,079 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 09:32:52,083 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 09:32:52,086 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 09:32:52,090 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 09:32:52,092 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 09:32:52,098 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 09:32:52,100 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 09:32:52,103 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 09:32:52,103 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 09:32:52,109 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 09:32:52,111 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 09:32:52,114 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 09:32:52,116 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 09:32:52,117 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 09:32:52,119 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 09:32:52,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 09:32:52,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 09:32:52,131 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 09:32:52,133 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 09:32:52,135 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 09:32:52,146 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 09:32:52,146 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 09:32:52,147 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 09:32:52,149 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 09:32:52,149 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 09:32:52,151 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 09:32:52,152 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 09:32:52,153 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 09:32:52,155 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 09:32:52,157 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 09:32:52,159 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 09:32:52,160 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 09:32:52,161 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 09:32:52,161 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 09:32:52,161 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 09:32:52,163 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 09:32:52,164 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 09:32:52,166 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 09:32:52,212 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 09:32:52,213 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 09:32:52,214 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 09:32:52,214 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 09:32:52,215 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 09:32:52,216 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 09:32:52,216 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 09:32:52,217 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 09:32:52,217 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 09:32:52,218 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 09:32:52,219 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 09:32:52,219 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 09:32:52,220 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 09:32:52,220 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 09:32:52,220 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 09:32:52,221 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 09:32:52,221 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 09:32:52,221 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 09:32:52,222 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 09:32:52,222 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 09:32:52,222 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 09:32:52,223 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 09:32:52,223 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 09:32:52,223 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 09:32:52,224 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:52,224 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 09:32:52,225 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 09:32:52,225 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 09:32:52,226 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 09:32:52,226 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 09:32:52,227 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 09:32:52,227 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 09:32:52,227 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 09:32:52,228 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN 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 -> 2bf204635285748ea2bd88f763410b9afff54eeccde3aa0a970ff723633af9c2 [2022-11-20 09:32:52,597 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 09:32:52,626 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 09:32:52,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 09:32:52,633 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 09:32:52,633 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 09:32:52,635 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-20 09:32:55,799 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 09:32:56,016 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 09:32:56,016 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c [2022-11-20 09:32:56,024 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/data/30f2df324/9cf13cd3fc9f45398a28d66602f95568/FLAGae8f7bf96 [2022-11-20 09:32:56,039 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/data/30f2df324/9cf13cd3fc9f45398a28d66602f95568 [2022-11-20 09:32:56,041 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 09:32:56,043 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 09:32:56,044 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:56,045 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 09:32:56,049 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 09:32:56,049 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,050 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5aa1a6cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56, skipping insertion in model container [2022-11-20 09:32:56,051 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,059 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 09:32:56,083 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 09:32:56,339 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-20 09:32:56,348 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:56,358 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 09:32:56,386 WARN L237 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/sv-benchmarks/c/weaver/loop-tiling-eq.wvr.c[2618,2631] [2022-11-20 09:32:56,389 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 09:32:56,404 INFO L208 MainTranslator]: Completed translation [2022-11-20 09:32:56,405 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56 WrapperNode [2022-11-20 09:32:56,405 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 09:32:56,406 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:56,406 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 09:32:56,406 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 09:32:56,414 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,423 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,451 INFO L138 Inliner]: procedures = 25, calls = 41, calls flagged for inlining = 13, calls inlined = 17, statements flattened = 186 [2022-11-20 09:32:56,451 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 09:32:56,452 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 09:32:56,452 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 09:32:56,452 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 09:32:56,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,462 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,466 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,466 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,476 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,482 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,484 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,485 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,489 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 09:32:56,490 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 09:32:56,490 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 09:32:56,490 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 09:32:56,491 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (1/1) ... [2022-11-20 09:32:56,497 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 09:32:56,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:56,524 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 09:32:56,556 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 09:32:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 09:32:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-11-20 09:32:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 09:32:56,592 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 09:32:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 09:32:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-11-20 09:32:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 09:32:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 09:32:56,593 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 09:32:56,593 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 09:32:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 09:32:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 09:32:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 09:32:56,594 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 09:32:56,594 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 09:32:56,596 WARN L209 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to SingleStatement [2022-11-20 09:32:56,711 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 09:32:56,713 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 09:32:57,263 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 09:32:57,275 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 09:32:57,276 INFO L300 CfgBuilder]: Removed 7 assume(true) statements. [2022-11-20 09:32:57,278 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:57 BoogieIcfgContainer [2022-11-20 09:32:57,279 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 09:32:57,281 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 09:32:57,281 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 09:32:57,285 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 09:32:57,286 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 09:32:56" (1/3) ... [2022-11-20 09:32:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b566449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:57, skipping insertion in model container [2022-11-20 09:32:57,287 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 09:32:56" (2/3) ... [2022-11-20 09:32:57,287 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@b566449 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 09:32:57, skipping insertion in model container [2022-11-20 09:32:57,288 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 09:32:57" (3/3) ... [2022-11-20 09:32:57,289 INFO L112 eAbstractionObserver]: Analyzing ICFG loop-tiling-eq.wvr.c [2022-11-20 09:32:57,307 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 09:32:57,319 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 09:32:57,319 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 09:32:57,319 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 09:32:57,424 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2022-11-20 09:32:57,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 260 places, 279 transitions, 574 flow [2022-11-20 09:32:57,708 INFO L130 PetriNetUnfolder]: 26/277 cut-off events. [2022-11-20 09:32:57,709 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 09:32:57,717 INFO L83 FinitePrefix]: Finished finitePrefix Result has 286 conditions, 277 events. 26/277 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 267 event pairs, 0 based on Foata normal form. 0/250 useless extension candidates. Maximal degree in co-relation 211. Up to 2 conditions per place. [2022-11-20 09:32:57,717 INFO L82 GeneralOperation]: Start removeDead. Operand has 260 places, 279 transitions, 574 flow [2022-11-20 09:32:57,732 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 249 places, 268 transitions, 548 flow [2022-11-20 09:32:57,754 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 09:32:57,762 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=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@341dbf27, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 09:32:57,762 INFO L358 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2022-11-20 09:32:57,850 INFO L130 PetriNetUnfolder]: 26/267 cut-off events. [2022-11-20 09:32:57,850 INFO L131 PetriNetUnfolder]: For 2/2 co-relation queries the response was YES. [2022-11-20 09:32:57,850 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:32:57,852 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:57,853 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:32:57,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:57,870 INFO L85 PathProgramCache]: Analyzing trace with hash 609338058, now seen corresponding path program 1 times [2022-11-20 09:32:57,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:57,884 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774357531] [2022-11-20 09:32:57,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:57,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:58,071 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:32:58,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1651990900] [2022-11-20 09:32:58,075 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:58,075 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:58,076 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:58,078 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:58,085 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 09:32:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:58,255 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 1 conjunts are in the unsatisfiable core [2022-11-20 09:32:58,264 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:58,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:58,314 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:32:58,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:58,314 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774357531] [2022-11-20 09:32:58,315 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:32:58,315 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1651990900] [2022-11-20 09:32:58,316 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1651990900] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:58,316 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:58,317 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 09:32:58,319 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062647374] [2022-11-20 09:32:58,320 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:58,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 09:32:58,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:58,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 09:32:58,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 09:32:58,387 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 255 out of 279 [2022-11-20 09:32:58,394 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 249 places, 268 transitions, 548 flow. Second operand has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:58,394 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:32:58,394 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 255 of 279 [2022-11-20 09:32:58,396 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:32:58,494 INFO L130 PetriNetUnfolder]: 7/249 cut-off events. [2022-11-20 09:32:58,495 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 09:32:58,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 263 conditions, 249 events. 7/249 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 242 event pairs, 0 based on Foata normal form. 22/252 useless extension candidates. Maximal degree in co-relation 197. Up to 5 conditions per place. [2022-11-20 09:32:58,497 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 4 selfloop transitions, 0 changer transitions 12/249 dead transitions. [2022-11-20 09:32:58,498 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 250 places, 249 transitions, 518 flow [2022-11-20 09:32:58,499 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 09:32:58,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 09:32:58,518 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 533 transitions. [2022-11-20 09:32:58,524 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9551971326164874 [2022-11-20 09:32:58,525 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 533 transitions. [2022-11-20 09:32:58,525 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 533 transitions. [2022-11-20 09:32:58,531 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:32:58,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 533 transitions. [2022-11-20 09:32:58,540 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 266.5) internal successors, (533), 2 states have internal predecessors, (533), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:58,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:58,551 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 279.0) internal successors, (837), 3 states have internal predecessors, (837), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:58,554 INFO L175 Difference]: Start difference. First operand has 249 places, 268 transitions, 548 flow. Second operand 2 states and 533 transitions. [2022-11-20 09:32:58,555 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 250 places, 249 transitions, 518 flow [2022-11-20 09:32:58,561 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 246 places, 249 transitions, 510 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:32:58,570 INFO L231 Difference]: Finished difference. Result has 246 places, 237 transitions, 478 flow [2022-11-20 09:32:58,572 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=245, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=249, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=249, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=478, PETRI_PLACES=246, PETRI_TRANSITIONS=237} [2022-11-20 09:32:58,578 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -3 predicate places. [2022-11-20 09:32:58,578 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 237 transitions, 478 flow [2022-11-20 09:32:58,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 259.5) internal successors, (519), 2 states have internal predecessors, (519), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:58,579 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:32:58,579 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:58,592 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:58,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable0 [2022-11-20 09:32:58,787 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:32:58,789 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:58,789 INFO L85 PathProgramCache]: Analyzing trace with hash -873989855, now seen corresponding path program 1 times [2022-11-20 09:32:58,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:58,791 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244044643] [2022-11-20 09:32:58,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:58,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:32:58,850 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:32:58,852 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [417987236] [2022-11-20 09:32:58,853 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:58,854 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:58,854 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:32:58,855 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:32:58,878 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 09:32:59,048 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:32:59,051 INFO L263 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 09:32:59,070 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:32:59,371 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:32:59,372 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:32:59,372 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:32:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244044643] [2022-11-20 09:32:59,373 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:32:59,373 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [417987236] [2022-11-20 09:32:59,374 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [417987236] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:32:59,375 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:32:59,376 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-11-20 09:32:59,377 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1960141871] [2022-11-20 09:32:59,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:32:59,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:32:59,381 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:32:59,381 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:32:59,382 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:32:59,385 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 279 [2022-11-20 09:32:59,387 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 237 transitions, 478 flow. Second operand has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:59,387 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:32:59,388 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 279 [2022-11-20 09:32:59,388 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:32:59,712 INFO L130 PetriNetUnfolder]: 21/377 cut-off events. [2022-11-20 09:32:59,713 INFO L131 PetriNetUnfolder]: For 8/8 co-relation queries the response was YES. [2022-11-20 09:32:59,714 INFO L83 FinitePrefix]: Finished finitePrefix Result has 483 conditions, 377 events. 21/377 cut-off events. For 8/8 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 681 event pairs, 4 based on Foata normal form. 1/356 useless extension candidates. Maximal degree in co-relation 480. Up to 66 conditions per place. [2022-11-20 09:32:59,716 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 73 selfloop transitions, 4 changer transitions 10/259 dead transitions. [2022-11-20 09:32:59,716 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 240 places, 259 transitions, 700 flow [2022-11-20 09:32:59,717 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:32:59,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:32:59,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1362 transitions. [2022-11-20 09:32:59,721 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6973886328725039 [2022-11-20 09:32:59,721 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1362 transitions. [2022-11-20 09:32:59,721 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1362 transitions. [2022-11-20 09:32:59,722 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:32:59,723 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1362 transitions. [2022-11-20 09:32:59,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 194.57142857142858) internal successors, (1362), 7 states have internal predecessors, (1362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:59,731 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:59,733 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:59,733 INFO L175 Difference]: Start difference. First operand has 246 places, 237 transitions, 478 flow. Second operand 7 states and 1362 transitions. [2022-11-20 09:32:59,734 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 240 places, 259 transitions, 700 flow [2022-11-20 09:32:59,737 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 240 places, 259 transitions, 700 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 09:32:59,742 INFO L231 Difference]: Finished difference. Result has 244 places, 238 transitions, 500 flow [2022-11-20 09:32:59,743 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=478, PETRI_DIFFERENCE_MINUEND_PLACES=234, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=237, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=500, PETRI_PLACES=244, PETRI_TRANSITIONS=238} [2022-11-20 09:32:59,744 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -5 predicate places. [2022-11-20 09:32:59,744 INFO L495 AbstractCegarLoop]: Abstraction has has 244 places, 238 transitions, 500 flow [2022-11-20 09:32:59,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 190.66666666666666) internal successors, (1144), 6 states have internal predecessors, (1144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:32:59,746 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:32:59,746 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:32:59,758 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-11-20 09:32:59,953 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:32:59,953 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:32:59,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:32:59,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1714519334, now seen corresponding path program 1 times [2022-11-20 09:32:59,954 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:32:59,955 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049568410] [2022-11-20 09:32:59,955 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:32:59,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:00,018 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:00,018 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [854912894] [2022-11-20 09:33:00,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:00,019 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:00,019 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:00,021 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:00,045 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 09:33:00,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:00,218 INFO L263 TraceCheckSpWp]: Trace formula consists of 437 conjuncts, 4 conjunts are in the unsatisfiable core [2022-11-20 09:33:00,223 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:00,393 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:00,394 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:00,523 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:00,524 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:00,527 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049568410] [2022-11-20 09:33:00,527 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:33:00,528 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [854912894] [2022-11-20 09:33:00,528 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [854912894] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:33:00,529 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:33:00,529 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2022-11-20 09:33:00,530 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [107229986] [2022-11-20 09:33:00,531 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:33:00,532 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 09:33:00,532 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:00,533 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 09:33:00,533 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-11-20 09:33:00,536 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 233 out of 279 [2022-11-20 09:33:00,539 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 244 places, 238 transitions, 500 flow. Second operand has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:00,539 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:00,540 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 233 of 279 [2022-11-20 09:33:00,540 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:00,724 INFO L130 PetriNetUnfolder]: 23/334 cut-off events. [2022-11-20 09:33:00,724 INFO L131 PetriNetUnfolder]: For 20/20 co-relation queries the response was YES. [2022-11-20 09:33:00,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 412 conditions, 334 events. 23/334 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 14. Compared 626 event pairs, 4 based on Foata normal form. 0/322 useless extension candidates. Maximal degree in co-relation 404. Up to 17 conditions per place. [2022-11-20 09:33:00,731 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 29 selfloop transitions, 8 changer transitions 0/248 dead transitions. [2022-11-20 09:33:00,731 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 248 transitions, 596 flow [2022-11-20 09:33:00,732 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:33:00,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:33:00,735 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1669 transitions. [2022-11-20 09:33:00,736 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.8545826932923707 [2022-11-20 09:33:00,736 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1669 transitions. [2022-11-20 09:33:00,737 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1669 transitions. [2022-11-20 09:33:00,738 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:00,738 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1669 transitions. [2022-11-20 09:33:00,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 238.42857142857142) internal successors, (1669), 7 states have internal predecessors, (1669), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:00,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:00,749 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:00,749 INFO L175 Difference]: Start difference. First operand has 244 places, 238 transitions, 500 flow. Second operand 7 states and 1669 transitions. [2022-11-20 09:33:00,749 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 248 transitions, 596 flow [2022-11-20 09:33:00,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 248 transitions, 584 flow, removed 3 selfloop flow, removed 5 redundant places. [2022-11-20 09:33:00,757 INFO L231 Difference]: Finished difference. Result has 245 places, 241 transitions, 527 flow [2022-11-20 09:33:00,758 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=488, PETRI_DIFFERENCE_MINUEND_PLACES=236, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=238, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=231, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=527, PETRI_PLACES=245, PETRI_TRANSITIONS=241} [2022-11-20 09:33:00,760 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, -4 predicate places. [2022-11-20 09:33:00,761 INFO L495 AbstractCegarLoop]: Abstraction has has 245 places, 241 transitions, 527 flow [2022-11-20 09:33:00,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 236.83333333333334) internal successors, (1421), 6 states have internal predecessors, (1421), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:00,762 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:00,762 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:00,779 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:00,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2022-11-20 09:33:00,973 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:33:00,974 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:00,974 INFO L85 PathProgramCache]: Analyzing trace with hash -290004070, now seen corresponding path program 1 times [2022-11-20 09:33:00,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:00,974 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [858755907] [2022-11-20 09:33:00,975 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:00,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:01,011 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:01,012 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [287883815] [2022-11-20 09:33:01,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:01,012 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:01,012 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:01,014 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:01,019 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 09:33:01,187 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:01,190 INFO L263 TraceCheckSpWp]: Trace formula consists of 446 conjuncts, 9 conjunts are in the unsatisfiable core [2022-11-20 09:33:01,194 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:01,411 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:33:01,411 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:01,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [858755907] [2022-11-20 09:33:01,412 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:33:01,412 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [287883815] [2022-11-20 09:33:01,412 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [287883815] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:01,413 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:01,413 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 09:33:01,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375780238] [2022-11-20 09:33:01,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:01,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 09:33:01,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:01,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 09:33:01,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-11-20 09:33:01,417 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 158 out of 279 [2022-11-20 09:33:01,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 245 places, 241 transitions, 527 flow. Second operand has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:01,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:01,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 158 of 279 [2022-11-20 09:33:01,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:01,970 INFO L130 PetriNetUnfolder]: 51/627 cut-off events. [2022-11-20 09:33:01,970 INFO L131 PetriNetUnfolder]: For 53/53 co-relation queries the response was YES. [2022-11-20 09:33:01,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 921 conditions, 627 events. 51/627 cut-off events. For 53/53 co-relation queries the response was YES. Maximal size of possible extension queue 18. Compared 2155 event pairs, 18 based on Foata normal form. 2/603 useless extension candidates. Maximal degree in co-relation 913. Up to 66 conditions per place. [2022-11-20 09:33:01,974 INFO L137 encePairwiseOnDemand]: 268/279 looper letters, 88 selfloop transitions, 7 changer transitions 46/293 dead transitions. [2022-11-20 09:33:01,974 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 257 places, 293 transitions, 921 flow [2022-11-20 09:33:01,974 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2022-11-20 09:33:01,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2022-11-20 09:33:01,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 2197 transitions. [2022-11-20 09:33:01,979 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.6057347670250897 [2022-11-20 09:33:01,979 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 2197 transitions. [2022-11-20 09:33:01,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 2197 transitions. [2022-11-20 09:33:01,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:01,981 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 2197 transitions. [2022-11-20 09:33:01,988 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 169.0) internal successors, (2197), 13 states have internal predecessors, (2197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:01,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:01,996 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 279.0) internal successors, (3906), 14 states have internal predecessors, (3906), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:01,996 INFO L175 Difference]: Start difference. First operand has 245 places, 241 transitions, 527 flow. Second operand 13 states and 2197 transitions. [2022-11-20 09:33:01,997 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 257 places, 293 transitions, 921 flow [2022-11-20 09:33:02,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 256 places, 293 transitions, 920 flow, removed 0 selfloop flow, removed 1 redundant places. [2022-11-20 09:33:02,004 INFO L231 Difference]: Finished difference. Result has 265 places, 244 transitions, 581 flow [2022-11-20 09:33:02,005 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=526, PETRI_DIFFERENCE_MINUEND_PLACES=244, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=241, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=234, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=581, PETRI_PLACES=265, PETRI_TRANSITIONS=244} [2022-11-20 09:33:02,006 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 16 predicate places. [2022-11-20 09:33:02,006 INFO L495 AbstractCegarLoop]: Abstraction has has 265 places, 244 transitions, 581 flow [2022-11-20 09:33:02,009 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 167.375) internal successors, (1339), 8 states have internal predecessors, (1339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:02,009 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:02,010 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:02,016 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2022-11-20 09:33:02,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:02,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:33:02,216 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:02,216 INFO L85 PathProgramCache]: Analyzing trace with hash -703165043, now seen corresponding path program 1 times [2022-11-20 09:33:02,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:02,217 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1565558225] [2022-11-20 09:33:02,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:02,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:02,256 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:02,257 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1422481135] [2022-11-20 09:33:02,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:02,259 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:02,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:02,261 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:02,284 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 09:33:02,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:02,446 INFO L263 TraceCheckSpWp]: Trace formula consists of 467 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:33:02,449 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:02,580 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:02,580 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:02,788 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 09:33:02,789 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:02,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1565558225] [2022-11-20 09:33:02,789 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:33:02,789 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1422481135] [2022-11-20 09:33:02,789 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1422481135] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:02,790 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:33:02,790 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-20 09:33:02,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [903904179] [2022-11-20 09:33:02,790 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:02,791 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:02,791 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:02,791 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:02,792 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:33:02,794 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 279 [2022-11-20 09:33:02,796 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 265 places, 244 transitions, 581 flow. Second operand has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:02,796 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:02,796 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 279 [2022-11-20 09:33:02,796 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:03,045 INFO L130 PetriNetUnfolder]: 26/349 cut-off events. [2022-11-20 09:33:03,045 INFO L131 PetriNetUnfolder]: For 56/56 co-relation queries the response was YES. [2022-11-20 09:33:03,047 INFO L83 FinitePrefix]: Finished finitePrefix Result has 539 conditions, 349 events. 26/349 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 8. Compared 573 event pairs, 4 based on Foata normal form. 0/342 useless extension candidates. Maximal degree in co-relation 523. Up to 43 conditions per place. [2022-11-20 09:33:03,048 INFO L137 encePairwiseOnDemand]: 267/279 looper letters, 54 selfloop transitions, 11 changer transitions 0/252 dead transitions. [2022-11-20 09:33:03,048 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 266 places, 252 transitions, 735 flow [2022-11-20 09:33:03,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-11-20 09:33:03,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2022-11-20 09:33:03,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 1910 transitions. [2022-11-20 09:33:03,053 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7606531262445241 [2022-11-20 09:33:03,053 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 1910 transitions. [2022-11-20 09:33:03,054 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 1910 transitions. [2022-11-20 09:33:03,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:03,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 1910 transitions. [2022-11-20 09:33:03,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 212.22222222222223) internal successors, (1910), 9 states have internal predecessors, (1910), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:03,064 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:03,066 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 279.0) internal successors, (2790), 10 states have internal predecessors, (2790), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:03,066 INFO L175 Difference]: Start difference. First operand has 265 places, 244 transitions, 581 flow. Second operand 9 states and 1910 transitions. [2022-11-20 09:33:03,066 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 266 places, 252 transitions, 735 flow [2022-11-20 09:33:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 258 places, 252 transitions, 711 flow, removed 9 selfloop flow, removed 8 redundant places. [2022-11-20 09:33:03,074 INFO L231 Difference]: Finished difference. Result has 263 places, 248 transitions, 617 flow [2022-11-20 09:33:03,075 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=558, PETRI_DIFFERENCE_MINUEND_PLACES=250, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=244, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=617, PETRI_PLACES=263, PETRI_TRANSITIONS=248} [2022-11-20 09:33:03,077 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 14 predicate places. [2022-11-20 09:33:03,080 INFO L495 AbstractCegarLoop]: Abstraction has has 263 places, 248 transitions, 617 flow [2022-11-20 09:33:03,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 210.85714285714286) internal successors, (1476), 7 states have internal predecessors, (1476), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:03,081 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:03,082 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:03,093 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:03,288 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:03,288 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:33:03,294 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -130076442, now seen corresponding path program 1 times [2022-11-20 09:33:03,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:03,299 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1203205012] [2022-11-20 09:33:03,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:03,299 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:03,350 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:03,351 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1253679652] [2022-11-20 09:33:03,351 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:03,351 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:03,351 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:03,357 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:03,380 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 09:33:03,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:03,584 INFO L263 TraceCheckSpWp]: Trace formula consists of 493 conjuncts, 11 conjunts are in the unsatisfiable core [2022-11-20 09:33:03,587 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:04,196 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:33:04,197 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 09:33:04,197 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1203205012] [2022-11-20 09:33:04,197 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:33:04,197 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1253679652] [2022-11-20 09:33:04,198 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1253679652] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 09:33:04,198 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 09:33:04,198 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-11-20 09:33:04,198 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776502305] [2022-11-20 09:33:04,198 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:04,199 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-11-20 09:33:04,199 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:04,199 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-11-20 09:33:04,200 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=108, Unknown=0, NotChecked=0, Total=132 [2022-11-20 09:33:04,203 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 192 out of 279 [2022-11-20 09:33:04,205 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 263 places, 248 transitions, 617 flow. Second operand has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:04,206 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:04,206 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 192 of 279 [2022-11-20 09:33:04,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:04,703 INFO L130 PetriNetUnfolder]: 67/594 cut-off events. [2022-11-20 09:33:04,704 INFO L131 PetriNetUnfolder]: For 145/166 co-relation queries the response was YES. [2022-11-20 09:33:04,705 INFO L83 FinitePrefix]: Finished finitePrefix Result has 972 conditions, 594 events. 67/594 cut-off events. For 145/166 co-relation queries the response was YES. Maximal size of possible extension queue 13. Compared 1513 event pairs, 29 based on Foata normal form. 22/581 useless extension candidates. Maximal degree in co-relation 956. Up to 150 conditions per place. [2022-11-20 09:33:04,707 INFO L137 encePairwiseOnDemand]: 260/279 looper letters, 73 selfloop transitions, 12 changer transitions 35/291 dead transitions. [2022-11-20 09:33:04,708 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 291 transitions, 996 flow [2022-11-20 09:33:04,708 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-11-20 09:33:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2022-11-20 09:33:04,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 3377 transitions. [2022-11-20 09:33:04,715 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7119966266076323 [2022-11-20 09:33:04,716 INFO L72 ComplementDD]: Start complementDD. Operand 17 states and 3377 transitions. [2022-11-20 09:33:04,716 INFO L73 IsDeterministic]: Start isDeterministic. Operand 17 states and 3377 transitions. [2022-11-20 09:33:04,718 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:04,718 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 17 states and 3377 transitions. [2022-11-20 09:33:04,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 18 states, 17 states have (on average 198.64705882352942) internal successors, (3377), 17 states have internal predecessors, (3377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:04,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:04,740 INFO L81 ComplementDD]: Finished complementDD. Result has 18 states, 18 states have (on average 279.0) internal successors, (5022), 18 states have internal predecessors, (5022), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:04,740 INFO L175 Difference]: Start difference. First operand has 263 places, 248 transitions, 617 flow. Second operand 17 states and 3377 transitions. [2022-11-20 09:33:04,740 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 291 transitions, 996 flow [2022-11-20 09:33:04,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 275 places, 291 transitions, 968 flow, removed 2 selfloop flow, removed 4 redundant places. [2022-11-20 09:33:04,748 INFO L231 Difference]: Finished difference. Result has 283 places, 250 transitions, 656 flow [2022-11-20 09:33:04,749 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=600, PETRI_DIFFERENCE_MINUEND_PLACES=259, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=248, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=236, PETRI_DIFFERENCE_SUBTRAHEND_STATES=17, PETRI_FLOW=656, PETRI_PLACES=283, PETRI_TRANSITIONS=250} [2022-11-20 09:33:04,749 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 34 predicate places. [2022-11-20 09:33:04,749 INFO L495 AbstractCegarLoop]: Abstraction has has 283 places, 250 transitions, 656 flow [2022-11-20 09:33:04,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 196.83333333333334) internal successors, (2362), 12 states have internal predecessors, (2362), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:04,751 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:04,751 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:04,769 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:04,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:04,959 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:33:04,959 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:04,959 INFO L85 PathProgramCache]: Analyzing trace with hash -758976439, now seen corresponding path program 1 times [2022-11-20 09:33:04,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:04,959 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [230866526] [2022-11-20 09:33:04,960 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:04,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:05,006 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:05,007 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [1275899530] [2022-11-20 09:33:05,007 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:05,007 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:05,007 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:05,013 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:05,037 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 09:33:05,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:05,195 INFO L263 TraceCheckSpWp]: Trace formula consists of 535 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 09:33:05,198 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:05,485 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 09:33:05,485 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:05,816 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-11-20 09:33:05,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:33:05,820 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [230866526] [2022-11-20 09:33:05,821 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:33:05,821 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1275899530] [2022-11-20 09:33:05,821 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1275899530] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 09:33:05,821 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 09:33:05,821 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [7] total 11 [2022-11-20 09:33:05,822 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [719830431] [2022-11-20 09:33:05,826 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 09:33:05,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 09:33:05,827 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:33:05,827 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 09:33:05,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-11-20 09:33:05,829 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 279 [2022-11-20 09:33:05,831 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 283 places, 250 transitions, 656 flow. Second operand has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:05,832 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:33:05,832 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 279 [2022-11-20 09:33:05,832 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:33:05,983 INFO L130 PetriNetUnfolder]: 17/334 cut-off events. [2022-11-20 09:33:05,983 INFO L131 PetriNetUnfolder]: For 72/80 co-relation queries the response was YES. [2022-11-20 09:33:05,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 546 conditions, 334 events. 17/334 cut-off events. For 72/80 co-relation queries the response was YES. Maximal size of possible extension queue 9. Compared 372 event pairs, 2 based on Foata normal form. 1/330 useless extension candidates. Maximal degree in co-relation 524. Up to 67 conditions per place. [2022-11-20 09:33:05,986 INFO L137 encePairwiseOnDemand]: 271/279 looper letters, 53 selfloop transitions, 7 changer transitions 0/253 dead transitions. [2022-11-20 09:33:05,986 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 279 places, 253 transitions, 783 flow [2022-11-20 09:33:05,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 09:33:05,987 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 09:33:05,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1523 transitions. [2022-11-20 09:33:05,992 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7798259088581669 [2022-11-20 09:33:05,992 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1523 transitions. [2022-11-20 09:33:05,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1523 transitions. [2022-11-20 09:33:05,993 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:33:05,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1523 transitions. [2022-11-20 09:33:05,997 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 217.57142857142858) internal successors, (1523), 7 states have internal predecessors, (1523), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:06,001 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:06,002 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 279.0) internal successors, (2232), 8 states have internal predecessors, (2232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:06,003 INFO L175 Difference]: Start difference. First operand has 283 places, 250 transitions, 656 flow. Second operand 7 states and 1523 transitions. [2022-11-20 09:33:06,003 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 279 places, 253 transitions, 783 flow [2022-11-20 09:33:06,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 267 places, 253 transitions, 747 flow, removed 8 selfloop flow, removed 12 redundant places. [2022-11-20 09:33:06,011 INFO L231 Difference]: Finished difference. Result has 270 places, 252 transitions, 653 flow [2022-11-20 09:33:06,011 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=620, PETRI_DIFFERENCE_MINUEND_PLACES=261, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=243, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=653, PETRI_PLACES=270, PETRI_TRANSITIONS=252} [2022-11-20 09:33:06,013 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 21 predicate places. [2022-11-20 09:33:06,013 INFO L495 AbstractCegarLoop]: Abstraction has has 270 places, 252 transitions, 653 flow [2022-11-20 09:33:06,030 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 216.28571428571428) internal successors, (1514), 7 states have internal predecessors, (1514), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:33:06,030 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:33:06,030 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:33:06,041 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 09:33:06,231 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:06,231 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:33:06,232 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:33:06,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1767131809, now seen corresponding path program 1 times [2022-11-20 09:33:06,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:33:06,232 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1919458589] [2022-11-20 09:33:06,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:06,232 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:33:06,259 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:33:06,259 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [189529537] [2022-11-20 09:33:06,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:33:06,260 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:33:06,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:33:06,261 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:33:06,290 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 09:33:06,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 09:33:06,600 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 134 conjunts are in the unsatisfiable core [2022-11-20 09:33:06,609 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:33:07,141 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:33:07,856 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:33:07,857 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 09:33:08,426 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:33:08,427 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2022-11-20 09:33:09,363 INFO L321 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2022-11-20 09:33:09,363 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2022-11-20 09:33:10,407 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:33:10,946 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:10,947 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 09:33:11,191 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:33:11,192 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 09:33:11,570 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 09:33:11,595 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 15 [2022-11-20 09:33:12,691 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:33:12,692 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 59 [2022-11-20 09:33:12,713 INFO L321 Elim1Store]: treesize reduction 41, result has 14.6 percent of original size [2022-11-20 09:33:12,714 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 33 [2022-11-20 09:33:12,722 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 32 [2022-11-20 09:33:14,522 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:33:14,523 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 45 treesize of output 27 [2022-11-20 09:33:14,538 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:33:14,539 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2022-11-20 09:33:14,740 INFO L321 Elim1Store]: treesize reduction 48, result has 12.7 percent of original size [2022-11-20 09:33:14,741 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 4 case distinctions, treesize of input 50 treesize of output 19 [2022-11-20 09:33:14,940 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:33:14,940 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:33:16,675 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:33:16,675 INFO L350 Elim1Store]: Elim1 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 322 treesize of output 294 [2022-11-20 09:33:16,686 INFO L350 Elim1Store]: Elim1 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 143 treesize of output 137 [2022-11-20 09:34:31,702 WARN L233 SmtUtils]: Spent 1.11m on a formula simplification. DAG size of input: 96 DAG size of output: 93 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:35:13,447 WARN L233 SmtUtils]: Spent 28.28s on a formula simplification. DAG size of input: 89 DAG size of output: 78 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:36:00,250 WARN L233 SmtUtils]: Spent 20.69s on a formula simplification. DAG size of input: 72 DAG size of output: 65 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:36:11,985 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-20 09:36:11,986 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1705 treesize of output 1505 [2022-11-20 09:36:17,956 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-20 09:36:17,957 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 3408 treesize of output 2844 [2022-11-20 09:36:23,370 INFO L321 Elim1Store]: treesize reduction 4, result has 97.6 percent of original size [2022-11-20 09:36:23,370 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1673 treesize of output 1473 [2022-11-20 09:37:08,806 WARN L233 SmtUtils]: Spent 17.61s on a formula simplification. DAG size of input: 283 DAG size of output: 54 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:37:16,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:37:16,989 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 30 [2022-11-20 09:37:17,019 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 09:37:17,020 INFO L350 Elim1Store]: Elim1 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 263 treesize of output 251 [2022-11-20 09:37:17,031 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,039 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,048 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,074 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,083 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,090 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:17,100 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 4 [2022-11-20 09:37:28,081 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 09:37:28,082 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-20 09:37:28,097 INFO L321 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2022-11-20 09:37:28,097 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 18 [2022-11-20 09:37:29,811 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 09:37:29,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 09:37:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1919458589] [2022-11-20 09:37:29,812 WARN L310 FreeRefinementEngine]: Interpolation failed due to KNOWN_IGNORE: SMT_SOLVER_CANNOT_INTERPOLATE_INPUT [2022-11-20 09:37:29,812 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [189529537] [2022-11-20 09:37:29,812 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [189529537] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 09:37:29,812 INFO L184 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-11-20 09:37:29,813 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [59, 52] total 106 [2022-11-20 09:37:29,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204022168] [2022-11-20 09:37:29,813 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-11-20 09:37:29,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 106 states [2022-11-20 09:37:29,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 09:37:29,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 106 interpolants. [2022-11-20 09:37:29,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=578, Invalid=10503, Unknown=49, NotChecked=0, Total=11130 [2022-11-20 09:37:29,827 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 73 out of 279 [2022-11-20 09:37:29,835 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 270 places, 252 transitions, 653 flow. Second operand has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:37:29,836 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 09:37:29,836 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 73 of 279 [2022-11-20 09:37:29,836 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 09:38:12,958 INFO L130 PetriNetUnfolder]: 3847/7476 cut-off events. [2022-11-20 09:38:12,958 INFO L131 PetriNetUnfolder]: For 4177/4178 co-relation queries the response was YES. [2022-11-20 09:38:12,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18061 conditions, 7476 events. 3847/7476 cut-off events. For 4177/4178 co-relation queries the response was YES. Maximal size of possible extension queue 174. Compared 49024 event pairs, 1633 based on Foata normal form. 2/7438 useless extension candidates. Maximal degree in co-relation 18043. Up to 1473 conditions per place. [2022-11-20 09:38:13,021 INFO L137 encePairwiseOnDemand]: 184/279 looper letters, 443 selfloop transitions, 181 changer transitions 13/704 dead transitions. [2022-11-20 09:38:13,021 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 392 places, 704 transitions, 3252 flow [2022-11-20 09:38:13,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 123 states. [2022-11-20 09:38:13,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 123 states. [2022-11-20 09:38:13,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 9602 transitions. [2022-11-20 09:38:13,042 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.27980301308389427 [2022-11-20 09:38:13,043 INFO L72 ComplementDD]: Start complementDD. Operand 123 states and 9602 transitions. [2022-11-20 09:38:13,043 INFO L73 IsDeterministic]: Start isDeterministic. Operand 123 states and 9602 transitions. [2022-11-20 09:38:13,048 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 09:38:13,048 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 123 states and 9602 transitions. [2022-11-20 09:38:13,067 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 124 states, 123 states have (on average 78.0650406504065) internal successors, (9602), 123 states have internal predecessors, (9602), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:13,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:13,120 INFO L81 ComplementDD]: Finished complementDD. Result has 124 states, 124 states have (on average 279.0) internal successors, (34596), 124 states have internal predecessors, (34596), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:13,121 INFO L175 Difference]: Start difference. First operand has 270 places, 252 transitions, 653 flow. Second operand 123 states and 9602 transitions. [2022-11-20 09:38:13,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 392 places, 704 transitions, 3252 flow [2022-11-20 09:38:13,148 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 388 places, 704 transitions, 3219 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 09:38:13,160 INFO L231 Difference]: Finished difference. Result has 429 places, 381 transitions, 1731 flow [2022-11-20 09:38:13,161 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=279, PETRI_DIFFERENCE_MINUEND_FLOW=645, PETRI_DIFFERENCE_MINUEND_PLACES=266, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=252, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=64, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=154, PETRI_DIFFERENCE_SUBTRAHEND_STATES=123, PETRI_FLOW=1731, PETRI_PLACES=429, PETRI_TRANSITIONS=381} [2022-11-20 09:38:13,163 INFO L288 CegarLoopForPetriNet]: 249 programPoint places, 180 predicate places. [2022-11-20 09:38:13,163 INFO L495 AbstractCegarLoop]: Abstraction has has 429 places, 381 transitions, 1731 flow [2022-11-20 09:38:13,166 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 106 states, 106 states have (on average 76.0) internal successors, (8056), 106 states have internal predecessors, (8056), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-11-20 09:38:13,166 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 09:38:13,167 INFO L209 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-11-20 09:38:13,179 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2022-11-20 09:38:13,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:38:13,374 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES] === [2022-11-20 09:38:13,375 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 09:38:13,375 INFO L85 PathProgramCache]: Analyzing trace with hash 797635391, now seen corresponding path program 2 times [2022-11-20 09:38:13,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 09:38:13,375 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1609776864] [2022-11-20 09:38:13,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 09:38:13,375 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 09:38:13,414 ERROR L245 FreeRefinementEngine]: Caught known exception: Unsupported non-linear arithmetic [2022-11-20 09:38:13,418 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleZ3 [719513293] [2022-11-20 09:38:13,419 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 09:38:13,419 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 09:38:13,419 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 09:38:13,420 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 09:38:13,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_5e4bd1e3-83df-42fc-bb8a-cac02d900f62/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2022-11-20 09:38:13,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 09:38:13,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 09:38:13,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 556 conjuncts, 128 conjunts are in the unsatisfiable core [2022-11-20 09:38:13,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 09:38:14,455 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-11-20 09:38:15,391 INFO L321 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2022-11-20 09:38:15,392 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 17 treesize of output 21 [2022-11-20 09:38:16,636 INFO L321 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2022-11-20 09:38:16,637 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2022-11-20 09:38:18,202 INFO L321 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2022-11-20 09:38:18,203 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2022-11-20 09:38:19,286 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:38:19,301 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-11-20 09:38:20,062 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:20,063 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 09:38:20,078 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-20 09:38:20,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 09:38:20,440 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 23 [2022-11-20 09:38:20,454 INFO L350 Elim1Store]: Elim1 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 6 treesize of output 5 [2022-11-20 09:38:22,169 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:38:22,200 INFO L321 Elim1Store]: treesize reduction 63, result has 14.9 percent of original size [2022-11-20 09:38:22,200 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 25 treesize of output 21 [2022-11-20 09:38:22,213 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-11-20 09:38:22,232 INFO L350 Elim1Store]: Elim1 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 30 treesize of output 28 [2022-11-20 09:38:23,035 INFO L321 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-11-20 09:38:23,035 INFO L350 Elim1Store]: Elim1 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 63 [2022-11-20 09:38:23,067 INFO L321 Elim1Store]: treesize reduction 61, result has 10.3 percent of original size [2022-11-20 09:38:23,067 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 37 [2022-11-20 09:38:23,076 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 36 [2022-11-20 09:38:26,072 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:38:26,073 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 19 [2022-11-20 09:38:26,090 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 09:38:26,091 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 23 [2022-11-20 09:38:26,388 INFO L321 Elim1Store]: treesize reduction 81, result has 8.0 percent of original size [2022-11-20 09:38:26,388 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 50 treesize of output 19 [2022-11-20 09:38:26,768 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 09:38:26,769 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 09:38:31,903 INFO L321 Elim1Store]: treesize reduction 4, result has 98.1 percent of original size [2022-11-20 09:38:31,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2220 treesize of output 1773 [2022-11-20 09:39:43,070 WARN L233 SmtUtils]: Spent 1.07m on a formula simplification that was a NOOP. DAG size: 196 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:40:34,865 WARN L233 SmtUtils]: Spent 46.97s on a formula simplification that was a NOOP. DAG size: 200 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:41:32,274 WARN L233 SmtUtils]: Spent 53.59s on a formula simplification that was a NOOP. DAG size: 202 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:35,080 WARN L233 SmtUtils]: Spent 59.92s on a formula simplification. DAG size of input: 168 DAG size of output: 165 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:42:36,960 WARN L837 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (not (< 0 c_~M~0)) (let ((.cse6 (select (select |c_#memory_$Pointer$.offset| c_~B~0.base) c_~B~0.offset))) (let ((.cse44 (- c_~A~0.offset)) (.cse12 (div (+ c_~A~0.offset (- .cse6)) (- 4))) (.cse1 (select (select |c_#memory_$Pointer$.base| c_~B~0.base) c_~B~0.offset))) (let ((.cse0 (= .cse1 c_~A~0.base)) (.cse8 (not (= (mod (+ c_~A~0.offset (* 3 .cse6)) 4) 0))) (.cse9 (* .cse12 4)) (.cse30 (+ (div (+ .cse44 .cse6) 4) 2)) (.cse4 (* 4 c_~M~0)) (.cse5 (+ 5 .cse6)) (.cse24 (div (+ (- 1) .cse44 .cse6) 4))) (and (or .cse0 (and (forall ((~a~0 Int)) (or (< (+ (* ~a~0 c_~M~0) c_~M~0) 2) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (<= c_~N~0 ~a~0))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse2 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse1 .cse2) (= c_~A~0.base .cse2) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse3 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse3) .cse4) .cse5) (< ~a~0 0) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse3)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse7 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (< .cse6 (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse7) 1)) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse7)) (<= c_~N~0 ~a~0)))))) (or .cse8 (and (forall ((~a~0 Int)) (let ((.cse11 (* ~a~0 c_~M~0)) (.cse10 (+ (* ~a~0 4) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ .cse9 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse10)) (+ c_~A~0.offset (* .cse11 4)))) (< ~a~0 0) (<= (+ .cse11 c_~M~0) .cse12) (< .cse12 .cse11) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse10))) (<= c_~N~0 ~a~0)))) (forall ((~a~0 Int)) (let ((.cse13 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse13 c_~M~0) .cse12) (< .cse12 .cse13) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse14 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse1 .cse14) (= c_~A~0.base .cse14)))) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse15 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse15) .cse4) .cse5) (< ~a~0 0) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse4) .cse5) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse15)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse17 (* ~a~0 c_~M~0))) (let ((.cse16 (* .cse17 4))) (or (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse16)) (< (+ .cse17 c_~M~0) 2) (< (+ c_~A~0.offset .cse16 .cse4) .cse5) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse18 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse19 (* (* ~a~0 c_~M~0) 4))) (or (< (+ .cse18 .cse4) .cse5) (< ~a~0 0) (= .cse18 (+ c_~A~0.offset .cse19)) (< (+ c_~A~0.offset .cse19 .cse4) .cse5) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse20 (* (* ~a~0 c_~M~0) 4)) (.cse21 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse6 (+ c_~A~0.offset .cse20 1)) (< ~a~0 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse21) (+ c_~A~0.offset .cse20)) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse21)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse22 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse6 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse1 .cse22) (= c_~A~0.base .cse22) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse23 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse23) .cse4) .cse5) (< ~a~0 0) (< .cse24 (* ~a~0 c_~M~0)) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse23)) (<= c_~N~0 ~a~0)))) (or .cse0 (and (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse25 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse25) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse25)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse26 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse26 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< .cse6 (+ .cse26 1)) (<= c_~N~0 ~a~0)))) (forall ((~a~0 Int)) (let ((.cse27 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset (* .cse27 4)))) (< (+ .cse27 c_~M~0) 2) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse28 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (+ .cse28 .cse4) .cse5) (< ~a~0 0) (= .cse28 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse29 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (< .cse6 (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse29) 1)) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse29)) (< (+ (* ~a~0 c_~M~0) c_~M~0) .cse30) (<= c_~N~0 ~a~0)))) (or .cse8 (and (forall ((~a~0 Int)) (let ((.cse31 (+ (* ~a~0 4) c_~B~0.offset)) (.cse32 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse31) (+ c_~A~0.offset (* .cse32 4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse31))) (<= (+ .cse32 c_~M~0) .cse12) (< .cse12 .cse32) (<= c_~N~0 ~a~0)))) (forall ((~a~0 Int)) (let ((.cse33 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse33 c_~M~0) .cse12) (< .cse12 .cse33) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse34 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse35 (+ c_~A~0.offset (* .cse33 4)))) (or (= (+ .cse9 .cse34) .cse35) (= .cse34 .cse35)))) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse36 (+ (* ~a~0 4) c_~B~0.offset)) (.cse37 (* (* ~a~0 c_~M~0) 4))) (or (< ~a~0 0) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse36) (+ c_~A~0.offset .cse37)) (= .cse1 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse36)) (< (+ c_~A~0.offset .cse37 .cse4) .cse5) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse38 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse6 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (< .cse6 (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) .cse38) 1)) (= c_~A~0.base (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) .cse38)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse40 (* ~a~0 c_~M~0))) (let ((.cse39 (* .cse40 4))) (or (< .cse6 (+ c_~A~0.offset .cse39 1)) (= (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse39)) (< (+ .cse40 c_~M~0) 2) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (let ((.cse41 (* (* ~a~0 c_~M~0) 4)) (.cse42 (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse6 (+ c_~A~0.offset .cse41 1)) (< ~a~0 0) (= .cse42 (+ c_~A~0.offset .cse41)) (< .cse6 (+ .cse42 1)) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse43 (select (select (store (store |c_#memory_$Pointer$.base| c_~A~0.base v_ArrVal_740) .cse1 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse1 .cse43) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse4) .cse5) (= c_~A~0.base .cse43) (<= c_~N~0 ~a~0)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (or (< ~a~0 0) (< .cse6 (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (< (+ (* ~a~0 c_~M~0) c_~M~0) .cse30) (<= c_~N~0 ~a~0))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_739 (Array Int Int))) (or (< (+ (select (select (store (store |c_#memory_$Pointer$.offset| c_~A~0.base v_ArrVal_739) .cse1 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse4) .cse5) (< ~a~0 0) (< .cse24 (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0)))))))) is different from false [2022-11-20 09:42:42,071 WARN L837 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (not (< 0 c_~M~0)) (let ((.cse9 (- c_~A~0.offset)) (.cse44 (* 4 c_~M~0))) (and (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse4 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse1 (div (+ c_~A~0.offset (- .cse5)) (- 4))) (.cse0 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse0 c_~M~0) .cse1) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (select (select (store (store .cse4 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse3 (+ c_~A~0.offset (* .cse0 4)))) (or (= .cse2 .cse3) (= (+ (* .cse1 4) .cse2) .cse3)))) (< .cse1 .cse0) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* .cse5 3)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse6 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse11 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse10 (select (select .cse11 c_~B~0.base) c_~B~0.offset)) (.cse7 (select (select .cse6 c_~B~0.base) c_~B~0.offset)) (.cse8 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse6 c_~A~0.base v_ArrVal_740) .cse7 v_ArrVal_743) c_~B~0.base) .cse8) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ (div (+ .cse9 .cse10) 4) 2)) (< .cse10 (+ (select (select (store (store .cse11 c_~A~0.base v_ArrVal_739) .cse7 v_ArrVal_744) c_~B~0.base) .cse8) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse13 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse16 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse12 (select (select .cse16 c_~B~0.base) c_~B~0.offset)) (.cse14 (select (select .cse13 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse12 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse13 c_~A~0.base v_ArrVal_740) .cse14 v_ArrVal_743) c_~B~0.base) .cse15) c_~A~0.base) (< .cse12 (+ (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse14 v_ArrVal_744) c_~B~0.base) .cse15) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse17 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse18 (select (select .cse17 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse19 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse17 c_~A~0.base v_ArrVal_740) .cse18 v_ArrVal_743) c_~B~0.base) .cse19) .cse18) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse18 v_ArrVal_744) c_~B~0.base) .cse19) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (<= c_~N~0 ~a~0)))) (= .cse18 c_~A~0.base))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse20 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (= .cse20 c_~A~0.base) (forall ((~a~0 Int) (v_ArrVal_737 (Array Int Int))) (let ((.cse21 (* ~a~0 c_~M~0))) (or (< (+ .cse21 c_~M~0) 2) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse20 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset (* .cse21 4)))) (<= c_~N~0 ~a~0))))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse24 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse22 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse25 (select (select .cse24 c_~B~0.base) c_~B~0.offset)) (.cse26 (+ (* ~a~0 4) c_~B~0.offset)) (.cse23 (* (* ~a~0 c_~M~0) 4))) (or (< (select (select .cse22 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse23 1)) (< ~a~0 0) (= (select (select (store (store .cse24 c_~A~0.base v_ArrVal_740) .cse25 v_ArrVal_743) c_~B~0.base) .cse26) .cse25) (= (select (select (store (store .cse22 c_~A~0.base v_ArrVal_739) .cse25 v_ArrVal_744) c_~B~0.base) .cse26) (+ c_~A~0.offset .cse23)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse33 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse27 (select (select .cse33 c_~B~0.base) c_~B~0.offset))) (or (not (= (mod (+ c_~A~0.offset (* .cse27 3)) 4) 0)) (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse28 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse29 (select (select .cse28 c_~B~0.base) c_~B~0.offset)) (.cse30 (+ (* ~a~0 4) c_~B~0.offset)) (.cse32 (div (+ c_~A~0.offset (- .cse27)) (- 4))) (.cse31 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse28 c_~A~0.base v_ArrVal_740) .cse29 v_ArrVal_743) c_~B~0.base) .cse30) .cse29)) (< ~a~0 0) (<= (+ .cse31 c_~M~0) .cse32) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse33 c_~A~0.base v_ArrVal_739) .cse29 v_ArrVal_744) c_~B~0.base) .cse30) (+ c_~A~0.offset (* .cse31 4)))) (< .cse32 .cse31) (<= c_~N~0 ~a~0))))))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse36 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse35 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse34 (select (select (store (store .cse35 c_~A~0.base v_ArrVal_739) .cse36 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse34 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (select (select .cse35 c_~B~0.base) c_~B~0.offset) (+ .cse34 1)) (<= c_~N~0 ~a~0))))) (= .cse36 c_~A~0.base)))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse38 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse37 (select (select .cse38 c_~B~0.base) c_~B~0.offset))) (or (= .cse37 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse39 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse38 c_~A~0.base v_ArrVal_740) .cse37 v_ArrVal_743) c_~B~0.base) .cse39) c_~A~0.base) (let ((.cse40 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse40 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse40 c_~A~0.base v_ArrVal_739) .cse37 v_ArrVal_744) c_~B~0.base) .cse39) 1))) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse45 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse41 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse42 (select (select .cse41 c_~B~0.base) c_~B~0.offset)) (.cse43 (+ (* ~a~0 4) c_~B~0.offset)) (.cse46 (select (select .cse45 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse41 c_~A~0.base v_ArrVal_740) .cse42 v_ArrVal_743) c_~B~0.base) .cse43) c_~A~0.base) (< (+ .cse44 (select (select (store (store .cse45 c_~A~0.base v_ArrVal_739) .cse42 v_ArrVal_744) c_~B~0.base) .cse43)) (+ .cse46 5)) (< (div (+ (- 1) .cse9 .cse46) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse49 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse48 (select (select .cse49 c_~B~0.base) c_~B~0.offset))) (let ((.cse47 (select (select (store (store .cse49 c_~A~0.base v_ArrVal_740) .cse48 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse47 .cse48) (= .cse47 c_~A~0.base) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse50 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse51 (select (select .cse50 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ .cse44 (select (select (store (store .cse50 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (+ .cse51 5)) (< (div (+ (- 1) .cse9 .cse51) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse52 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse53 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse54 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse52 c_~A~0.base v_ArrVal_740) .cse53 v_ArrVal_743) c_~B~0.base) .cse54) c_~A~0.base) (let ((.cse55 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ .cse44 (select (select (store (store .cse55 c_~A~0.base v_ArrVal_739) .cse53 v_ArrVal_744) c_~B~0.base) .cse54)) (+ (select (select .cse55 c_~B~0.base) c_~B~0.offset) 5))) (<= c_~N~0 ~a~0)))) (= .cse53 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse59 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse56 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse57 (select (select .cse56 c_~B~0.base) c_~B~0.offset)) (.cse58 (+ (* ~a~0 4) c_~B~0.offset)) (.cse60 (+ (select (select .cse59 c_~B~0.base) c_~B~0.offset) 5))) (or (< ~a~0 0) (= (select (select (store (store .cse56 c_~A~0.base v_ArrVal_740) .cse57 v_ArrVal_743) c_~B~0.base) .cse58) c_~A~0.base) (< (+ .cse44 (select (select (store (store .cse59 c_~A~0.base v_ArrVal_739) .cse57 v_ArrVal_744) c_~B~0.base) .cse58)) .cse60) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse44) .cse60) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse62 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse61 (select (select .cse62 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ (div (+ .cse9 .cse61) 4) 2)) (< .cse61 (+ (select (select (store (store .cse62 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse63 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse64 (select (select .cse63 c_~B~0.base) c_~B~0.offset)) (.cse65 (+ (* ~a~0 4) c_~B~0.offset)) (.cse67 (* (* ~a~0 c_~M~0) 4)) (.cse66 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (< ~a~0 0) (= (select (select (store (store .cse63 c_~A~0.base v_ArrVal_740) .cse64 v_ArrVal_743) c_~B~0.base) .cse65) .cse64) (= (select (select (store (store .cse66 c_~A~0.base v_ArrVal_739) .cse64 v_ArrVal_744) c_~B~0.base) .cse65) (+ c_~A~0.offset .cse67)) (< (+ c_~A~0.offset .cse67 .cse44) (+ (select (select .cse66 c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse71 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse69 (* (* ~a~0 c_~M~0) 4)) (.cse68 (select (select .cse71 c_~B~0.base) c_~B~0.offset)) (.cse70 (select (select (store (store .cse71 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse68 (+ c_~A~0.offset .cse69 1)) (< ~a~0 0) (= .cse70 (+ c_~A~0.offset .cse69)) (< .cse68 (+ .cse70 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse75 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse72 (select (select (store (store .cse75 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse74 (* (* ~a~0 c_~M~0) 4)) (.cse73 (+ (select (select .cse75 c_~B~0.base) c_~B~0.offset) 5))) (or (< ~a~0 0) (< (+ .cse44 .cse72) .cse73) (= .cse72 (+ c_~A~0.offset .cse74)) (< (+ c_~A~0.offset .cse74 .cse44) .cse73) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse78 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse77 (select (select .cse78 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse76 (select (select (store (store .cse78 c_~A~0.base v_ArrVal_740) .cse77 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse76 .cse77) (= .cse76 c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse77 c_~A~0.base))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse81 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse80 (select (select .cse81 c_~B~0.base) c_~B~0.offset))) (let ((.cse79 (select (select (store (store .cse81 c_~A~0.base v_ArrVal_740) .cse80 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse79 .cse80) (= .cse79 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse44) (+ (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse84 (* ~a~0 c_~M~0))) (let ((.cse82 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse83 (* .cse84 4))) (or (< (select (select .cse82 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse83 1)) (< (+ .cse84 c_~M~0) 2) (= (select (select (store (store .cse82 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse83)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse85 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse86 (select (select .cse85 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int)) (or (< (+ (* ~a~0 c_~M~0) c_~M~0) 2) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse85 c_~A~0.base v_ArrVal_740) .cse86 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (<= c_~N~0 ~a~0))) (= .cse86 c_~A~0.base))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse88 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse93 (select (select .cse88 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse92 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse89 (select (select .cse92 c_~B~0.base) c_~B~0.offset)) (.cse90 (+ (* ~a~0 4) c_~B~0.offset)) (.cse87 (div (+ c_~A~0.offset (- .cse93)) (- 4))) (.cse91 (* ~a~0 c_~M~0))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (* .cse87 4) (select (select (store (store .cse88 c_~A~0.base v_ArrVal_739) .cse89 v_ArrVal_744) c_~B~0.base) .cse90)) (+ c_~A~0.offset (* .cse91 4)))) (< ~a~0 0) (<= (+ .cse91 c_~M~0) .cse87) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse92 c_~A~0.base v_ArrVal_740) .cse89 v_ArrVal_743) c_~B~0.base) .cse90) c_~A~0.base)) (< .cse87 .cse91) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* .cse93 3)) 4) 0)))))) (forall ((v_ArrVal_737 (Array Int Int))) (let ((.cse99 (select (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse95 (div (+ c_~A~0.offset (- .cse99)) (- 4))) (.cse94 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (<= (+ .cse94 c_~M~0) .cse95) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse98 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse97 (select (select .cse98 c_~B~0.base) c_~B~0.offset))) (let ((.cse96 (select (select (store (store .cse98 c_~A~0.base v_ArrVal_740) .cse97 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse96 .cse97) (= .cse96 c_~A~0.base)))))) (< .cse95 .cse94) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* .cse99 3)) 4) 0))))) (forall ((v_ArrVal_736 (Array Int Int))) (let ((.cse102 (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse101 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse100 (select (select (store (store .cse101 c_~A~0.base v_ArrVal_739) .cse102 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (< (+ .cse44 .cse100) (+ (select (select .cse101 c_~B~0.base) c_~B~0.offset) 5)) (= .cse100 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (<= c_~N~0 ~a~0))))) (= .cse102 c_~A~0.base)))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse103 (* ~a~0 c_~M~0))) (let ((.cse105 (* .cse103 4)) (.cse104 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (< (+ .cse103 c_~M~0) 2) (= (select (select (store (store .cse104 c_~A~0.base v_ArrVal_739) (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse105)) (< (+ c_~A~0.offset .cse105 .cse44) (+ (select (select .cse104 c_~B~0.base) c_~B~0.offset) 5)) (<= c_~N~0 ~a~0)))))))) is different from false [2022-11-20 09:42:49,390 WARN L837 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (not (< 0 c_~M~0)) (let ((.cse0 (- c_~A~0.offset)) (.cse34 (* 4 c_~M~0))) (and (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse1 (select (select .cse2 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse1) 4))) (< .cse1 (+ (select (select (store (store .cse2 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse3 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse6 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse3 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse4 c_~A~0.base v_ArrVal_740) .cse5 v_ArrVal_743) c_~B~0.base) .cse6) c_~A~0.base) (< .cse3 (+ (select (select (store (store .cse7 c_~A~0.base v_ArrVal_739) .cse5 v_ArrVal_744) c_~B~0.base) .cse6) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse8 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse8 v_ArrVal_744) c_~B~0.base) .cse9) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (= .cse8 (select (select (store (store .cse10 c_~A~0.base v_ArrVal_740) .cse8 v_ArrVal_743) c_~B~0.base) .cse9)) (<= c_~N~0 ~a~0)))) (= .cse8 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse11 (div (+ c_~A~0.offset (- .cse17)) (- 4))) (.cse13 (select (select .cse14 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset)) (.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse11 .cse12) (<= (+ .cse12 c_~M~0) .cse11) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= .cse13 (select (select (store (store .cse14 c_~A~0.base v_ArrVal_740) .cse13 v_ArrVal_743) c_~B~0.base) .cse15))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse13 v_ArrVal_744) c_~B~0.base) .cse15) (+ c_~A~0.offset (* .cse12 4)))) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse17)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse20 (* ~a~0 c_~M~0))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse19 (* .cse20 4))) (or (< (select (select .cse18 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse19 1)) (= (select (select (store (store .cse18 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse19)) (< (+ .cse20 c_~M~0) 2) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse27 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse22 (select (select .cse26 c_~B~0.base) c_~B~0.offset)) (.cse23 (+ (* ~a~0 4) c_~B~0.offset)) (.cse25 (* ~a~0 c_~M~0)) (.cse24 (div (+ c_~A~0.offset (- .cse27)) (- 4)))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (select (select (store (store .cse21 c_~A~0.base v_ArrVal_739) .cse22 v_ArrVal_744) c_~B~0.base) .cse23) (* .cse24 4)) (+ c_~A~0.offset (* .cse25 4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse26 c_~A~0.base v_ArrVal_740) .cse22 v_ArrVal_743) c_~B~0.base) .cse23) c_~A~0.base)) (< ~a~0 0) (< .cse24 .cse25) (<= (+ .cse25 c_~M~0) .cse24) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse27)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse29 (* (* ~a~0 c_~M~0) 4)) (.cse30 (select (select .cse32 c_~B~0.base) c_~B~0.offset)) (.cse31 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (select (select .cse28 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse29 1)) (= (select (select (store (store .cse28 c_~A~0.base v_ArrVal_739) .cse30 v_ArrVal_744) c_~B~0.base) .cse31) (+ c_~A~0.offset .cse29)) (< ~a~0 0) (= .cse30 (select (select (store (store .cse32 c_~A~0.base v_ArrVal_740) .cse30 v_ArrVal_743) c_~B~0.base) .cse31)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store (store .cse36 c_~A~0.base v_ArrVal_740) .cse35 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse33 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (= .cse35 .cse33) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse38 (select (select .cse41 c_~B~0.base) c_~B~0.offset)) (.cse39 (+ (* ~a~0 4) c_~B~0.offset)) (.cse40 (+ 5 (select (select .cse37 c_~B~0.base) c_~B~0.offset)))) (or (< (+ (select (select (store (store .cse37 c_~A~0.base v_ArrVal_739) .cse38 v_ArrVal_744) c_~B~0.base) .cse39) .cse34) .cse40) (< ~a~0 0) (= (select (select (store (store .cse41 c_~A~0.base v_ArrVal_740) .cse38 v_ArrVal_743) c_~B~0.base) .cse39) c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) .cse40) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse43 (* ~a~0 c_~M~0)) (.cse42 (div (+ c_~A~0.offset (- .cse47)) (- 4)))) (or (< ~a~0 0) (< .cse42 .cse43) (<= (+ .cse43 c_~M~0) .cse42) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse45 (select (select .cse46 c_~B~0.base) c_~B~0.offset))) (let ((.cse44 (select (select (store (store .cse46 c_~A~0.base v_ArrVal_740) .cse45 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse44 c_~A~0.base) (= .cse45 .cse44)))))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse47)) 4) 0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse49 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse50 (+ (* ~a~0 4) c_~B~0.offset))) (or (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ (select (select (store (store .cse48 c_~A~0.base v_ArrVal_739) .cse49 v_ArrVal_744) c_~B~0.base) .cse50) .cse34) (+ 5 (select (select .cse48 c_~B~0.base) c_~B~0.offset)))) (< ~a~0 0) (= (select (select (store (store .cse51 c_~A~0.base v_ArrVal_740) .cse49 v_ArrVal_743) c_~B~0.base) .cse50) c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse49 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse53 (select (select .cse56 c_~B~0.base) c_~B~0.offset)) (.cse54 (+ (* ~a~0 4) c_~B~0.offset)) (.cse55 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse52 c_~A~0.base v_ArrVal_739) .cse53 v_ArrVal_744) c_~B~0.base) .cse54) .cse34) (+ 5 .cse55)) (< ~a~0 0) (= (select (select (store (store .cse56 c_~A~0.base v_ArrVal_740) .cse53 v_ArrVal_743) c_~B~0.base) .cse54) c_~A~0.base) (< (div (+ (- 1) .cse0 .cse55) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse58 (select (select .cse57 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse59 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse57 c_~A~0.base v_ArrVal_740) .cse58 v_ArrVal_743) c_~B~0.base) .cse59) c_~A~0.base) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse60 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse60 c_~A~0.base v_ArrVal_739) .cse58 v_ArrVal_744) c_~B~0.base) .cse59) 1))) (<= c_~N~0 ~a~0)))) (= .cse58 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse62 (select (select .cse61 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse61 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse34) (+ 5 .cse62)) (< ~a~0 0) (< (div (+ (- 1) .cse0 .cse62) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse65 (* ~a~0 c_~M~0))) (let ((.cse64 (* .cse65 4)) (.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (= (select (select (store (store .cse63 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse64)) (< (+ .cse65 c_~M~0) 2) (< (+ c_~A~0.offset .cse64 .cse34) (+ 5 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse69 (* (* ~a~0 c_~M~0) 4)) (.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse67 (select (select .cse70 c_~B~0.base) c_~B~0.offset)) (.cse68 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store .cse66 c_~A~0.base v_ArrVal_739) .cse67 v_ArrVal_744) c_~B~0.base) .cse68) (+ c_~A~0.offset .cse69)) (< ~a~0 0) (< (+ c_~A~0.offset .cse69 .cse34) (+ 5 (select (select .cse66 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store (store .cse70 c_~A~0.base v_ArrVal_740) .cse67 v_ArrVal_743) c_~B~0.base) .cse68)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse74 (select (select .cse75 c_~B~0.base) c_~B~0.offset)) (.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset)) (.cse73 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse71 c_~A~0.base v_ArrVal_740) .cse72 v_ArrVal_743) c_~B~0.base) .cse73) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse74) 4))) (< .cse74 (+ (select (select (store (store .cse75 c_~A~0.base v_ArrVal_739) .cse72 v_ArrVal_744) c_~B~0.base) .cse73) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse77 (* (* ~a~0 c_~M~0) 4)) (.cse76 (select (select .cse79 c_~B~0.base) c_~B~0.offset)) (.cse78 (select (select (store (store .cse79 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse76 (+ c_~A~0.offset .cse77 1)) (= .cse78 (+ c_~A~0.offset .cse77)) (< ~a~0 0) (< .cse76 (+ .cse78 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse80 (select (select (store (store .cse82 c_~A~0.base v_ArrVal_740) .cse81 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse80 c_~A~0.base) (= .cse81 .cse80) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse83 (select (select (store (store .cse86 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse84 (* (* ~a~0 c_~M~0) 4)) (.cse85 (+ 5 (select (select .cse86 c_~B~0.base) c_~B~0.offset)))) (or (= .cse83 (+ c_~A~0.offset .cse84)) (< (+ .cse83 .cse34) .cse85) (< ~a~0 0) (< (+ c_~A~0.offset .cse84 .cse34) .cse85) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (= .cse87 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse88 (select (select (store (store .cse89 c_~A~0.base v_ArrVal_739) .cse87 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse88 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (< (select (select .cse89 c_~B~0.base) c_~B~0.offset) (+ .cse88 1)) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse91 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_737 (Array Int Int))) (let ((.cse90 (* ~a~0 c_~M~0))) (or (< (+ .cse90 c_~M~0) 2) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse91 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset (* .cse90 4)))) (<= c_~N~0 ~a~0)))) (= .cse91 c_~A~0.base)))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse94 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse93 (select (select .cse94 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse92 (select (select (store (store .cse94 c_~A~0.base v_ArrVal_740) .cse93 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse92 c_~A~0.base) (= .cse93 .cse92) (<= c_~N~0 ~a~0)))) (= .cse93 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse99 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse100 (select (select .cse99 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse95 (div (+ c_~A~0.offset (- .cse100)) (- 4))) (.cse96 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse95 .cse96) (<= (+ .cse96 c_~M~0) .cse95) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse97 (select (select (store (store .cse99 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse98 (+ c_~A~0.offset (* .cse96 4)))) (or (= .cse97 .cse98) (= (+ .cse97 (* .cse95 4)) .cse98)))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse100)) 4) 0)))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse103 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse102 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse101 (select (select (store (store .cse102 c_~A~0.base v_ArrVal_739) .cse103 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse101 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (+ .cse101 .cse34) (+ 5 (select (select .cse102 c_~B~0.base) c_~B~0.offset))) (< ~a~0 0) (<= c_~N~0 ~a~0))))) (= .cse103 c_~A~0.base)))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse105 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse104 (select (select .cse105 c_~B~0.base) c_~B~0.offset))) (or (= .cse104 c_~A~0.base) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse105 c_~A~0.base v_ArrVal_740) .cse104 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< (+ (* ~a~0 c_~M~0) c_~M~0) 2) (<= c_~N~0 ~a~0)))))))))) is different from false [2022-11-20 09:44:35,872 WARN L233 SmtUtils]: Spent 1.57m on a formula simplification that was a NOOP. DAG size: 181 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:44:38,771 WARN L837 $PredicateComparison]: unable to prove that (or (< 1 c_~M~0) (not (< 0 c_~M~0)) (let ((.cse0 (- c_~A~0.offset)) (.cse34 (* 4 c_~M~0))) (and (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse2 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse1 (select (select .cse2 c_~B~0.base) c_~B~0.offset))) (or (< ~a~0 0) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse1) 4))) (< .cse1 (+ (select (select (store (store .cse2 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse4 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse7 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse3 (select (select .cse7 c_~B~0.base) c_~B~0.offset)) (.cse5 (select (select .cse4 c_~B~0.base) c_~B~0.offset)) (.cse6 (+ (* ~a~0 4) c_~B~0.offset))) (or (< .cse3 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= (select (select (store (store .cse4 c_~A~0.base v_ArrVal_740) .cse5 v_ArrVal_743) c_~B~0.base) .cse6) c_~A~0.base) (< .cse3 (+ (select (select (store (store .cse7 c_~A~0.base v_ArrVal_739) .cse5 v_ArrVal_744) c_~B~0.base) .cse6) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse8 (select (select .cse10 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse9 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse8 v_ArrVal_744) c_~B~0.base) .cse9) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (= .cse8 (select (select (store (store .cse10 c_~A~0.base v_ArrVal_740) .cse8 v_ArrVal_743) c_~B~0.base) .cse9)) (<= c_~N~0 ~a~0)))) (= .cse8 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse17 (select (select .cse16 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse11 (div (+ c_~A~0.offset (- .cse17)) (- 4))) (.cse13 (select (select .cse14 c_~B~0.base) c_~B~0.offset)) (.cse15 (+ (* ~a~0 4) c_~B~0.offset)) (.cse12 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse11 .cse12) (<= (+ .cse12 c_~M~0) .cse11) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= .cse13 (select (select (store (store .cse14 c_~A~0.base v_ArrVal_740) .cse13 v_ArrVal_743) c_~B~0.base) .cse15))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store .cse16 c_~A~0.base v_ArrVal_739) .cse13 v_ArrVal_744) c_~B~0.base) .cse15) (+ c_~A~0.offset (* .cse12 4)))) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse17)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse20 (* ~a~0 c_~M~0))) (let ((.cse18 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse19 (* .cse20 4))) (or (< (select (select .cse18 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse19 1)) (= (select (select (store (store .cse18 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse19)) (< (+ .cse20 c_~M~0) 2) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse27 (select (select .cse21 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse22 (select (select .cse26 c_~B~0.base) c_~B~0.offset)) (.cse23 (+ (* ~a~0 4) c_~B~0.offset)) (.cse25 (* ~a~0 c_~M~0)) (.cse24 (div (+ c_~A~0.offset (- .cse27)) (- 4)))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (+ (select (select (store (store .cse21 c_~A~0.base v_ArrVal_739) .cse22 v_ArrVal_744) c_~B~0.base) .cse23) (* .cse24 4)) (+ c_~A~0.offset (* .cse25 4)))) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse26 c_~A~0.base v_ArrVal_740) .cse22 v_ArrVal_743) c_~B~0.base) .cse23) c_~A~0.base)) (< ~a~0 0) (< .cse24 .cse25) (<= (+ .cse25 c_~M~0) .cse24) (<= c_~N~0 ~a~0))))) (not (= (mod (+ c_~A~0.offset (* 3 .cse27)) 4) 0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse28 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse29 (* (* ~a~0 c_~M~0) 4)) (.cse30 (select (select .cse32 c_~B~0.base) c_~B~0.offset)) (.cse31 (+ (* ~a~0 4) c_~B~0.offset))) (or (< (select (select .cse28 c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset .cse29 1)) (= (select (select (store (store .cse28 c_~A~0.base v_ArrVal_739) .cse30 v_ArrVal_744) c_~B~0.base) .cse31) (+ c_~A~0.offset .cse29)) (< ~a~0 0) (= .cse30 (select (select (store (store .cse32 c_~A~0.base v_ArrVal_740) .cse30 v_ArrVal_743) c_~B~0.base) .cse31)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse35 (select (select .cse36 c_~B~0.base) c_~B~0.offset))) (let ((.cse33 (select (select (store (store .cse36 c_~A~0.base v_ArrVal_740) .cse35 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse33 c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) (+ 5 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (= .cse35 .cse33) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse41 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse38 (select (select .cse41 c_~B~0.base) c_~B~0.offset)) (.cse39 (+ (* ~a~0 4) c_~B~0.offset)) (.cse40 (+ 5 (select (select .cse37 c_~B~0.base) c_~B~0.offset)))) (or (< (+ (select (select (store (store .cse37 c_~A~0.base v_ArrVal_739) .cse38 v_ArrVal_744) c_~B~0.base) .cse39) .cse34) .cse40) (< ~a~0 0) (= (select (select (store (store .cse41 c_~A~0.base v_ArrVal_740) .cse38 v_ArrVal_743) c_~B~0.base) .cse39) c_~A~0.base) (< (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) .cse34) .cse40) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse47 (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse43 (* ~a~0 c_~M~0)) (.cse42 (div (+ c_~A~0.offset (- .cse47)) (- 4)))) (or (< ~a~0 0) (< .cse42 .cse43) (<= (+ .cse43 c_~M~0) .cse42) (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse45 (select (select .cse46 c_~B~0.base) c_~B~0.offset))) (let ((.cse44 (select (select (store (store .cse46 c_~A~0.base v_ArrVal_740) .cse45 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse44 c_~A~0.base) (= .cse45 .cse44)))))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse47)) 4) 0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse49 (select (select .cse51 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse50 (+ (* ~a~0 4) c_~B~0.offset))) (or (let ((.cse48 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (+ (select (select (store (store .cse48 c_~A~0.base v_ArrVal_739) .cse49 v_ArrVal_744) c_~B~0.base) .cse50) .cse34) (+ 5 (select (select .cse48 c_~B~0.base) c_~B~0.offset)))) (< ~a~0 0) (= (select (select (store (store .cse51 c_~A~0.base v_ArrVal_740) .cse49 v_ArrVal_743) c_~B~0.base) .cse50) c_~A~0.base) (<= c_~N~0 ~a~0)))) (= .cse49 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse52 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse56 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse53 (select (select .cse56 c_~B~0.base) c_~B~0.offset)) (.cse54 (+ (* ~a~0 4) c_~B~0.offset)) (.cse55 (select (select .cse52 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse52 c_~A~0.base v_ArrVal_739) .cse53 v_ArrVal_744) c_~B~0.base) .cse54) .cse34) (+ 5 .cse55)) (< ~a~0 0) (= (select (select (store (store .cse56 c_~A~0.base v_ArrVal_740) .cse53 v_ArrVal_743) c_~B~0.base) .cse54) c_~A~0.base) (< (div (+ (- 1) .cse0 .cse55) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse57 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse58 (select (select .cse57 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse59 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse57 c_~A~0.base v_ArrVal_740) .cse58 v_ArrVal_743) c_~B~0.base) .cse59) c_~A~0.base) (let ((.cse60 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (< (select (select .cse60 c_~B~0.base) c_~B~0.offset) (+ (select (select (store (store .cse60 c_~A~0.base v_ArrVal_739) .cse58 v_ArrVal_744) c_~B~0.base) .cse59) 1))) (<= c_~N~0 ~a~0)))) (= .cse58 c_~A~0.base))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse61 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse62 (select (select .cse61 c_~B~0.base) c_~B~0.offset))) (or (< (+ (select (select (store (store .cse61 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) .cse34) (+ 5 .cse62)) (< ~a~0 0) (< (div (+ (- 1) .cse0 .cse62) 4) (* ~a~0 c_~M~0)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse65 (* ~a~0 c_~M~0))) (let ((.cse64 (* .cse65 4)) (.cse63 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (or (= (select (select (store (store .cse63 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset .cse64)) (< (+ .cse65 c_~M~0) 2) (< (+ c_~A~0.offset .cse64 .cse34) (+ 5 (select (select .cse63 c_~B~0.base) c_~B~0.offset))) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse70 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse69 (* (* ~a~0 c_~M~0) 4)) (.cse66 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737)) (.cse67 (select (select .cse70 c_~B~0.base) c_~B~0.offset)) (.cse68 (+ (* ~a~0 4) c_~B~0.offset))) (or (= (select (select (store (store .cse66 c_~A~0.base v_ArrVal_739) .cse67 v_ArrVal_744) c_~B~0.base) .cse68) (+ c_~A~0.offset .cse69)) (< ~a~0 0) (< (+ c_~A~0.offset .cse69 .cse34) (+ 5 (select (select .cse66 c_~B~0.base) c_~B~0.offset))) (= .cse67 (select (select (store (store .cse70 c_~A~0.base v_ArrVal_740) .cse67 v_ArrVal_743) c_~B~0.base) .cse68)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_743 (Array Int Int)) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse71 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736)) (.cse75 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse74 (select (select .cse75 c_~B~0.base) c_~B~0.offset)) (.cse72 (select (select .cse71 c_~B~0.base) c_~B~0.offset)) (.cse73 (+ (* ~a~0 4) c_~B~0.offset))) (or (< ~a~0 0) (= (select (select (store (store .cse71 c_~A~0.base v_ArrVal_740) .cse72 v_ArrVal_743) c_~B~0.base) .cse73) c_~A~0.base) (< (+ (* ~a~0 c_~M~0) c_~M~0) (+ 2 (div (+ .cse0 .cse74) 4))) (< .cse74 (+ (select (select (store (store .cse75 c_~A~0.base v_ArrVal_739) .cse72 v_ArrVal_744) c_~B~0.base) .cse73) 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse79 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse77 (* (* ~a~0 c_~M~0) 4)) (.cse76 (select (select .cse79 c_~B~0.base) c_~B~0.offset)) (.cse78 (select (select (store (store .cse79 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< .cse76 (+ c_~A~0.offset .cse77 1)) (= .cse78 (+ c_~A~0.offset .cse77)) (< ~a~0 0) (< .cse76 (+ .cse78 1)) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (let ((.cse82 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse81 (select (select .cse82 c_~B~0.base) c_~B~0.offset))) (let ((.cse80 (select (select (store (store .cse82 c_~A~0.base v_ArrVal_740) .cse81 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< (select (select (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~B~0.base) c_~B~0.offset) (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4) 1)) (< ~a~0 0) (= .cse80 c_~A~0.base) (= .cse81 .cse80) (<= c_~N~0 ~a~0)))))) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_736 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse86 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse83 (select (select (store (store .cse86 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse84 (* (* ~a~0 c_~M~0) 4)) (.cse85 (+ 5 (select (select .cse86 c_~B~0.base) c_~B~0.offset)))) (or (= .cse83 (+ c_~A~0.offset .cse84)) (< (+ .cse83 .cse34) .cse85) (< ~a~0 0) (< (+ c_~A~0.offset .cse84 .cse34) .cse85) (<= c_~N~0 ~a~0))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse87 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (= .cse87 c_~A~0.base) (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse89 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse88 (select (select (store (store .cse89 c_~A~0.base v_ArrVal_739) .cse87 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse88 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< ~a~0 0) (< (select (select .cse89 c_~B~0.base) c_~B~0.offset) (+ .cse88 1)) (<= c_~N~0 ~a~0)))))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse91 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_737 (Array Int Int))) (let ((.cse90 (* ~a~0 c_~M~0))) (or (< (+ .cse90 c_~M~0) 2) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (= (select (select (store (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737) c_~A~0.base v_ArrVal_739) .cse91 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) (+ c_~A~0.offset (* .cse90 4)))) (<= c_~N~0 ~a~0)))) (= .cse91 c_~A~0.base)))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse94 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse93 (select (select .cse94 c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_743 (Array Int Int)) (~a~0 Int) (v_ArrVal_740 (Array Int Int))) (let ((.cse92 (select (select (store (store .cse94 c_~A~0.base v_ArrVal_740) .cse93 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (< ~a~0 0) (= .cse92 c_~A~0.base) (= .cse93 .cse92) (<= c_~N~0 ~a~0)))) (= .cse93 c_~A~0.base))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_737 (Array Int Int))) (let ((.cse99 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse100 (select (select .cse99 c_~B~0.base) c_~B~0.offset))) (or (forall ((~a~0 Int) (v_ArrVal_736 (Array Int Int))) (let ((.cse95 (div (+ c_~A~0.offset (- .cse100)) (- 4))) (.cse96 (* ~a~0 c_~M~0))) (or (< ~a~0 0) (< .cse95 .cse96) (<= (+ .cse96 c_~M~0) .cse95) (forall ((v_ArrVal_744 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse97 (select (select (store (store .cse99 c_~A~0.base v_ArrVal_739) (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset) v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset))) (.cse98 (+ c_~A~0.offset (* .cse96 4)))) (or (= .cse97 .cse98) (= (+ .cse97 (* .cse95 4)) .cse98)))) (<= c_~N~0 ~a~0)))) (not (= (mod (+ c_~A~0.offset (* 3 .cse100)) 4) 0)))))) (forall ((v_ArrVal_735 (Array Int Int)) (v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse103 (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736) c_~B~0.base) c_~B~0.offset))) (or (forall ((v_ArrVal_744 (Array Int Int)) (~a~0 Int) (v_ArrVal_737 (Array Int Int)) (v_ArrVal_739 (Array Int Int))) (let ((.cse102 (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_735) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_737))) (let ((.cse101 (select (select (store (store .cse102 c_~A~0.base v_ArrVal_739) .cse103 v_ArrVal_744) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)))) (or (= .cse101 (+ c_~A~0.offset (* (* ~a~0 c_~M~0) 4))) (< (+ .cse101 .cse34) (+ 5 (select (select .cse102 c_~B~0.base) c_~B~0.offset))) (< ~a~0 0) (<= c_~N~0 ~a~0))))) (= .cse103 c_~A~0.base)))) (forall ((v_ArrVal_734 (Array Int Int)) (v_ArrVal_736 (Array Int Int))) (let ((.cse105 (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_734) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_736))) (let ((.cse104 (select (select .cse105 c_~B~0.base) c_~B~0.offset))) (or (= .cse104 c_~A~0.base) (forall ((~a~0 Int)) (or (forall ((v_ArrVal_743 (Array Int Int)) (v_ArrVal_740 (Array Int Int))) (= (select (select (store (store .cse105 c_~A~0.base v_ArrVal_740) .cse104 v_ArrVal_743) c_~B~0.base) (+ (* ~a~0 4) c_~B~0.offset)) c_~A~0.base)) (< (+ (* ~a~0 c_~M~0) c_~M~0) 2) (<= c_~N~0 ~a~0))))))))) (< (+ |c_ULTIMATE.start_main_#t~post12#1| 1) c_~N~0)) is different from false [2022-11-20 09:46:21,185 WARN L233 SmtUtils]: Spent 1.50m on a formula simplification that was a NOOP. DAG size: 182 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 09:46:23,125 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:46:23,126 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 63 treesize of output 64 [2022-11-20 09:46:23,143 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:46:23,143 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 156 treesize of output 108 [2022-11-20 09:46:23,176 INFO L350 Elim1Store]: Elim1 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 29198 treesize of output 28686 [2022-11-20 09:46:23,335 INFO L350 Elim1Store]: Elim1 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 28686 treesize of output 27150 [2022-11-20 09:46:23,503 INFO L350 Elim1Store]: Elim1 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 27150 treesize of output 24078 [2022-11-20 09:46:23,663 INFO L350 Elim1Store]: Elim1 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 24078 treesize of output 23694 [2022-11-20 09:46:23,808 INFO L350 Elim1Store]: Elim1 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 23694 treesize of output 22926 [2022-11-20 09:46:23,987 INFO L321 Elim1Store]: treesize reduction 10, result has 69.7 percent of original size [2022-11-20 09:46:23,988 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 71584 treesize of output 67526 [2022-11-20 09:46:24,578 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:46:24,579 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 67500 treesize of output 65410 [2022-11-20 09:46:24,902 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 09:46:24,904 INFO L350 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 65400 treesize of output 61210 [2022-11-20 09:46:25,211 INFO L350 Elim1Store]: Elim1 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 8950 treesize of output 7414 [2022-11-20 09:46:25,516 INFO L350 Elim1Store]: Elim1 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 7414 treesize of output 6646