./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.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_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/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_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/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_619b5ca5-5362-42d8-8613-f5e95307340d/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 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c --- 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 10:33:16,218 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-11-20 10:33:16,221 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-11-20 10:33:16,260 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-11-20 10:33:16,261 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-11-20 10:33:16,262 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-11-20 10:33:16,263 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-11-20 10:33:16,267 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-11-20 10:33:16,269 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-11-20 10:33:16,269 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-11-20 10:33:16,270 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-11-20 10:33:16,273 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-11-20 10:33:16,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-11-20 10:33:16,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-11-20 10:33:16,283 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-11-20 10:33:16,284 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-11-20 10:33:16,285 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-11-20 10:33:16,286 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-11-20 10:33:16,288 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-11-20 10:33:16,293 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-11-20 10:33:16,299 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-11-20 10:33:16,301 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-11-20 10:33:16,302 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-11-20 10:33:16,303 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-11-20 10:33:16,307 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-11-20 10:33:16,312 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-11-20 10:33:16,312 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-11-20 10:33:16,313 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-11-20 10:33:16,314 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-11-20 10:33:16,315 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-11-20 10:33:16,315 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-11-20 10:33:16,316 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-11-20 10:33:16,317 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-11-20 10:33:16,317 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-11-20 10:33:16,318 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-11-20 10:33:16,319 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-11-20 10:33:16,319 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-11-20 10:33:16,320 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-11-20 10:33:16,320 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-11-20 10:33:16,321 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-11-20 10:33:16,322 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-11-20 10:33:16,323 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-11-20 10:33:16,357 INFO L113 SettingsManager]: Loading preferences was successful [2022-11-20 10:33:16,362 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-11-20 10:33:16,362 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-11-20 10:33:16,363 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-11-20 10:33:16,364 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-11-20 10:33:16,364 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-11-20 10:33:16,366 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-11-20 10:33:16,366 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-11-20 10:33:16,366 INFO L138 SettingsManager]: * Use SBE=true [2022-11-20 10:33:16,367 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-11-20 10:33:16,368 INFO L138 SettingsManager]: * sizeof long=4 [2022-11-20 10:33:16,368 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-11-20 10:33:16,368 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-11-20 10:33:16,369 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-11-20 10:33:16,369 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-11-20 10:33:16,369 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-11-20 10:33:16,369 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-11-20 10:33:16,369 INFO L138 SettingsManager]: * sizeof long double=12 [2022-11-20 10:33:16,370 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-11-20 10:33:16,370 INFO L138 SettingsManager]: * Use constant arrays=true [2022-11-20 10:33:16,370 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-11-20 10:33:16,370 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-11-20 10:33:16,371 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-11-20 10:33:16,371 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-11-20 10:33:16,371 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:33:16,371 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-11-20 10:33:16,372 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-11-20 10:33:16,372 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-11-20 10:33:16,372 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-11-20 10:33:16,373 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-11-20 10:33:16,373 INFO L138 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2022-11-20 10:33:16,373 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-11-20 10:33:16,374 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-11-20 10:33:16,374 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_619b5ca5-5362-42d8-8613-f5e95307340d/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_619b5ca5-5362-42d8-8613-f5e95307340d/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 -> 251696ec6cec82b3ac56ff493f8f4412eaff7e5010650cc9da1e4c426de80d8c [2022-11-20 10:33:16,631 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-11-20 10:33:16,658 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-11-20 10:33:16,662 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-11-20 10:33:16,664 INFO L271 PluginConnector]: Initializing CDTParser... [2022-11-20 10:33:16,664 INFO L275 PluginConnector]: CDTParser initialized [2022-11-20 10:33:16,665 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/../../sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-20 10:33:19,733 INFO L500 CDTParser]: Created temporary CDT project at NULL [2022-11-20 10:33:19,924 INFO L351 CDTParser]: Found 1 translation units. [2022-11-20 10:33:19,925 INFO L172 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c [2022-11-20 10:33:19,933 INFO L394 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/data/cc1de7cb4/24d5483f97744fac9785f3f8c9b681d4/FLAG6e7f7de4f [2022-11-20 10:33:19,949 INFO L402 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/data/cc1de7cb4/24d5483f97744fac9785f3f8c9b681d4 [2022-11-20 10:33:19,952 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-11-20 10:33:19,953 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-11-20 10:33:19,955 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-11-20 10:33:19,955 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-11-20 10:33:19,959 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-11-20 10:33:19,960 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:33:19" (1/1) ... [2022-11-20 10:33:19,961 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@112b976b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:19, skipping insertion in model container [2022-11-20 10:33:19,961 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.11 10:33:19" (1/1) ... [2022-11-20 10:33:19,969 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-11-20 10:33:19,988 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-11-20 10:33:20,249 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_619b5ca5-5362-42d8-8613-f5e95307340d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-20 10:33:20,272 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:33:20,292 INFO L203 MainTranslator]: Completed pre-run [2022-11-20 10:33:20,349 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_619b5ca5-5362-42d8-8613-f5e95307340d/sv-benchmarks/c/weaver/popl20-more-max-array-hom.wvr.c[2586,2599] [2022-11-20 10:33:20,356 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-11-20 10:33:20,375 INFO L208 MainTranslator]: Completed translation [2022-11-20 10:33:20,376 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20 WrapperNode [2022-11-20 10:33:20,376 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-11-20 10:33:20,378 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-11-20 10:33:20,378 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-11-20 10:33:20,378 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-11-20 10:33:20,387 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,408 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,449 INFO L138 Inliner]: procedures = 24, calls = 43, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 102 [2022-11-20 10:33:20,449 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-11-20 10:33:20,450 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-11-20 10:33:20,450 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-11-20 10:33:20,451 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-11-20 10:33:20,462 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,463 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,481 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,485 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,492 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,505 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,507 INFO L185 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,516 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,518 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-11-20 10:33:20,519 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-11-20 10:33:20,519 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-11-20 10:33:20,520 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-11-20 10:33:20,520 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (1/1) ... [2022-11-20 10:33:20,532 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-11-20 10:33:20,548 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:20,568 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-11-20 10:33:20,598 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-11-20 10:33:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-11-20 10:33:20,615 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2022-11-20 10:33:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2022-11-20 10:33:20,616 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2022-11-20 10:33:20,616 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2022-11-20 10:33:20,617 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2022-11-20 10:33:20,617 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2022-11-20 10:33:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-11-20 10:33:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-11-20 10:33:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-11-20 10:33:20,618 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2022-11-20 10:33:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2022-11-20 10:33:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-11-20 10:33:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-11-20 10:33:20,619 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-11-20 10:33:20,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-11-20 10:33:20,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-11-20 10:33:20,622 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 10:33:20,782 INFO L235 CfgBuilder]: Building ICFG [2022-11-20 10:33:20,785 INFO L261 CfgBuilder]: Building CFG for each procedure with an implementation [2022-11-20 10:33:21,124 INFO L276 CfgBuilder]: Performing block encoding [2022-11-20 10:33:21,195 INFO L295 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-11-20 10:33:21,196 INFO L300 CfgBuilder]: Removed 4 assume(true) statements. [2022-11-20 10:33:21,198 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:33:21 BoogieIcfgContainer [2022-11-20 10:33:21,198 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-11-20 10:33:21,201 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-11-20 10:33:21,201 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-11-20 10:33:21,205 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-11-20 10:33:21,205 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.11 10:33:19" (1/3) ... [2022-11-20 10:33:21,206 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d3228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:33:21, skipping insertion in model container [2022-11-20 10:33:21,206 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.11 10:33:20" (2/3) ... [2022-11-20 10:33:21,207 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4a4d3228 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.11 10:33:21, skipping insertion in model container [2022-11-20 10:33:21,207 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.11 10:33:21" (3/3) ... [2022-11-20 10:33:21,209 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-max-array-hom.wvr.c [2022-11-20 10:33:21,218 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2022-11-20 10:33:21,229 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-11-20 10:33:21,230 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-11-20 10:33:21,230 INFO L515 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2022-11-20 10:33:21,315 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2022-11-20 10:33:21,358 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 152 places, 154 transitions, 332 flow [2022-11-20 10:33:21,505 INFO L130 PetriNetUnfolder]: 12/151 cut-off events. [2022-11-20 10:33:21,506 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:33:21,519 INFO L83 FinitePrefix]: Finished finitePrefix Result has 164 conditions, 151 events. 12/151 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 92 event pairs, 0 based on Foata normal form. 0/138 useless extension candidates. Maximal degree in co-relation 113. Up to 2 conditions per place. [2022-11-20 10:33:21,519 INFO L82 GeneralOperation]: Start removeDead. Operand has 152 places, 154 transitions, 332 flow [2022-11-20 10:33:21,524 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 138 places, 140 transitions, 298 flow [2022-11-20 10:33:21,540 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-11-20 10:33:21,549 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;@7712bba2, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2022-11-20 10:33:21,550 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2022-11-20 10:33:21,619 INFO L130 PetriNetUnfolder]: 12/139 cut-off events. [2022-11-20 10:33:21,619 INFO L131 PetriNetUnfolder]: For 3/3 co-relation queries the response was YES. [2022-11-20 10:33:21,619 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:21,620 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] [2022-11-20 10:33:21,621 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:21,626 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:21,627 INFO L85 PathProgramCache]: Analyzing trace with hash 405465620, now seen corresponding path program 1 times [2022-11-20 10:33:21,667 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:21,667 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1427611346] [2022-11-20 10:33:21,667 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:21,668 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:21,860 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:22,073 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 10:33:22,073 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:22,074 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1427611346] [2022-11-20 10:33:22,074 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1427611346] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:22,075 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:22,075 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-11-20 10:33:22,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1433862833] [2022-11-20 10:33:22,078 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:22,088 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-11-20 10:33:22,088 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:22,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-11-20 10:33:22,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-11-20 10:33:22,130 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 154 [2022-11-20 10:33:22,134 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 138 places, 140 transitions, 298 flow. Second operand has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 10:33:22,134 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:22,134 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 154 [2022-11-20 10:33:22,135 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:22,317 INFO L130 PetriNetUnfolder]: 41/265 cut-off events. [2022-11-20 10:33:22,318 INFO L131 PetriNetUnfolder]: For 49/50 co-relation queries the response was YES. [2022-11-20 10:33:22,325 INFO L83 FinitePrefix]: Finished finitePrefix Result has 356 conditions, 265 events. 41/265 cut-off events. For 49/50 co-relation queries the response was YES. Maximal size of possible extension queue 12. Compared 715 event pairs, 15 based on Foata normal form. 42/276 useless extension candidates. Maximal degree in co-relation 216. Up to 59 conditions per place. [2022-11-20 10:33:22,329 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 9 selfloop transitions, 0 changer transitions 4/132 dead transitions. [2022-11-20 10:33:22,329 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 132 transitions, 300 flow [2022-11-20 10:33:22,333 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-11-20 10:33:22,337 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2022-11-20 10:33:22,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 289 transitions. [2022-11-20 10:33:22,357 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.9383116883116883 [2022-11-20 10:33:22,357 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 289 transitions. [2022-11-20 10:33:22,358 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 289 transitions. [2022-11-20 10:33:22,363 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:22,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 289 transitions. [2022-11-20 10:33:22,371 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 144.5) internal successors, (289), 2 states have internal predecessors, (289), 0 states have call successors, (0), 0 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 10:33:22,379 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 10:33:22,379 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 154.0) internal successors, (462), 3 states have internal predecessors, (462), 0 states have call successors, (0), 0 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 10:33:22,381 INFO L175 Difference]: Start difference. First operand has 138 places, 140 transitions, 298 flow. Second operand 2 states and 289 transitions. [2022-11-20 10:33:22,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 132 transitions, 300 flow [2022-11-20 10:33:22,387 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 132 transitions, 288 flow, removed 0 selfloop flow, removed 6 redundant places. [2022-11-20 10:33:22,392 INFO L231 Difference]: Finished difference. Result has 133 places, 128 transitions, 262 flow [2022-11-20 10:33:22,395 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=270, PETRI_DIFFERENCE_MINUEND_PLACES=132, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=132, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=262, PETRI_PLACES=133, PETRI_TRANSITIONS=128} [2022-11-20 10:33:22,405 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, -5 predicate places. [2022-11-20 10:33:22,405 INFO L495 AbstractCegarLoop]: Abstraction has has 133 places, 128 transitions, 262 flow [2022-11-20 10:33:22,405 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 141.0) internal successors, (282), 2 states have internal predecessors, (282), 0 states have call successors, (0), 0 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 10:33:22,406 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:22,407 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] [2022-11-20 10:33:22,407 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-11-20 10:33:22,407 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:22,414 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:22,414 INFO L85 PathProgramCache]: Analyzing trace with hash 2142861004, now seen corresponding path program 1 times [2022-11-20 10:33:22,414 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:22,415 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1924325090] [2022-11-20 10:33:22,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:22,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:22,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:23,316 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 10:33:23,317 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:23,317 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1924325090] [2022-11-20 10:33:23,317 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1924325090] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:23,318 INFO L184 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-11-20 10:33:23,318 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-11-20 10:33:23,318 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [588559644] [2022-11-20 10:33:23,318 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:23,320 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-11-20 10:33:23,320 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:23,321 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-11-20 10:33:23,321 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=31, Unknown=0, NotChecked=0, Total=56 [2022-11-20 10:33:23,324 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 95 out of 154 [2022-11-20 10:33:23,326 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 133 places, 128 transitions, 262 flow. Second operand has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 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 10:33:23,326 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:23,326 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 95 of 154 [2022-11-20 10:33:23,326 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:23,760 INFO L130 PetriNetUnfolder]: 295/679 cut-off events. [2022-11-20 10:33:23,771 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-20 10:33:23,774 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1138 conditions, 679 events. 295/679 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 2975 event pairs, 167 based on Foata normal form. 1/511 useless extension candidates. Maximal degree in co-relation 1135. Up to 421 conditions per place. [2022-11-20 10:33:23,779 INFO L137 encePairwiseOnDemand]: 144/154 looper letters, 44 selfloop transitions, 6 changer transitions 4/136 dead transitions. [2022-11-20 10:33:23,780 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 136 places, 136 transitions, 386 flow [2022-11-20 10:33:23,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:33:23,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:33:23,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 815 transitions. [2022-11-20 10:33:23,787 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.661525974025974 [2022-11-20 10:33:23,787 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 815 transitions. [2022-11-20 10:33:23,787 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 815 transitions. [2022-11-20 10:33:23,788 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:23,788 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 815 transitions. [2022-11-20 10:33:23,791 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 101.875) internal successors, (815), 8 states have internal predecessors, (815), 0 states have call successors, (0), 0 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 10:33:23,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 10:33:23,798 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 10:33:23,798 INFO L175 Difference]: Start difference. First operand has 133 places, 128 transitions, 262 flow. Second operand 8 states and 815 transitions. [2022-11-20 10:33:23,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 136 places, 136 transitions, 386 flow [2022-11-20 10:33:23,803 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 136 places, 136 transitions, 386 flow, removed 0 selfloop flow, removed 0 redundant places. [2022-11-20 10:33:23,807 INFO L231 Difference]: Finished difference. Result has 140 places, 129 transitions, 290 flow [2022-11-20 10:33:23,808 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=262, PETRI_DIFFERENCE_MINUEND_PLACES=129, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=128, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=290, PETRI_PLACES=140, PETRI_TRANSITIONS=129} [2022-11-20 10:33:23,809 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-20 10:33:23,809 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 129 transitions, 290 flow [2022-11-20 10:33:23,810 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 99.5) internal successors, (796), 8 states have internal predecessors, (796), 0 states have call successors, (0), 0 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 10:33:23,811 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:23,811 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] [2022-11-20 10:33:23,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-11-20 10:33:23,812 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:23,815 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:23,815 INFO L85 PathProgramCache]: Analyzing trace with hash -1947980679, now seen corresponding path program 1 times [2022-11-20 10:33:23,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:23,816 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1753363259] [2022-11-20 10:33:23,816 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:23,818 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:23,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:24,143 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 10:33:24,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:24,144 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1753363259] [2022-11-20 10:33:24,144 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1753363259] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:24,145 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074838122] [2022-11-20 10:33:24,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:24,145 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:24,145 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:24,149 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:24,181 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-11-20 10:33:24,299 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:24,302 INFO L263 TraceCheckSpWp]: Trace formula consists of 272 conjuncts, 6 conjunts are in the unsatisfiable core [2022-11-20 10:33:24,311 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:24,548 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 10:33:24,548 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:24,794 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:33:24,795 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074838122] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:24,795 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:33:24,795 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [8, 7] total 14 [2022-11-20 10:33:24,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694962679] [2022-11-20 10:33:24,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:24,797 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-11-20 10:33:24,797 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:24,798 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-11-20 10:33:24,798 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=130, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:33:24,800 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 114 out of 154 [2022-11-20 10:33:24,801 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 129 transitions, 290 flow. Second operand has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 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 10:33:24,802 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:24,802 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 114 of 154 [2022-11-20 10:33:24,802 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:25,013 INFO L130 PetriNetUnfolder]: 175/511 cut-off events. [2022-11-20 10:33:25,013 INFO L131 PetriNetUnfolder]: For 26/26 co-relation queries the response was YES. [2022-11-20 10:33:25,016 INFO L83 FinitePrefix]: Finished finitePrefix Result has 835 conditions, 511 events. 175/511 cut-off events. For 26/26 co-relation queries the response was YES. Maximal size of possible extension queue 26. Compared 2090 event pairs, 45 based on Foata normal form. 0/426 useless extension candidates. Maximal degree in co-relation 827. Up to 137 conditions per place. [2022-11-20 10:33:25,019 INFO L137 encePairwiseOnDemand]: 146/154 looper letters, 33 selfloop transitions, 7 changer transitions 0/137 dead transitions. [2022-11-20 10:33:25,019 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 144 places, 137 transitions, 388 flow [2022-11-20 10:33:25,020 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-11-20 10:33:25,020 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2022-11-20 10:33:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 838 transitions. [2022-11-20 10:33:25,022 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7773654916512059 [2022-11-20 10:33:25,023 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 838 transitions. [2022-11-20 10:33:25,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 838 transitions. [2022-11-20 10:33:25,023 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:25,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 838 transitions. [2022-11-20 10:33:25,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 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 10:33:25,028 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 10:33:25,029 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 154.0) internal successors, (1232), 8 states have internal predecessors, (1232), 0 states have call successors, (0), 0 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 10:33:25,030 INFO L175 Difference]: Start difference. First operand has 140 places, 129 transitions, 290 flow. Second operand 7 states and 838 transitions. [2022-11-20 10:33:25,030 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 144 places, 137 transitions, 388 flow [2022-11-20 10:33:25,032 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 137 places, 137 transitions, 370 flow, removed 3 selfloop flow, removed 7 redundant places. [2022-11-20 10:33:25,034 INFO L231 Difference]: Finished difference. Result has 140 places, 131 transitions, 305 flow [2022-11-20 10:33:25,035 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=272, PETRI_DIFFERENCE_MINUEND_PLACES=131, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=129, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=122, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=305, PETRI_PLACES=140, PETRI_TRANSITIONS=131} [2022-11-20 10:33:25,036 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 2 predicate places. [2022-11-20 10:33:25,036 INFO L495 AbstractCegarLoop]: Abstraction has has 140 places, 131 transitions, 305 flow [2022-11-20 10:33:25,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.42857142857143) internal successors, (822), 7 states have internal predecessors, (822), 0 states have call successors, (0), 0 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 10:33:25,037 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:25,037 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] [2022-11-20 10:33:25,049 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:25,243 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:25,244 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:25,251 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:25,251 INFO L85 PathProgramCache]: Analyzing trace with hash 1971120592, now seen corresponding path program 1 times [2022-11-20 10:33:25,251 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:25,251 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [496053992] [2022-11-20 10:33:25,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:25,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:25,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:25,585 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:33:25,585 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:25,585 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [496053992] [2022-11-20 10:33:25,586 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [496053992] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:25,586 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [249546424] [2022-11-20 10:33:25,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:25,587 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:25,587 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:25,591 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:25,626 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-11-20 10:33:25,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:25,721 INFO L263 TraceCheckSpWp]: Trace formula consists of 279 conjuncts, 8 conjunts are in the unsatisfiable core [2022-11-20 10:33:25,725 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:25,909 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:33:25,913 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:26,201 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 10:33:26,203 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [249546424] provided 1 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:26,203 INFO L184 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2022-11-20 10:33:26,203 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [10, 9] total 18 [2022-11-20 10:33:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901412629] [2022-11-20 10:33:26,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:26,206 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-11-20 10:33:26,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:26,214 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-11-20 10:33:26,216 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=64, Invalid=242, Unknown=0, NotChecked=0, Total=306 [2022-11-20 10:33:26,218 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 107 out of 154 [2022-11-20 10:33:26,220 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 140 places, 131 transitions, 305 flow. Second operand has 9 states, 9 states have (on average 110.33333333333333) internal successors, (993), 9 states have internal predecessors, (993), 0 states have call successors, (0), 0 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 10:33:26,220 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:26,220 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 107 of 154 [2022-11-20 10:33:26,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:26,813 INFO L130 PetriNetUnfolder]: 600/1204 cut-off events. [2022-11-20 10:33:26,813 INFO L131 PetriNetUnfolder]: For 404/584 co-relation queries the response was YES. [2022-11-20 10:33:26,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2461 conditions, 1204 events. 600/1204 cut-off events. For 404/584 co-relation queries the response was YES. Maximal size of possible extension queue 74. Compared 6302 event pairs, 103 based on Foata normal form. 180/1238 useless extension candidates. Maximal degree in co-relation 2453. Up to 249 conditions per place. [2022-11-20 10:33:26,827 INFO L137 encePairwiseOnDemand]: 142/154 looper letters, 74 selfloop transitions, 19 changer transitions 0/183 dead transitions. [2022-11-20 10:33:26,828 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 183 transitions, 644 flow [2022-11-20 10:33:26,828 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-11-20 10:33:26,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2022-11-20 10:33:26,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1264 transitions. [2022-11-20 10:33:26,833 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7461629279811098 [2022-11-20 10:33:26,833 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1264 transitions. [2022-11-20 10:33:26,833 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1264 transitions. [2022-11-20 10:33:26,834 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:26,835 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1264 transitions. [2022-11-20 10:33:26,840 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 114.9090909090909) internal successors, (1264), 11 states have internal predecessors, (1264), 0 states have call successors, (0), 0 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 10:33:26,845 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 10:33:26,849 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 154.0) internal successors, (1848), 12 states have internal predecessors, (1848), 0 states have call successors, (0), 0 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 10:33:26,849 INFO L175 Difference]: Start difference. First operand has 140 places, 131 transitions, 305 flow. Second operand 11 states and 1264 transitions. [2022-11-20 10:33:26,849 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 183 transitions, 644 flow [2022-11-20 10:33:26,853 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 146 places, 183 transitions, 631 flow, removed 0 selfloop flow, removed 4 redundant places. [2022-11-20 10:33:26,860 INFO L231 Difference]: Finished difference. Result has 152 places, 143 transitions, 404 flow [2022-11-20 10:33:26,861 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=136, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=131, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=404, PETRI_PLACES=152, PETRI_TRANSITIONS=143} [2022-11-20 10:33:26,863 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 14 predicate places. [2022-11-20 10:33:26,863 INFO L495 AbstractCegarLoop]: Abstraction has has 152 places, 143 transitions, 404 flow [2022-11-20 10:33:26,864 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 110.33333333333333) internal successors, (993), 9 states have internal predecessors, (993), 0 states have call successors, (0), 0 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 10:33:26,864 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:26,864 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] [2022-11-20 10:33:26,881 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2022-11-20 10:33:27,071 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:27,072 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:27,072 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:27,073 INFO L85 PathProgramCache]: Analyzing trace with hash 797684560, now seen corresponding path program 2 times [2022-11-20 10:33:27,073 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:27,073 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105853157] [2022-11-20 10:33:27,073 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:27,074 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:27,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:27,385 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:33:27,385 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105853157] [2022-11-20 10:33:27,386 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105853157] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:27,386 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [901982385] [2022-11-20 10:33:27,387 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:33:27,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:27,387 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:27,388 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:27,414 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-11-20 10:33:27,523 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-11-20 10:33:27,523 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:33:27,525 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 7 conjunts are in the unsatisfiable core [2022-11-20 10:33:27,528 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:27,893 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-11-20 10:33:27,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-11-20 10:33:27,894 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [901982385] provided 1 perfect and 0 imperfect interpolant sequences [2022-11-20 10:33:27,894 INFO L184 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-11-20 10:33:27,895 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [10] total 14 [2022-11-20 10:33:27,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1327192361] [2022-11-20 10:33:27,895 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-11-20 10:33:27,896 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-11-20 10:33:27,896 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:27,897 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-11-20 10:33:27,897 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=32, Invalid=150, Unknown=0, NotChecked=0, Total=182 [2022-11-20 10:33:27,898 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 102 out of 154 [2022-11-20 10:33:27,899 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 152 places, 143 transitions, 404 flow. Second operand has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 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 10:33:27,900 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:27,900 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 102 of 154 [2022-11-20 10:33:27,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:28,304 INFO L130 PetriNetUnfolder]: 412/876 cut-off events. [2022-11-20 10:33:28,304 INFO L131 PetriNetUnfolder]: For 824/929 co-relation queries the response was YES. [2022-11-20 10:33:28,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2204 conditions, 876 events. 412/876 cut-off events. For 824/929 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3967 event pairs, 118 based on Foata normal form. 131/985 useless extension candidates. Maximal degree in co-relation 2190. Up to 334 conditions per place. [2022-11-20 10:33:28,314 INFO L137 encePairwiseOnDemand]: 145/154 looper letters, 42 selfloop transitions, 11 changer transitions 0/145 dead transitions. [2022-11-20 10:33:28,315 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 157 places, 145 transitions, 503 flow [2022-11-20 10:33:28,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-11-20 10:33:28,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2022-11-20 10:33:28,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 865 transitions. [2022-11-20 10:33:28,318 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.7021103896103896 [2022-11-20 10:33:28,318 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 865 transitions. [2022-11-20 10:33:28,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 865 transitions. [2022-11-20 10:33:28,319 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:28,319 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 865 transitions. [2022-11-20 10:33:28,321 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 108.125) internal successors, (865), 8 states have internal predecessors, (865), 0 states have call successors, (0), 0 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 10:33:28,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 10:33:28,325 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 154.0) internal successors, (1386), 9 states have internal predecessors, (1386), 0 states have call successors, (0), 0 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 10:33:28,325 INFO L175 Difference]: Start difference. First operand has 152 places, 143 transitions, 404 flow. Second operand 8 states and 865 transitions. [2022-11-20 10:33:28,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 157 places, 145 transitions, 503 flow [2022-11-20 10:33:28,330 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 151 places, 145 transitions, 490 flow, removed 3 selfloop flow, removed 6 redundant places. [2022-11-20 10:33:28,332 INFO L231 Difference]: Finished difference. Result has 151 places, 137 transitions, 381 flow [2022-11-20 10:33:28,333 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=359, PETRI_DIFFERENCE_MINUEND_PLACES=144, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=126, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=381, PETRI_PLACES=151, PETRI_TRANSITIONS=137} [2022-11-20 10:33:28,334 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 13 predicate places. [2022-11-20 10:33:28,334 INFO L495 AbstractCegarLoop]: Abstraction has has 151 places, 137 transitions, 381 flow [2022-11-20 10:33:28,335 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 107.5) internal successors, (645), 6 states have internal predecessors, (645), 0 states have call successors, (0), 0 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 10:33:28,335 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:28,335 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] [2022-11-20 10:33:28,343 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2022-11-20 10:33:28,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:28,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:28,541 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:28,541 INFO L85 PathProgramCache]: Analyzing trace with hash -1636578117, now seen corresponding path program 1 times [2022-11-20 10:33:28,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:28,541 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1196619695] [2022-11-20 10:33:28,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:28,542 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:28,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:30,443 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:33:30,444 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1196619695] [2022-11-20 10:33:30,444 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1196619695] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:30,444 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [438909624] [2022-11-20 10:33:30,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:30,445 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:30,445 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:30,446 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:30,449 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-11-20 10:33:30,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:30,585 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 33 conjunts are in the unsatisfiable core [2022-11-20 10:33:30,590 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:32,157 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:32,158 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 69 treesize of output 43 [2022-11-20 10:33:33,391 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:33:33,391 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:33:34,865 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:33:34,866 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 161 treesize of output 161 [2022-11-20 10:33:44,403 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:33:44,403 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [438909624] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:33:44,404 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:33:44,404 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 19] total 49 [2022-11-20 10:33:44,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499941335] [2022-11-20 10:33:44,405 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:33:44,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2022-11-20 10:33:44,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:33:44,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2022-11-20 10:33:44,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=342, Invalid=2010, Unknown=0, NotChecked=0, Total=2352 [2022-11-20 10:33:44,414 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 66 out of 154 [2022-11-20 10:33:44,419 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 151 places, 137 transitions, 381 flow. Second operand has 49 states, 49 states have (on average 69.81632653061224) internal successors, (3421), 49 states have internal predecessors, (3421), 0 states have call successors, (0), 0 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 10:33:44,419 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:33:44,419 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 66 of 154 [2022-11-20 10:33:44,419 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:33:54,571 INFO L130 PetriNetUnfolder]: 4969/8469 cut-off events. [2022-11-20 10:33:54,572 INFO L131 PetriNetUnfolder]: For 7142/7142 co-relation queries the response was YES. [2022-11-20 10:33:54,596 INFO L83 FinitePrefix]: Finished finitePrefix Result has 21531 conditions, 8469 events. 4969/8469 cut-off events. For 7142/7142 co-relation queries the response was YES. Maximal size of possible extension queue 524. Compared 60764 event pairs, 990 based on Foata normal form. 2/8417 useless extension candidates. Maximal degree in co-relation 21519. Up to 3137 conditions per place. [2022-11-20 10:33:54,646 INFO L137 encePairwiseOnDemand]: 116/154 looper letters, 403 selfloop transitions, 171 changer transitions 18/645 dead transitions. [2022-11-20 10:33:54,647 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 214 places, 645 transitions, 3326 flow [2022-11-20 10:33:54,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2022-11-20 10:33:54,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2022-11-20 10:33:54,659 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 4788 transitions. [2022-11-20 10:33:54,662 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.48579545454545453 [2022-11-20 10:33:54,663 INFO L72 ComplementDD]: Start complementDD. Operand 64 states and 4788 transitions. [2022-11-20 10:33:54,663 INFO L73 IsDeterministic]: Start isDeterministic. Operand 64 states and 4788 transitions. [2022-11-20 10:33:54,667 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:33:54,667 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 64 states and 4788 transitions. [2022-11-20 10:33:54,681 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 65 states, 64 states have (on average 74.8125) internal successors, (4788), 64 states have internal predecessors, (4788), 0 states have call successors, (0), 0 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 10:33:54,801 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 65 states, 65 states have (on average 154.0) internal successors, (10010), 65 states have internal predecessors, (10010), 0 states have call successors, (0), 0 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 10:33:54,805 INFO L81 ComplementDD]: Finished complementDD. Result has 65 states, 65 states have (on average 154.0) internal successors, (10010), 65 states have internal predecessors, (10010), 0 states have call successors, (0), 0 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 10:33:54,805 INFO L175 Difference]: Start difference. First operand has 151 places, 137 transitions, 381 flow. Second operand 64 states and 4788 transitions. [2022-11-20 10:33:54,805 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 214 places, 645 transitions, 3326 flow [2022-11-20 10:33:54,863 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 645 transitions, 3274 flow, removed 0 selfloop flow, removed 5 redundant places. [2022-11-20 10:33:54,873 INFO L231 Difference]: Finished difference. Result has 246 places, 301 transitions, 1592 flow [2022-11-20 10:33:54,874 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=368, PETRI_DIFFERENCE_MINUEND_PLACES=146, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=137, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=98, PETRI_DIFFERENCE_SUBTRAHEND_STATES=64, PETRI_FLOW=1592, PETRI_PLACES=246, PETRI_TRANSITIONS=301} [2022-11-20 10:33:54,875 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 108 predicate places. [2022-11-20 10:33:54,875 INFO L495 AbstractCegarLoop]: Abstraction has has 246 places, 301 transitions, 1592 flow [2022-11-20 10:33:54,877 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 49 states have (on average 69.81632653061224) internal successors, (3421), 49 states have internal predecessors, (3421), 0 states have call successors, (0), 0 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 10:33:54,878 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:33:54,878 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] [2022-11-20 10:33:54,894 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-11-20 10:33:55,085 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:55,085 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:33:55,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:33:55,086 INFO L85 PathProgramCache]: Analyzing trace with hash 1813782651, now seen corresponding path program 2 times [2022-11-20 10:33:55,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:33:55,087 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1068418963] [2022-11-20 10:33:55,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:33:55,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:33:55,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:33:57,826 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:33:57,827 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:33:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1068418963] [2022-11-20 10:33:57,827 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1068418963] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:33:57,827 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [830501550] [2022-11-20 10:33:57,827 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-11-20 10:33:57,828 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:33:57,828 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:33:57,830 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:33:57,864 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2022-11-20 10:33:58,084 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:33:58,085 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:33:58,088 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 52 conjunts are in the unsatisfiable core [2022-11-20 10:33:58,093 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:33:59,102 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 11 treesize of output 7 [2022-11-20 10:33:59,690 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 10:33:59,877 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 10:34:00,235 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 10:34:01,265 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:01,266 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 63 treesize of output 43 [2022-11-20 10:34:02,023 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:34:02,023 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:34:12,897 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse5 (< c_~max2~0 c_~max3~0))) (and (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse1 (select .cse0 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max1~0 (select .cse0 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< 0 ~M~0) (<= .cse1 c_~max2~0) (< ~M~0 0) (= c_~max1~0 .cse1) (not (< c_~max3~0 .cse1)))))) (or .cse2 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse4 (select .cse3 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< c_~max1~0 (select .cse3 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max3~0 .cse4)) (< c_~max2~0 .cse4)))))) (or .cse5 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse7 (select .cse6 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (< c_~max3~0 (select .cse6 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< 0 ~M~0) (= .cse7 c_~max2~0) (< ~M~0 0) (not (< c_~max1~0 .cse7))))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse10 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse8 (select .cse10 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (.cse9 (select .cse10 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4))))) (or (< 0 ~M~0) (= .cse8 c_~max2~0) (< ~M~0 0) (not (< c_~max1~0 .cse8)) (not (< c_~max3~0 .cse9)) (< c_~max2~0 .cse9))))) (or (and (or .cse2 .cse5) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (or (< c_~max1~0 (select .cse11 |c_ULTIMATE.start_main_#t~ret12#1.offset|)) (< c_~max3~0 (select .cse11 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< 0 ~M~0) (< ~M~0 0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_main_#t~ret12#1.base|))) (let ((.cse12 (select .cse13 |c_ULTIMATE.start_main_#t~ret12#1.offset|))) (or (= .cse12 c_~max3~0) (< c_~max3~0 (select .cse13 (+ |c_ULTIMATE.start_main_#t~ret12#1.offset| (* ~M~0 4)))) (< 0 ~M~0) (< ~M~0 0) (not (< c_~max1~0 .cse12)))))))) is different from false [2022-11-20 10:34:13,267 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse5 (= c_~max1~0 c_~max2~0)) (.cse2 (< c_~max2~0 c_~max3~0))) (and (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse0 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (= .cse0 c_~max2~0) (< c_~max3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse0)) (< 0 ~M~0) (< ~M~0 0))))) .cse2) (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max2~0 .cse3) (< c_~max1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (not (< c_~max3~0 .cse3)) (< 0 ~M~0) (< ~M~0 0))))) .cse5) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse7 (select .cse6 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (< c_~max1~0 (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (= c_~max1~0 .cse7) (not (< c_~max3~0 .cse7)) (< 0 ~M~0) (< ~M~0 0) (<= .cse7 c_~max2~0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse9 (select .cse8 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (or (< c_~max3~0 (select .cse8 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (not (< c_~max1~0 .cse9)) (< 0 ~M~0) (= .cse9 c_~max3~0) (< ~M~0 0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (let ((.cse10 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (.cse11 (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)))) (or (= .cse10 c_~max2~0) (< c_~max2~0 .cse11) (not (< c_~max1~0 .cse10)) (not (< c_~max3~0 .cse11)) (< 0 ~M~0) (< ~M~0 0))))) (or (and (or .cse5 .cse2) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse13 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_#res#1.base|))) (or (< c_~max1~0 (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|)) (< c_~max3~0 (select .cse13 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_#res#1.offset|))) (< 0 ~M~0) (< ~M~0 0))))))) is different from false [2022-11-20 10:34:13,469 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse0 (< c_~max2~0 c_~max3~0)) (.cse8 (= c_~max1~0 c_~max2~0))) (and (or .cse0 (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse1 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse2 (select .cse1 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse1 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (not (< c_~max1~0 .cse2)) (< 0 ~M~0) (< ~M~0 0) (= .cse2 c_~max2~0)))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse3 (select .cse4 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse3)) (< 0 ~M~0) (< ~M~0 0) (<= .cse3 c_~max2~0) (< c_~max1~0 (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (= .cse3 c_~max1~0))))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse7 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse6 (select .cse7 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (select .cse7 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse5)) (not (< c_~max1~0 .cse6)) (< 0 ~M~0) (< ~M~0 0) (= .cse6 c_~max2~0) (< c_~max2~0 .cse5))))) (or (and (or .cse8 .cse0) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse9 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (or (< c_~max3~0 (select .cse9 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))))) (or (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (~M~0 Int) (v_ArrVal_192 (Array Int Int))) (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse10 (select .cse11 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (not (< c_~max3~0 .cse10)) (< 0 ~M~0) (< ~M~0 0) (< c_~max1~0 (select .cse11 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (< c_~max2~0 .cse10))))) .cse8) (forall ((v_ArrVal_191 (Array Int Int)) (v_ArrVal_193 (Array Int Int)) (v_ArrVal_192 (Array Int Int)) (~M~0 Int)) (let ((.cse12 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_191) |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_192) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_193) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|))) (let ((.cse13 (select .cse12 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< c_~max3~0 (select .cse12 (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= .cse13 c_~max3~0) (not (< c_~max1~0 .cse13)) (< 0 ~M~0) (< ~M~0 0))))))) is different from false [2022-11-20 10:34:14,453 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:14,453 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 61 treesize of output 49 [2022-11-20 10:34:14,469 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:34:14,470 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 255 treesize of output 247 [2022-11-20 10:34:14,491 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:34:14,491 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 243 treesize of output 231 [2022-11-20 10:34:14,512 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:34:14,513 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 227 treesize of output 199 [2022-11-20 10:34:14,536 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:34:14,536 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 101 treesize of output 97 [2022-11-20 10:34:14,710 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:34:14,710 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 126 treesize of output 1 [2022-11-20 10:34:14,720 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:34:14,720 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 94 treesize of output 1 [2022-11-20 10:34:14,731 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:34:14,732 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 123 treesize of output 1 [2022-11-20 10:34:14,743 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:34:14,744 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 90 treesize of output 1 [2022-11-20 10:34:14,753 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:34:14,754 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 90 treesize of output 1 [2022-11-20 10:34:15,216 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2022-11-20 10:34:15,217 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [830501550] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:34:15,217 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:34:15,217 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 29, 23] total 68 [2022-11-20 10:34:15,218 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [988600397] [2022-11-20 10:34:15,218 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:34:15,219 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2022-11-20 10:34:15,220 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:34:15,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2022-11-20 10:34:15,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=701, Invalid=3441, Unknown=30, NotChecked=384, Total=4556 [2022-11-20 10:34:15,227 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 55 out of 154 [2022-11-20 10:34:15,232 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 246 places, 301 transitions, 1592 flow. Second operand has 68 states, 68 states have (on average 58.044117647058826) internal successors, (3947), 68 states have internal predecessors, (3947), 0 states have call successors, (0), 0 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 10:34:15,232 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:34:15,232 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 55 of 154 [2022-11-20 10:34:15,233 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:34:41,550 INFO L130 PetriNetUnfolder]: 11477/19093 cut-off events. [2022-11-20 10:34:41,554 INFO L131 PetriNetUnfolder]: For 95226/95725 co-relation queries the response was YES. [2022-11-20 10:34:41,713 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74884 conditions, 19093 events. 11477/19093 cut-off events. For 95226/95725 co-relation queries the response was YES. Maximal size of possible extension queue 1129. Compared 148871 event pairs, 2013 based on Foata normal form. 23/18963 useless extension candidates. Maximal degree in co-relation 74835. Up to 5993 conditions per place. [2022-11-20 10:34:41,856 INFO L137 encePairwiseOnDemand]: 112/154 looper letters, 625 selfloop transitions, 625 changer transitions 6/1304 dead transitions. [2022-11-20 10:34:41,856 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 338 places, 1304 transitions, 10723 flow [2022-11-20 10:34:41,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2022-11-20 10:34:41,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2022-11-20 10:34:41,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 6144 transitions. [2022-11-20 10:34:41,878 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.41130004016601956 [2022-11-20 10:34:41,879 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 6144 transitions. [2022-11-20 10:34:41,879 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 6144 transitions. [2022-11-20 10:34:41,884 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:34:41,884 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 6144 transitions. [2022-11-20 10:34:41,903 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 63.34020618556701) internal successors, (6144), 97 states have internal predecessors, (6144), 0 states have call successors, (0), 0 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 10:34:41,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 154.0) internal successors, (15092), 98 states have internal predecessors, (15092), 0 states have call successors, (0), 0 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 10:34:41,941 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 154.0) internal successors, (15092), 98 states have internal predecessors, (15092), 0 states have call successors, (0), 0 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 10:34:41,941 INFO L175 Difference]: Start difference. First operand has 246 places, 301 transitions, 1592 flow. Second operand 97 states and 6144 transitions. [2022-11-20 10:34:41,942 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 338 places, 1304 transitions, 10723 flow [2022-11-20 10:34:42,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 322 places, 1304 transitions, 10616 flow, removed 38 selfloop flow, removed 16 redundant places. [2022-11-20 10:34:42,994 INFO L231 Difference]: Finished difference. Result has 369 places, 870 transitions, 7931 flow [2022-11-20 10:34:42,994 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=1518, PETRI_DIFFERENCE_MINUEND_PLACES=226, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=301, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=128, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=141, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=7931, PETRI_PLACES=369, PETRI_TRANSITIONS=870} [2022-11-20 10:34:42,995 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 231 predicate places. [2022-11-20 10:34:42,995 INFO L495 AbstractCegarLoop]: Abstraction has has 369 places, 870 transitions, 7931 flow [2022-11-20 10:34:42,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 68 states have (on average 58.044117647058826) internal successors, (3947), 68 states have internal predecessors, (3947), 0 states have call successors, (0), 0 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 10:34:42,997 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:34:42,997 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] [2022-11-20 10:34:43,005 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2022-11-20 10:34:43,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:43,205 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:34:43,205 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:34:43,205 INFO L85 PathProgramCache]: Analyzing trace with hash 843917477, now seen corresponding path program 3 times [2022-11-20 10:34:43,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:34:43,206 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1448070903] [2022-11-20 10:34:43,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:34:43,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:34:43,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:34:46,409 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:34:46,410 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:34:46,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1448070903] [2022-11-20 10:34:46,410 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1448070903] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:34:46,410 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [950346540] [2022-11-20 10:34:46,411 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2022-11-20 10:34:46,411 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:34:46,411 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:34:46,412 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:34:46,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2022-11-20 10:34:46,529 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2022-11-20 10:34:46,529 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:34:46,531 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 44 conjunts are in the unsatisfiable core [2022-11-20 10:34:46,536 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:34:47,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:47,963 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 35 treesize of output 33 [2022-11-20 10:34:48,312 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:34:48,315 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 35 treesize of output 33 [2022-11-20 10:34:48,821 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:48,821 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 63 treesize of output 43 [2022-11-20 10:34:49,581 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:34:49,582 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:34:54,989 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:34:54,990 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 743 treesize of output 719 [2022-11-20 10:34:55,014 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 624 treesize of output 588 [2022-11-20 10:34:55,035 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 588 treesize of output 570 [2022-11-20 10:34:55,054 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 570 treesize of output 546 [2022-11-20 10:34:55,093 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 546 treesize of output 534 [2022-11-20 10:34:55,110 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 534 treesize of output 510 [2022-11-20 10:34:55,128 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 510 treesize of output 462 [2022-11-20 10:35:07,773 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-11-20 10:35:07,774 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [950346540] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:35:07,774 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:35:07,774 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [32, 26, 25] total 71 [2022-11-20 10:35:07,774 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [877315198] [2022-11-20 10:35:07,774 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:35:07,775 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 71 states [2022-11-20 10:35:07,775 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:35:07,776 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 71 interpolants. [2022-11-20 10:35:07,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=614, Invalid=4352, Unknown=4, NotChecked=0, Total=4970 [2022-11-20 10:35:07,788 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 56 out of 154 [2022-11-20 10:35:07,793 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 369 places, 870 transitions, 7931 flow. Second operand has 71 states, 71 states have (on average 58.87323943661972) internal successors, (4180), 71 states have internal predecessors, (4180), 0 states have call successors, (0), 0 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 10:35:07,793 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:35:07,793 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 56 of 154 [2022-11-20 10:35:07,793 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:35:27,597 INFO L130 PetriNetUnfolder]: 13110/21829 cut-off events. [2022-11-20 10:35:27,598 INFO L131 PetriNetUnfolder]: For 228161/229062 co-relation queries the response was YES. [2022-11-20 10:35:27,810 INFO L83 FinitePrefix]: Finished finitePrefix Result has 113427 conditions, 21829 events. 13110/21829 cut-off events. For 228161/229062 co-relation queries the response was YES. Maximal size of possible extension queue 1256. Compared 175256 event pairs, 986 based on Foata normal form. 29/21734 useless extension candidates. Maximal degree in co-relation 113335. Up to 9684 conditions per place. [2022-11-20 10:35:27,969 INFO L137 encePairwiseOnDemand]: 118/154 looper letters, 670 selfloop transitions, 796 changer transitions 19/1535 dead transitions. [2022-11-20 10:35:27,969 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 428 places, 1535 transitions, 17542 flow [2022-11-20 10:35:27,971 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 62 states. [2022-11-20 10:35:27,971 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 62 states. [2022-11-20 10:35:27,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 62 states to 62 states and 3968 transitions. [2022-11-20 10:35:27,993 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.4155844155844156 [2022-11-20 10:35:27,995 INFO L72 ComplementDD]: Start complementDD. Operand 62 states and 3968 transitions. [2022-11-20 10:35:27,995 INFO L73 IsDeterministic]: Start isDeterministic. Operand 62 states and 3968 transitions. [2022-11-20 10:35:27,997 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:35:27,999 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 62 states and 3968 transitions. [2022-11-20 10:35:28,016 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 63 states, 62 states have (on average 64.0) internal successors, (3968), 62 states have internal predecessors, (3968), 0 states have call successors, (0), 0 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 10:35:28,035 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 63 states, 63 states have (on average 154.0) internal successors, (9702), 63 states have internal predecessors, (9702), 0 states have call successors, (0), 0 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 10:35:28,039 INFO L81 ComplementDD]: Finished complementDD. Result has 63 states, 63 states have (on average 154.0) internal successors, (9702), 63 states have internal predecessors, (9702), 0 states have call successors, (0), 0 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 10:35:28,039 INFO L175 Difference]: Start difference. First operand has 369 places, 870 transitions, 7931 flow. Second operand 62 states and 3968 transitions. [2022-11-20 10:35:28,040 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 428 places, 1535 transitions, 17542 flow [2022-11-20 10:35:31,752 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 412 places, 1535 transitions, 16117 flow, removed 662 selfloop flow, removed 16 redundant places. [2022-11-20 10:35:31,773 INFO L231 Difference]: Finished difference. Result has 439 places, 1189 transitions, 12559 flow [2022-11-20 10:35:31,774 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=6984, PETRI_DIFFERENCE_MINUEND_PLACES=351, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=870, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=499, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=362, PETRI_DIFFERENCE_SUBTRAHEND_STATES=62, PETRI_FLOW=12559, PETRI_PLACES=439, PETRI_TRANSITIONS=1189} [2022-11-20 10:35:31,775 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 301 predicate places. [2022-11-20 10:35:31,775 INFO L495 AbstractCegarLoop]: Abstraction has has 439 places, 1189 transitions, 12559 flow [2022-11-20 10:35:31,777 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 71 states, 71 states have (on average 58.87323943661972) internal successors, (4180), 71 states have internal predecessors, (4180), 0 states have call successors, (0), 0 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 10:35:31,778 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:35:31,778 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] [2022-11-20 10:35:31,790 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2022-11-20 10:35:31,984 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:35:31,985 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:35:31,985 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:35:31,985 INFO L85 PathProgramCache]: Analyzing trace with hash -1021617069, now seen corresponding path program 4 times [2022-11-20 10:35:31,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:35:31,986 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [399334941] [2022-11-20 10:35:31,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:35:31,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:35:32,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:35:34,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:34,771 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:35:34,771 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [399334941] [2022-11-20 10:35:34,772 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [399334941] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:35:34,772 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [395471706] [2022-11-20 10:35:34,772 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2022-11-20 10:35:34,772 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:35:34,772 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:35:34,775 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:35:34,781 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2022-11-20 10:35:34,921 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2022-11-20 10:35:34,921 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:35:34,924 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 56 conjunts are in the unsatisfiable core [2022-11-20 10:35:34,928 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:35:36,150 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 15 treesize of output 11 [2022-11-20 10:35:37,463 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 10:35:38,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:38,069 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 35 treesize of output 33 [2022-11-20 10:35:38,439 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-11-20 10:35:38,441 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 35 treesize of output 33 [2022-11-20 10:35:39,358 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:35:39,361 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:35:39,362 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 63 treesize of output 36 [2022-11-20 10:35:39,505 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:35:39,505 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:35:40,773 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse2 (= c_~max1~0 c_~max2~0)) (.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or (forall ((v_ArrVal_264 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0)))) .cse2) (or (and (or .cse2 (< c_~max2~0 c_~max3~0)) (or (= c_~max1~0 c_~max3~0) (<= c_~max3~0 c_~max2~0))) (forall ((v_ArrVal_264 (Array Int Int))) (< c_~max3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse1)))) (forall ((v_ArrVal_264 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse1))) (or (not (< c_~max3~0 .cse3)) (<= .cse3 c_~max2~0) (= c_~max1~0 .cse3)))))) is different from false [2022-11-20 10:35:42,889 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse10 (= c_~max1~0 c_~max2~0)) (.cse15 (< c_~max2~0 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse1)) (< c_~max2~0 .cse1)))) (= .cse0 c_~max2~0))))) (or .cse4 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse5 c_~max3~0)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse7 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= .cse7 .cse8) (not (< c_~max3~0 .cse8)) (<= .cse8 c_~max2~0)))))))) (or .cse10 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse11)) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 .cse11)))))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse13 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse13 c_~max2~0))))) .cse15) (or (and (or .cse10 .cse15) (or (= c_~max1~0 c_~max3~0) .cse4)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max3~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse18) (not (< c_~max3~0 .cse18)) (<= .cse18 c_~max2~0))))))))) is different from false [2022-11-20 10:35:43,564 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse10 (= c_~max1~0 c_~max2~0)) (.cse15 (< c_~max2~0 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse1)) (< c_~max2~0 .cse1)))) (= .cse0 c_~max2~0))))) (or .cse4 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse5 c_~max3~0)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse7 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= .cse7 .cse8) (not (< c_~max3~0 .cse8)) (<= .cse8 c_~max2~0)))))))) (or .cse10 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse11)) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 .cse11)))))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse13 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse13 c_~max2~0))))) .cse15) (or (and (or .cse10 .cse15) (or (= c_~max1~0 c_~max3~0) .cse4)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max3~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse18) (not (< c_~max3~0 .cse18)) (<= .cse18 c_~max2~0))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_~cond#1| 0)) is different from false [2022-11-20 10:35:43,762 WARN L837 $PredicateComparison]: unable to prove that (or (let ((.cse10 (= c_~max1~0 c_~max2~0)) (.cse15 (< c_~max2~0 c_~max3~0)) (.cse4 (<= c_~max3~0 c_~max2~0)) (.cse3 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse0 (select (select .cse2 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse0)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse2 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse1)) (< c_~max2~0 .cse1)))) (= .cse0 c_~max2~0))))) (or .cse4 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse5 (select (select .cse6 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse5)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse5 c_~max3~0)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse7 (select (select .cse9 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse7)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse8 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= .cse7 .cse8) (not (< c_~max3~0 .cse8)) (<= .cse8 c_~max2~0)))))))) (or .cse10 (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse12 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse11 (select (select (store (store .cse12 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (not (< c_~max3~0 .cse11)) (< c_~max1~0 (select (select .cse12 c_~A~0.base) c_~A~0.offset)) (< c_~max2~0 .cse11)))))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse13 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse13)) (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (= .cse13 c_~max2~0))))) .cse15) (or (and (or .cse10 .cse15) (or (= c_~max1~0 c_~max3~0) .cse4)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse16 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max3~0 (select (select (store (store .cse16 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3)) (< c_~max1~0 (select (select .cse16 c_~A~0.base) c_~A~0.offset)))))) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse18 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) .cse3))) (or (= c_~max1~0 .cse18) (not (< c_~max3~0 .cse18)) (<= .cse18 c_~max2~0))))))))) (= |c_ULTIMATE.start_assume_abort_if_not_#in~cond#1| 0)) is different from false [2022-11-20 10:35:44,264 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse16 (< c_~max2~0 c_~max3~0)) (.cse6 (<= c_~max3~0 c_~max2~0))) (and (forall ((~M~0 Int)) (or (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse2 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse0 (select (select (store (store .cse1 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse0)) (< c_~max2~0 .cse0)))) (not (< c_~max1~0 .cse2)) (= .cse2 c_~max2~0))))) (< ~M~0 0) (<= c_~N~0 ~M~0))) (forall ((~M~0 Int)) (or (< ~M~0 0) (<= c_~N~0 ~M~0) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse5 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse3 (select (select .cse5 c_~A~0.base) c_~A~0.offset))) (or (not (< c_~max1~0 .cse3)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse4 (select (select (store (store .cse5 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (= .cse3 .cse4) (not (< c_~max3~0 .cse4)) (<= .cse4 c_~max2~0)))))))))) (or .cse6 (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse8)) (< ~M~0 0) (<= c_~N~0 ~M~0) (= .cse8 c_~max3~0)))))) (forall ((~M~0 Int)) (or (< ~M~0 0) (<= c_~N~0 ~M~0) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse9 (select (select (store (store .cse10 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse9)) (<= .cse9 c_~max2~0) (= c_~max1~0 .cse9)))) (< c_~max1~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset))))))) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4))))) (or (not (< c_~max3~0 .cse12)) (< c_~max1~0 (select (select .cse13 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (<= c_~N~0 ~M~0) (< c_~max2~0 .cse12)))))) (or (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse15 (select (select .cse14 c_~A~0.base) c_~A~0.offset))) (or (< c_~max3~0 (select (select (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (not (< c_~max1~0 .cse15)) (< ~M~0 0) (<= c_~N~0 ~M~0) (= .cse15 c_~max2~0))))) .cse16) (or (and (or .cse11 .cse16) (or (= c_~max1~0 c_~max3~0) .cse6)) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) c_~A~0.base) (+ c_~A~0.offset (* ~M~0 4)))) (< c_~max1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)) (< ~M~0 0) (<= c_~N~0 ~M~0))))))) is different from false [2022-11-20 10:36:20,082 WARN L233 SmtUtils]: Spent 34.66s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:36:51,736 WARN L233 SmtUtils]: Spent 30.45s on a formula simplification that was a NOOP. DAG size: 75 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:36:51,946 WARN L837 $PredicateComparison]: unable to prove that (let ((.cse11 (= c_~max1~0 c_~max2~0)) (.cse7 (< c_~max2~0 c_~max3~0)) (.cse10 (<= c_~max3~0 c_~max2~0))) (and (forall ((~M~0 Int)) (or (< ~M~0 0) (<= c_~N~0 ~M~0) (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< c_~max1~0 (select (select .cse0 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse1 (select (select (store (store .cse0 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse1 c_~max2~0) (= c_~max1~0 .cse1) (not (< c_~max3~0 .cse1)))))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (not (< c_~max1~0 .cse2)) (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse3 (select (select (store (store .cse4 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (<= .cse3 c_~max2~0) (= .cse3 .cse2) (not (< c_~max3~0 .cse3))))))))) (< ~M~0 0) (<= c_~N~0 ~M~0))) (or (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse5 (select (select .cse6 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< ~M~0 0) (<= c_~N~0 ~M~0) (not (< c_~max1~0 .cse5)) (< c_~max3~0 (select (select (store (store .cse6 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max2~0 .cse5))))) .cse7) (or (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse9 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse8 (select (select .cse9 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (< ~M~0 0) (<= c_~N~0 ~M~0) (not (< c_~max1~0 .cse8)) (< c_~max3~0 (select (select (store (store .cse9 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (= c_~max3~0 .cse8))))) .cse10) (or .cse11 (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse13 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse12 (select (select (store (store .cse13 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< ~M~0 0) (< c_~max2~0 .cse12) (< c_~max1~0 (select (select .cse13 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= c_~N~0 ~M~0) (not (< c_~max3~0 .cse12))))))) (forall ((~M~0 Int)) (or (forall ((v_ArrVal_262 (Array Int Int))) (let ((.cse15 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (let ((.cse16 (select (select .cse15 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))) (or (forall ((v_ArrVal_263 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse14 (select (select (store (store .cse15 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)))) (or (< c_~max2~0 .cse14) (not (< c_~max3~0 .cse14))))) (not (< c_~max1~0 .cse16)) (= c_~max2~0 .cse16))))) (< ~M~0 0) (<= c_~N~0 ~M~0))) (or (and (or .cse11 .cse7) (or (= c_~max1~0 c_~max3~0) .cse10)) (forall ((~M~0 Int) (v_ArrVal_263 (Array Int Int)) (v_ArrVal_262 (Array Int Int)) (v_ArrVal_264 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_262))) (or (< ~M~0 0) (< c_~max1~0 (select (select .cse17 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (<= c_~N~0 ~M~0) (< c_~max3~0 (select (select (store (store .cse17 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_263) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_264) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base|) (+ (* ~M~0 4) |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|))))))))) is different from false [2022-11-20 10:37:04,953 WARN L233 SmtUtils]: Spent 12.39s on a formula simplification that was a NOOP. DAG size: 79 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:18,427 WARN L233 SmtUtils]: Spent 12.54s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:56,105 WARN L233 SmtUtils]: Spent 36.32s on a formula simplification that was a NOOP. DAG size: 81 (called from [L 361] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2022-11-20 10:37:56,411 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:56,412 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 140 treesize of output 92 [2022-11-20 10:37:56,432 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:56,433 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 1337 treesize of output 1215 [2022-11-20 10:37:56,456 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 1185 treesize of output 1089 [2022-11-20 10:37:56,485 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 1089 treesize of output 897 [2022-11-20 10:37:56,519 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:56,519 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 917 treesize of output 845 [2022-11-20 10:37:58,920 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:58,920 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 120 treesize of output 84 [2022-11-20 10:37:58,927 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,928 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:58,940 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:58,940 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 112 treesize of output 88 [2022-11-20 10:37:58,959 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:58,959 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 60 treesize of output 44 [2022-11-20 10:37:59,060 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:59,060 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 78 treesize of output 54 [2022-11-20 10:37:59,066 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,067 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,078 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,078 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 75 treesize of output 63 [2022-11-20 10:37:59,093 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,093 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 43 treesize of output 37 [2022-11-20 10:37:59,153 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:59,153 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 111 treesize of output 75 [2022-11-20 10:37:59,167 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,168 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,183 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,184 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 107 treesize of output 87 [2022-11-20 10:37:59,205 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,206 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 67 treesize of output 55 [2022-11-20 10:37:59,297 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:37:59,297 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 55 treesize of output 43 [2022-11-20 10:37:59,307 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,308 INFO L173 IndexEqualityManager]: detected equality via solver [2022-11-20 10:37:59,327 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,327 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 51 treesize of output 43 [2022-11-20 10:37:59,353 INFO L321 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2022-11-20 10:37:59,354 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 23 treesize of output 19 [2022-11-20 10:37:59,398 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:37:59,398 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 88 treesize of output 1 [2022-11-20 10:37:59,417 INFO L321 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-11-20 10:37:59,418 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 78 treesize of output 1 [2022-11-20 10:38:01,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:01,553 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [395471706] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:38:01,554 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:38:01,554 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [30, 31, 30] total 78 [2022-11-20 10:38:01,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [193304843] [2022-11-20 10:38:01,554 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:38:01,555 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 78 states [2022-11-20 10:38:01,555 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:38:01,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 78 interpolants. [2022-11-20 10:38:01,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=539, Invalid=4565, Unknown=32, NotChecked=870, Total=6006 [2022-11-20 10:38:01,562 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 52 out of 154 [2022-11-20 10:38:01,565 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 439 places, 1189 transitions, 12559 flow. Second operand has 78 states, 78 states have (on average 54.666666666666664) internal successors, (4264), 78 states have internal predecessors, (4264), 0 states have call successors, (0), 0 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 10:38:01,565 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:38:01,566 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 52 of 154 [2022-11-20 10:38:01,566 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:38:32,028 INFO L130 PetriNetUnfolder]: 21022/34959 cut-off events. [2022-11-20 10:38:32,028 INFO L131 PetriNetUnfolder]: For 475786/476909 co-relation queries the response was YES. [2022-11-20 10:38:32,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 201956 conditions, 34959 events. 21022/34959 cut-off events. For 475786/476909 co-relation queries the response was YES. Maximal size of possible extension queue 1793. Compared 299369 event pairs, 2052 based on Foata normal form. 25/34749 useless extension candidates. Maximal degree in co-relation 201839. Up to 12311 conditions per place. [2022-11-20 10:38:32,776 INFO L137 encePairwiseOnDemand]: 111/154 looper letters, 944 selfloop transitions, 1585 changer transitions 13/2587 dead transitions. [2022-11-20 10:38:32,776 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 504 places, 2587 transitions, 35340 flow [2022-11-20 10:38:32,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 71 states. [2022-11-20 10:38:32,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2022-11-20 10:38:32,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 4272 transitions. [2022-11-20 10:38:32,918 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.39070788366563014 [2022-11-20 10:38:32,918 INFO L72 ComplementDD]: Start complementDD. Operand 71 states and 4272 transitions. [2022-11-20 10:38:32,918 INFO L73 IsDeterministic]: Start isDeterministic. Operand 71 states and 4272 transitions. [2022-11-20 10:38:32,920 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:38:32,920 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 71 states and 4272 transitions. [2022-11-20 10:38:32,927 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 72 states, 71 states have (on average 60.16901408450704) internal successors, (4272), 71 states have internal predecessors, (4272), 0 states have call successors, (0), 0 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 10:38:32,944 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 72 states, 72 states have (on average 154.0) internal successors, (11088), 72 states have internal predecessors, (11088), 0 states have call successors, (0), 0 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 10:38:32,946 INFO L81 ComplementDD]: Finished complementDD. Result has 72 states, 72 states have (on average 154.0) internal successors, (11088), 72 states have internal predecessors, (11088), 0 states have call successors, (0), 0 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 10:38:32,947 INFO L175 Difference]: Start difference. First operand has 439 places, 1189 transitions, 12559 flow. Second operand 71 states and 4272 transitions. [2022-11-20 10:38:32,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 504 places, 2587 transitions, 35340 flow [2022-11-20 10:38:52,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 480 places, 2587 transitions, 32759 flow, removed 1208 selfloop flow, removed 24 redundant places. [2022-11-20 10:38:52,331 INFO L231 Difference]: Finished difference. Result has 506 places, 2092 transitions, 28265 flow [2022-11-20 10:38:52,332 INFO L271 CegarLoopForPetriNet]: {PETRI_ALPHABET=154, PETRI_DIFFERENCE_MINUEND_FLOW=11777, PETRI_DIFFERENCE_MINUEND_PLACES=410, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=1189, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=739, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=369, PETRI_DIFFERENCE_SUBTRAHEND_STATES=71, PETRI_FLOW=28265, PETRI_PLACES=506, PETRI_TRANSITIONS=2092} [2022-11-20 10:38:52,332 INFO L288 CegarLoopForPetriNet]: 138 programPoint places, 368 predicate places. [2022-11-20 10:38:52,332 INFO L495 AbstractCegarLoop]: Abstraction has has 506 places, 2092 transitions, 28265 flow [2022-11-20 10:38:52,333 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 78 states, 78 states have (on average 54.666666666666664) internal successors, (4264), 78 states have internal predecessors, (4264), 0 states have call successors, (0), 0 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 10:38:52,334 INFO L201 CegarLoopForPetriNet]: Found error trace [2022-11-20 10:38:52,334 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] [2022-11-20 10:38:52,339 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2022-11-20 10:38:52,539 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:52,539 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 1 more)] === [2022-11-20 10:38:52,539 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-11-20 10:38:52,540 INFO L85 PathProgramCache]: Analyzing trace with hash -453116137, now seen corresponding path program 5 times [2022-11-20 10:38:52,540 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-11-20 10:38:52,540 INFO L333 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1352421175] [2022-11-20 10:38:52,540 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-11-20 10:38:52,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-11-20 10:38:52,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-11-20 10:38:54,437 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:54,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-11-20 10:38:54,437 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1352421175] [2022-11-20 10:38:54,438 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1352421175] provided 0 perfect and 1 imperfect interpolant sequences [2022-11-20 10:38:54,438 INFO L333 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [732340793] [2022-11-20 10:38:54,438 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2022-11-20 10:38:54,438 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-11-20 10:38:54,438 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 [2022-11-20 10:38:54,439 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-11-20 10:38:54,445 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_619b5ca5-5362-42d8-8613-f5e95307340d/bin/uautomizer-ug76WZFUDN/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2022-11-20 10:38:54,560 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2022-11-20 10:38:54,560 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-11-20 10:38:54,562 INFO L263 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 41 conjunts are in the unsatisfiable core [2022-11-20 10:38:54,565 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-11-20 10:38:56,448 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:56,449 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 63 treesize of output 43 [2022-11-20 10:38:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:38:57,098 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-11-20 10:38:58,362 INFO L321 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2022-11-20 10:38:58,362 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 127 treesize of output 75 [2022-11-20 10:39:00,428 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-11-20 10:39:00,428 INFO L157 FreeRefinementEngine]: IpTcStrategyModuleZ3 [732340793] provided 0 perfect and 2 imperfect interpolant sequences [2022-11-20 10:39:00,428 INFO L184 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-11-20 10:39:00,429 INFO L197 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 26, 21] total 54 [2022-11-20 10:39:00,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [117432081] [2022-11-20 10:39:00,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-11-20 10:39:00,430 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2022-11-20 10:39:00,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-11-20 10:39:00,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2022-11-20 10:39:00,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=479, Invalid=2383, Unknown=0, NotChecked=0, Total=2862 [2022-11-20 10:39:00,435 INFO L478 CegarLoopForPetriNet]: Number of universal loopers: 72 out of 154 [2022-11-20 10:39:00,437 INFO L100 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 506 places, 2092 transitions, 28265 flow. Second operand has 54 states, 54 states have (on average 74.87037037037037) internal successors, (4043), 54 states have internal predecessors, (4043), 0 states have call successors, (0), 0 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 10:39:00,437 INFO L109 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2022-11-20 10:39:00,437 INFO L110 encePairwiseOnDemand]: Number of universal subtrahend loopers: 72 of 154 [2022-11-20 10:39:00,437 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2022-11-20 10:39:25,383 INFO L130 PetriNetUnfolder]: 21189/37365 cut-off events. [2022-11-20 10:39:25,383 INFO L131 PetriNetUnfolder]: For 458440/462841 co-relation queries the response was YES. [2022-11-20 10:39:25,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 215389 conditions, 37365 events. 21189/37365 cut-off events. For 458440/462841 co-relation queries the response was YES. Maximal size of possible extension queue 2150. Compared 347618 event pairs, 1997 based on Foata normal form. 972/37145 useless extension candidates. Maximal degree in co-relation 215252. Up to 13094 conditions per place. [2022-11-20 10:39:26,198 INFO L137 encePairwiseOnDemand]: 119/154 looper letters, 845 selfloop transitions, 1548 changer transitions 12/2585 dead transitions. [2022-11-20 10:39:26,198 INFO L142 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 550 places, 2585 transitions, 38185 flow [2022-11-20 10:39:26,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 49 states. [2022-11-20 10:39:26,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2022-11-20 10:39:26,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 3889 transitions. [2022-11-20 10:39:26,204 INFO L523 CegarLoopForPetriNet]: DFA transition density 0.5153723827193215 [2022-11-20 10:39:26,205 INFO L72 ComplementDD]: Start complementDD. Operand 49 states and 3889 transitions. [2022-11-20 10:39:26,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 49 states and 3889 transitions. [2022-11-20 10:39:26,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2022-11-20 10:39:26,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 49 states and 3889 transitions. [2022-11-20 10:39:26,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 50 states, 49 states have (on average 79.36734693877551) internal successors, (3889), 49 states have internal predecessors, (3889), 0 states have call successors, (0), 0 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 10:39:26,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 50 states, 50 states have (on average 154.0) internal successors, (7700), 50 states have internal predecessors, (7700), 0 states have call successors, (0), 0 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 10:39:26,223 INFO L81 ComplementDD]: Finished complementDD. Result has 50 states, 50 states have (on average 154.0) internal successors, (7700), 50 states have internal predecessors, (7700), 0 states have call successors, (0), 0 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 10:39:26,223 INFO L175 Difference]: Start difference. First operand has 506 places, 2092 transitions, 28265 flow. Second operand 49 states and 3889 transitions. [2022-11-20 10:39:26,223 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 550 places, 2585 transitions, 38185 flow