./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP --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 23bd321b64eb98f17ff91aefc669d9f5b78966b876ea50803bd27f8c9b624679 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 21:54:31,225 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 21:54:31,325 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 21:54:31,334 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 21:54:31,334 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 21:54:31,375 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 21:54:31,375 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 21:54:31,376 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 21:54:31,377 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 21:54:31,378 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 21:54:31,379 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 21:54:31,380 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 21:54:31,381 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 21:54:31,386 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 21:54:31,387 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 21:54:31,387 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 21:54:31,389 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 21:54:31,390 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 21:54:31,390 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 21:54:31,390 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 21:54:31,391 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 21:54:31,392 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 21:54:31,392 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 21:54:31,392 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 21:54:31,393 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 21:54:31,394 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 21:54:31,394 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 21:54:31,395 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 21:54:31,395 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:31,396 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 21:54:31,397 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 21:54:31,397 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 21:54:31,397 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 21:54:31,398 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 21:54:31,398 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 21:54:31,398 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 21:54:31,398 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 21:54:31,399 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 21:54:31,399 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 21:54:31,399 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/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_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP 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 -> 23bd321b64eb98f17ff91aefc669d9f5b78966b876ea50803bd27f8c9b624679 [2023-11-06 21:54:31,722 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 21:54:31,751 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 21:54:31,754 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 21:54:31,755 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 21:54:31,757 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 21:54:31,758 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2023-11-06 21:54:34,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 21:54:35,169 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 21:54:35,169 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/sv-benchmarks/c/weaver/array-eq-trans.wvr.c [2023-11-06 21:54:35,178 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/data/c8dffb91e/c8f14197927a45a297523ec631e7e6ad/FLAG98503a6b7 [2023-11-06 21:54:35,194 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/data/c8dffb91e/c8f14197927a45a297523ec631e7e6ad [2023-11-06 21:54:35,197 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 21:54:35,199 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 21:54:35,200 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:35,200 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 21:54:35,210 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 21:54:35,213 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,214 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@9f6b122 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35, skipping insertion in model container [2023-11-06 21:54:35,215 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,250 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 21:54:35,513 WARN L240 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_e1f5b61a-e366-4f3b-9b24-6d4405971b25/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2737,2750] [2023-11-06 21:54:35,526 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:35,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 21:54:35,562 WARN L240 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_e1f5b61a-e366-4f3b-9b24-6d4405971b25/sv-benchmarks/c/weaver/array-eq-trans.wvr.c[2737,2750] [2023-11-06 21:54:35,566 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 21:54:35,581 INFO L206 MainTranslator]: Completed translation [2023-11-06 21:54:35,582 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35 WrapperNode [2023-11-06 21:54:35,582 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 21:54:35,583 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:35,583 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 21:54:35,583 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 21:54:35,591 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,613 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,646 INFO L138 Inliner]: procedures = 24, calls = 46, calls flagged for inlining = 10, calls inlined = 14, statements flattened = 212 [2023-11-06 21:54:35,647 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 21:54:35,648 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 21:54:35,648 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 21:54:35,648 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 21:54:35,658 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,663 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,664 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,676 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,681 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,684 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,687 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,691 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 21:54:35,692 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 21:54:35,693 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 21:54:35,693 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 21:54:35,694 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (1/1) ... [2023-11-06 21:54:35,701 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 21:54:35,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:35,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 21:54:35,758 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 21:54:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 21:54:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 21:54:35,790 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 21:54:35,790 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 21:54:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 21:54:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 21:54:35,791 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 21:54:35,791 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 21:54:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 21:54:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 21:54:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 21:54:35,792 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 21:54:35,792 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 21:54:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 21:54:35,793 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 21:54:35,795 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 21:54:35,918 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 21:54:35,920 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 21:54:36,444 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 21:54:36,458 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 21:54:36,458 INFO L302 CfgBuilder]: Removed 6 assume(true) statements. [2023-11-06 21:54:36,461 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:36 BoogieIcfgContainer [2023-11-06 21:54:36,461 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 21:54:36,464 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 21:54:36,464 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 21:54:36,468 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 21:54:36,468 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 09:54:35" (1/3) ... [2023-11-06 21:54:36,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39337384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:36, skipping insertion in model container [2023-11-06 21:54:36,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 09:54:35" (2/3) ... [2023-11-06 21:54:36,469 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39337384 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 09:54:36, skipping insertion in model container [2023-11-06 21:54:36,469 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 09:54:36" (3/3) ... [2023-11-06 21:54:36,471 INFO L112 eAbstractionObserver]: Analyzing ICFG array-eq-trans.wvr.c [2023-11-06 21:54:36,479 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 21:54:36,488 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 21:54:36,488 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 21:54:36,488 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 21:54:36,580 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-06 21:54:36,630 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 291 places, 311 transitions, 643 flow [2023-11-06 21:54:36,796 INFO L124 PetriNetUnfolderBase]: 30/308 cut-off events. [2023-11-06 21:54:36,796 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:54:36,803 INFO L83 FinitePrefix]: Finished finitePrefix Result has 321 conditions, 308 events. 30/308 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 247 event pairs, 0 based on Foata normal form. 0/277 useless extension candidates. Maximal degree in co-relation 206. Up to 3 conditions per place. [2023-11-06 21:54:36,804 INFO L82 GeneralOperation]: Start removeDead. Operand has 291 places, 311 transitions, 643 flow [2023-11-06 21:54:36,812 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 277 places, 297 transitions, 612 flow [2023-11-06 21:54:36,816 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 21:54:36,826 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 277 places, 297 transitions, 612 flow [2023-11-06 21:54:36,828 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 277 places, 297 transitions, 612 flow [2023-11-06 21:54:36,829 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 277 places, 297 transitions, 612 flow [2023-11-06 21:54:36,906 INFO L124 PetriNetUnfolderBase]: 30/297 cut-off events. [2023-11-06 21:54:36,906 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:54:36,908 INFO L83 FinitePrefix]: Finished finitePrefix Result has 310 conditions, 297 events. 30/297 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 245 event pairs, 0 based on Foata normal form. 0/267 useless extension candidates. Maximal degree in co-relation 206. Up to 3 conditions per place. [2023-11-06 21:54:36,912 INFO L119 LiptonReduction]: Number of co-enabled transitions 2688 [2023-11-06 21:54:51,664 INFO L134 LiptonReduction]: Checked pairs total: 3915 [2023-11-06 21:54:51,664 INFO L136 LiptonReduction]: Total number of compositions: 350 [2023-11-06 21:54:51,681 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 21:54:51,686 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;@22a3f3d3, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 21:54:51,686 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-06 21:54:51,693 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 21:54:51,693 INFO L124 PetriNetUnfolderBase]: 8/28 cut-off events. [2023-11-06 21:54:51,693 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-06 21:54:51,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:51,694 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:51,695 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)] === [2023-11-06 21:54:51,700 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:51,700 INFO L85 PathProgramCache]: Analyzing trace with hash 1034034704, now seen corresponding path program 1 times [2023-11-06 21:54:51,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:51,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [212994286] [2023-11-06 21:54:51,717 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:51,717 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:52,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:53,163 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:53,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:53,164 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [212994286] [2023-11-06 21:54:53,165 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [212994286] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:54:53,165 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:54:53,165 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:54:53,167 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [481615245] [2023-11-06 21:54:53,167 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:54:53,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 21:54:53,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:54:53,211 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 21:54:53,211 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 21:54:53,672 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 263 out of 661 [2023-11-06 21:54:53,678 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 29 transitions, 76 flow. Second operand has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:53,679 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:54:53,679 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 263 of 661 [2023-11-06 21:54:53,680 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:54:53,991 INFO L124 PetriNetUnfolderBase]: 394/596 cut-off events. [2023-11-06 21:54:53,991 INFO L125 PetriNetUnfolderBase]: For 27/27 co-relation queries the response was YES. [2023-11-06 21:54:53,994 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1286 conditions, 596 events. 394/596 cut-off events. For 27/27 co-relation queries the response was YES. Maximal size of possible extension queue 33. Compared 1795 event pairs, 215 based on Foata normal form. 2/417 useless extension candidates. Maximal degree in co-relation 484. Up to 289 conditions per place. [2023-11-06 21:54:53,998 INFO L140 encePairwiseOnDemand]: 652/661 looper letters, 28 selfloop transitions, 2 changer transitions 41/71 dead transitions. [2023-11-06 21:54:53,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 36 places, 71 transitions, 338 flow [2023-11-06 21:54:53,999 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:54:54,002 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:54:54,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1655 transitions. [2023-11-06 21:54:54,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4172970247100353 [2023-11-06 21:54:54,024 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1655 transitions. [2023-11-06 21:54:54,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1655 transitions. [2023-11-06 21:54:54,029 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:54:54,032 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1655 transitions. [2023-11-06 21:54:54,042 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 275.8333333333333) internal successors, (1655), 6 states have internal predecessors, (1655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:54,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:54,063 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:54,065 INFO L175 Difference]: Start difference. First operand has 31 places, 29 transitions, 76 flow. Second operand 6 states and 1655 transitions. [2023-11-06 21:54:54,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 36 places, 71 transitions, 338 flow [2023-11-06 21:54:54,075 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 71 transitions, 302 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 21:54:54,078 INFO L231 Difference]: Finished difference. Result has 34 places, 30 transitions, 94 flow [2023-11-06 21:54:54,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=64, PETRI_DIFFERENCE_MINUEND_PLACES=25, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=29, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=94, PETRI_PLACES=34, PETRI_TRANSITIONS=30} [2023-11-06 21:54:54,084 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 3 predicate places. [2023-11-06 21:54:54,084 INFO L495 AbstractCegarLoop]: Abstraction has has 34 places, 30 transitions, 94 flow [2023-11-06 21:54:54,086 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 266.1666666666667) internal successors, (1597), 6 states have internal predecessors, (1597), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:54:54,086 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:54:54,086 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:54:54,087 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 21:54:54,087 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)] === [2023-11-06 21:54:54,088 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:54:54,088 INFO L85 PathProgramCache]: Analyzing trace with hash 766372749, now seen corresponding path program 1 times [2023-11-06 21:54:54,088 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:54:54,089 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [579083608] [2023-11-06 21:54:54,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:54,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:54:54,128 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,344 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:54,344 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:54:54,344 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [579083608] [2023-11-06 21:54:54,345 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [579083608] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:54:54,345 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [163040055] [2023-11-06 21:54:54,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:54:54,345 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:54:54,346 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:54:54,351 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:54:54,363 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 21:54:54,505 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:54:54,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:54:54,517 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:54:54,752 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:54:54,753 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:54:55,213 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:55,214 INFO L351 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 115 treesize of output 170 [2023-11-06 21:54:55,556 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:54:55,556 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 314 [2023-11-06 21:55:17,140 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:55:17,140 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [163040055] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:17,140 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:17,141 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4, 3] total 10 [2023-11-06 21:55:17,141 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [277812149] [2023-11-06 21:55:17,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:17,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:17,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:17,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:17,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2023-11-06 21:55:17,299 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 661 [2023-11-06 21:55:17,301 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 34 places, 30 transitions, 94 flow. Second operand has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:17,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:55:17,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 661 [2023-11-06 21:55:17,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:55:17,548 INFO L124 PetriNetUnfolderBase]: 400/578 cut-off events. [2023-11-06 21:55:17,548 INFO L125 PetriNetUnfolderBase]: For 243/243 co-relation queries the response was YES. [2023-11-06 21:55:17,551 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1400 conditions, 578 events. 400/578 cut-off events. For 243/243 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 1698 event pairs, 93 based on Foata normal form. 1/461 useless extension candidates. Maximal degree in co-relation 1386. Up to 268 conditions per place. [2023-11-06 21:55:17,555 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 44 selfloop transitions, 4 changer transitions 17/65 dead transitions. [2023-11-06 21:55:17,556 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 65 transitions, 320 flow [2023-11-06 21:55:17,557 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:17,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:55:17,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1351 transitions. [2023-11-06 21:55:17,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4087745839636914 [2023-11-06 21:55:17,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1351 transitions. [2023-11-06 21:55:17,570 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1351 transitions. [2023-11-06 21:55:17,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:55:17,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1351 transitions. [2023-11-06 21:55:17,576 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:17,584 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 661.0) internal successors, (3966), 6 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:17,587 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 661.0) internal successors, (3966), 6 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:17,588 INFO L175 Difference]: Start difference. First operand has 34 places, 30 transitions, 94 flow. Second operand 5 states and 1351 transitions. [2023-11-06 21:55:17,588 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 65 transitions, 320 flow [2023-11-06 21:55:17,591 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 32 places, 65 transitions, 292 flow, removed 13 selfloop flow, removed 3 redundant places. [2023-11-06 21:55:17,594 INFO L231 Difference]: Finished difference. Result has 35 places, 31 transitions, 100 flow [2023-11-06 21:55:17,594 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=28, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=100, PETRI_PLACES=35, PETRI_TRANSITIONS=31} [2023-11-06 21:55:17,595 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 4 predicate places. [2023-11-06 21:55:17,596 INFO L495 AbstractCegarLoop]: Abstraction has has 35 places, 31 transitions, 100 flow [2023-11-06 21:55:17,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 261.0) internal successors, (1305), 5 states have internal predecessors, (1305), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:17,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:55:17,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 21:55:17,610 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:17,810 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:17,810 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)] === [2023-11-06 21:55:17,811 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:17,811 INFO L85 PathProgramCache]: Analyzing trace with hash -1287816336, now seen corresponding path program 1 times [2023-11-06 21:55:17,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:17,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44571765] [2023-11-06 21:55:17,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:17,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:17,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:17,992 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:17,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:17,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44571765] [2023-11-06 21:55:17,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44571765] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:17,995 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:17,995 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:17,995 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728953859] [2023-11-06 21:55:17,996 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:17,996 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:17,997 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:17,998 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:17,998 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:18,156 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 661 [2023-11-06 21:55:18,159 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 35 places, 31 transitions, 100 flow. Second operand has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:18,159 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:55:18,159 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 661 [2023-11-06 21:55:18,159 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:55:18,405 INFO L124 PetriNetUnfolderBase]: 483/706 cut-off events. [2023-11-06 21:55:18,405 INFO L125 PetriNetUnfolderBase]: For 227/227 co-relation queries the response was YES. [2023-11-06 21:55:18,407 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1734 conditions, 706 events. 483/706 cut-off events. For 227/227 co-relation queries the response was YES. Maximal size of possible extension queue 29. Compared 2172 event pairs, 106 based on Foata normal form. 20/600 useless extension candidates. Maximal degree in co-relation 1718. Up to 401 conditions per place. [2023-11-06 21:55:18,411 INFO L140 encePairwiseOnDemand]: 653/661 looper letters, 47 selfloop transitions, 4 changer transitions 17/68 dead transitions. [2023-11-06 21:55:18,411 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 68 transitions, 328 flow [2023-11-06 21:55:18,412 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 21:55:18,412 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 21:55:18,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1664 transitions. [2023-11-06 21:55:18,419 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41956631366616237 [2023-11-06 21:55:18,419 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1664 transitions. [2023-11-06 21:55:18,419 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1664 transitions. [2023-11-06 21:55:18,421 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:55:18,421 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1664 transitions. [2023-11-06 21:55:18,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 277.3333333333333) internal successors, (1664), 6 states have internal predecessors, (1664), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:18,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:18,441 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 661.0) internal successors, (4627), 7 states have internal predecessors, (4627), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:18,441 INFO L175 Difference]: Start difference. First operand has 35 places, 31 transitions, 100 flow. Second operand 6 states and 1664 transitions. [2023-11-06 21:55:18,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 68 transitions, 328 flow [2023-11-06 21:55:18,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 68 transitions, 318 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 21:55:18,451 INFO L231 Difference]: Finished difference. Result has 40 places, 33 transitions, 126 flow [2023-11-06 21:55:18,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=93, PETRI_DIFFERENCE_MINUEND_PLACES=31, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=126, PETRI_PLACES=40, PETRI_TRANSITIONS=33} [2023-11-06 21:55:18,453 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 9 predicate places. [2023-11-06 21:55:18,453 INFO L495 AbstractCegarLoop]: Abstraction has has 40 places, 33 transitions, 126 flow [2023-11-06 21:55:18,454 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.2) internal successors, (1351), 5 states have internal predecessors, (1351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:18,455 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:55:18,455 INFO L208 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] [2023-11-06 21:55:18,455 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 21:55:18,455 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)] === [2023-11-06 21:55:18,456 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:18,456 INFO L85 PathProgramCache]: Analyzing trace with hash 1517037779, now seen corresponding path program 1 times [2023-11-06 21:55:18,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:18,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556673256] [2023-11-06 21:55:18,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:18,457 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,739 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:18,740 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:18,740 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556673256] [2023-11-06 21:55:18,740 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556673256] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:18,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [781997816] [2023-11-06 21:55:18,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:18,741 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:18,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:18,744 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:18,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 21:55:18,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:18,915 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-06 21:55:18,922 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:19,100 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:19,100 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:19,461 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:19,462 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 314 [2023-11-06 21:55:33,387 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:33,388 INFO L351 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 115 treesize of output 170 [2023-11-06 21:55:33,936 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:33,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [781997816] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:33,937 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:55:33,937 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [4, 5] total 13 [2023-11-06 21:55:33,937 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297949310] [2023-11-06 21:55:33,937 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:33,938 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:55:33,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:33,939 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:55:33,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=63, Invalid=147, Unknown=0, NotChecked=0, Total=210 [2023-11-06 21:55:34,345 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 252 out of 661 [2023-11-06 21:55:34,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 40 places, 33 transitions, 126 flow. Second operand has 7 states, 7 states have (on average 255.14285714285714) internal successors, (1786), 7 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:34,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:55:34,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 252 of 661 [2023-11-06 21:55:34,349 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:55:34,777 INFO L124 PetriNetUnfolderBase]: 1042/1563 cut-off events. [2023-11-06 21:55:34,778 INFO L125 PetriNetUnfolderBase]: For 1107/1107 co-relation queries the response was YES. [2023-11-06 21:55:34,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4048 conditions, 1563 events. 1042/1563 cut-off events. For 1107/1107 co-relation queries the response was YES. Maximal size of possible extension queue 70. Compared 6326 event pairs, 221 based on Foata normal form. 3/1348 useless extension candidates. Maximal degree in co-relation 4022. Up to 550 conditions per place. [2023-11-06 21:55:34,793 INFO L140 encePairwiseOnDemand]: 653/661 looper letters, 71 selfloop transitions, 9 changer transitions 7/87 dead transitions. [2023-11-06 21:55:34,797 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 87 transitions, 498 flow [2023-11-06 21:55:34,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 21:55:34,800 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 21:55:34,806 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1843 transitions. [2023-11-06 21:55:34,808 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3983142424897342 [2023-11-06 21:55:34,808 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1843 transitions. [2023-11-06 21:55:34,809 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1843 transitions. [2023-11-06 21:55:34,810 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:55:34,812 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1843 transitions. [2023-11-06 21:55:34,819 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 263.2857142857143) internal successors, (1843), 7 states have internal predecessors, (1843), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:34,829 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 661.0) internal successors, (5288), 8 states have internal predecessors, (5288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:34,834 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 661.0) internal successors, (5288), 8 states have internal predecessors, (5288), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:34,834 INFO L175 Difference]: Start difference. First operand has 40 places, 33 transitions, 126 flow. Second operand 7 states and 1843 transitions. [2023-11-06 21:55:34,834 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 87 transitions, 498 flow [2023-11-06 21:55:34,838 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 41 places, 87 transitions, 479 flow, removed 7 selfloop flow, removed 3 redundant places. [2023-11-06 21:55:34,839 INFO L231 Difference]: Finished difference. Result has 44 places, 38 transitions, 176 flow [2023-11-06 21:55:34,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=25, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=176, PETRI_PLACES=44, PETRI_TRANSITIONS=38} [2023-11-06 21:55:34,842 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 13 predicate places. [2023-11-06 21:55:34,843 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 38 transitions, 176 flow [2023-11-06 21:55:34,844 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 255.14285714285714) internal successors, (1786), 7 states have internal predecessors, (1786), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:34,844 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:55:34,845 INFO L208 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] [2023-11-06 21:55:34,861 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:35,051 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:35,051 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)] === [2023-11-06 21:55:35,052 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:35,052 INFO L85 PathProgramCache]: Analyzing trace with hash 627466170, now seen corresponding path program 1 times [2023-11-06 21:55:35,052 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:35,056 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831312050] [2023-11-06 21:55:35,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:35,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:35,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:35,290 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:55:35,290 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:35,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831312050] [2023-11-06 21:55:35,291 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831312050] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 21:55:35,291 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 21:55:35,291 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 21:55:35,291 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [556361733] [2023-11-06 21:55:35,292 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:55:35,292 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 21:55:35,292 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:35,293 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 21:55:35,293 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 21:55:35,446 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 266 out of 661 [2023-11-06 21:55:35,447 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 38 transitions, 176 flow. Second operand has 5 states, 5 states have (on average 270.6) internal successors, (1353), 5 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:35,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:55:35,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 266 of 661 [2023-11-06 21:55:35,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:55:35,838 INFO L124 PetriNetUnfolderBase]: 1307/2011 cut-off events. [2023-11-06 21:55:35,838 INFO L125 PetriNetUnfolderBase]: For 2195/2195 co-relation queries the response was YES. [2023-11-06 21:55:35,844 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5886 conditions, 2011 events. 1307/2011 cut-off events. For 2195/2195 co-relation queries the response was YES. Maximal size of possible extension queue 87. Compared 8686 event pairs, 500 based on Foata normal form. 54/2062 useless extension candidates. Maximal degree in co-relation 5857. Up to 819 conditions per place. [2023-11-06 21:55:35,855 INFO L140 encePairwiseOnDemand]: 655/661 looper letters, 76 selfloop transitions, 5 changer transitions 0/81 dead transitions. [2023-11-06 21:55:35,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 81 transitions, 514 flow [2023-11-06 21:55:35,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 21:55:35,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 21:55:35,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1400 transitions. [2023-11-06 21:55:35,862 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4236006051437216 [2023-11-06 21:55:35,862 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1400 transitions. [2023-11-06 21:55:35,862 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1400 transitions. [2023-11-06 21:55:35,864 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:55:35,864 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1400 transitions. [2023-11-06 21:55:35,868 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 280.0) internal successors, (1400), 5 states have internal predecessors, (1400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:35,874 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 661.0) internal successors, (3966), 6 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:35,875 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 661.0) internal successors, (3966), 6 states have internal predecessors, (3966), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:35,876 INFO L175 Difference]: Start difference. First operand has 44 places, 38 transitions, 176 flow. Second operand 5 states and 1400 transitions. [2023-11-06 21:55:35,876 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 81 transitions, 514 flow [2023-11-06 21:55:35,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 81 transitions, 510 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 21:55:35,881 INFO L231 Difference]: Finished difference. Result has 48 places, 40 transitions, 196 flow [2023-11-06 21:55:35,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=196, PETRI_PLACES=48, PETRI_TRANSITIONS=40} [2023-11-06 21:55:35,883 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 17 predicate places. [2023-11-06 21:55:35,883 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 40 transitions, 196 flow [2023-11-06 21:55:35,884 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 270.6) internal successors, (1353), 5 states have internal predecessors, (1353), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:35,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:55:35,884 INFO L208 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] [2023-11-06 21:55:35,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 21:55:35,885 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)] === [2023-11-06 21:55:35,885 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:35,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1109441200, now seen corresponding path program 1 times [2023-11-06 21:55:35,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:35,886 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1960203031] [2023-11-06 21:55:35,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:35,886 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:35,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:36,226 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:36,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1960203031] [2023-11-06 21:55:36,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1960203031] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:36,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [949313769] [2023-11-06 21:55:36,227 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:36,228 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:36,228 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:36,229 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:36,263 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 21:55:36,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:36,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 21:55:36,415 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:36,553 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:36,554 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:36,869 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:36,870 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 314 [2023-11-06 21:55:53,880 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:55:53,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [949313769] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 21:55:53,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 21:55:53,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 11 [2023-11-06 21:55:53,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537461186] [2023-11-06 21:55:53,881 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 21:55:53,881 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-06 21:55:53,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:55:53,882 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-06 21:55:53,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-06 21:55:54,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 257 out of 661 [2023-11-06 21:55:54,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 40 transitions, 196 flow. Second operand has 13 states, 13 states have (on average 262.15384615384613) internal successors, (3408), 13 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:54,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:55:54,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 257 of 661 [2023-11-06 21:55:54,417 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:55:54,936 INFO L124 PetriNetUnfolderBase]: 1355/2099 cut-off events. [2023-11-06 21:55:54,936 INFO L125 PetriNetUnfolderBase]: For 2271/2271 co-relation queries the response was YES. [2023-11-06 21:55:54,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6239 conditions, 2099 events. 1355/2099 cut-off events. For 2271/2271 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 9453 event pairs, 308 based on Foata normal form. 4/2102 useless extension candidates. Maximal degree in co-relation 6208. Up to 689 conditions per place. [2023-11-06 21:55:54,950 INFO L140 encePairwiseOnDemand]: 653/661 looper letters, 64 selfloop transitions, 7 changer transitions 19/90 dead transitions. [2023-11-06 21:55:54,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 90 transitions, 566 flow [2023-11-06 21:55:54,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 21:55:54,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 21:55:54,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 2135 transitions. [2023-11-06 21:55:54,960 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4037443267776097 [2023-11-06 21:55:54,960 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 2135 transitions. [2023-11-06 21:55:54,960 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 2135 transitions. [2023-11-06 21:55:54,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:55:54,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 2135 transitions. [2023-11-06 21:55:54,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 266.875) internal successors, (2135), 8 states have internal predecessors, (2135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:54,977 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 661.0) internal successors, (5949), 9 states have internal predecessors, (5949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:54,980 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 661.0) internal successors, (5949), 9 states have internal predecessors, (5949), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:54,980 INFO L175 Difference]: Start difference. First operand has 48 places, 40 transitions, 196 flow. Second operand 8 states and 2135 transitions. [2023-11-06 21:55:54,980 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 90 transitions, 566 flow [2023-11-06 21:55:54,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 90 transitions, 562 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 21:55:54,986 INFO L231 Difference]: Finished difference. Result has 55 places, 36 transitions, 174 flow [2023-11-06 21:55:54,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=174, PETRI_PLACES=55, PETRI_TRANSITIONS=36} [2023-11-06 21:55:54,988 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 24 predicate places. [2023-11-06 21:55:54,988 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 36 transitions, 174 flow [2023-11-06 21:55:54,990 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 262.15384615384613) internal successors, (3408), 13 states have internal predecessors, (3408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:55:54,990 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:55:54,990 INFO L208 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] [2023-11-06 21:55:55,001 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 21:55:55,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:55,196 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)] === [2023-11-06 21:55:55,196 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:55:55,196 INFO L85 PathProgramCache]: Analyzing trace with hash -2044552634, now seen corresponding path program 1 times [2023-11-06 21:55:55,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:55:55,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [795598672] [2023-11-06 21:55:55,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:55,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:55:55,398 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:57,383 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:55:57,384 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:55:57,386 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [795598672] [2023-11-06 21:55:57,389 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [795598672] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:55:57,392 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1297159742] [2023-11-06 21:55:57,392 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:55:57,392 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:55:57,393 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:55:57,396 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:55:57,415 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 21:55:57,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:55:57,578 INFO L262 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 27 conjunts are in the unsatisfiable core [2023-11-06 21:55:57,587 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:55:58,231 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:55:58,231 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:55:58,514 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:58,515 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 134 treesize of output 314 [2023-11-06 21:55:59,939 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:55:59,939 INFO L351 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 115 treesize of output 170 [2023-11-06 21:56:00,628 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 21:56:00,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1297159742] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:00,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-06 21:56:00,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [10, 7] total 22 [2023-11-06 21:56:00,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1076784309] [2023-11-06 21:56:00,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 21:56:00,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 21:56:00,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 21:56:00,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 21:56:00,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-11-06 21:56:01,174 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 250 out of 661 [2023-11-06 21:56:01,177 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 36 transitions, 174 flow. Second operand has 7 states, 7 states have (on average 253.42857142857142) internal successors, (1774), 7 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:01,177 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 21:56:01,177 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 250 of 661 [2023-11-06 21:56:01,177 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 21:56:01,476 INFO L124 PetriNetUnfolderBase]: 1026/1532 cut-off events. [2023-11-06 21:56:01,476 INFO L125 PetriNetUnfolderBase]: For 1974/1974 co-relation queries the response was YES. [2023-11-06 21:56:01,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4677 conditions, 1532 events. 1026/1532 cut-off events. For 1974/1974 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 6117 event pairs, 197 based on Foata normal form. 1/1532 useless extension candidates. Maximal degree in co-relation 4643. Up to 1353 conditions per place. [2023-11-06 21:56:01,490 INFO L140 encePairwiseOnDemand]: 656/661 looper letters, 49 selfloop transitions, 4 changer transitions 1/54 dead transitions. [2023-11-06 21:56:01,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 347 flow [2023-11-06 21:56:01,490 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 21:56:01,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 21:56:01,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 798 transitions. [2023-11-06 21:56:01,494 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40242057488653554 [2023-11-06 21:56:01,494 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 798 transitions. [2023-11-06 21:56:01,494 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 798 transitions. [2023-11-06 21:56:01,495 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 21:56:01,495 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 798 transitions. [2023-11-06 21:56:01,498 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 266.0) internal successors, (798), 3 states have internal predecessors, (798), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:01,502 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:01,503 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 661.0) internal successors, (2644), 4 states have internal predecessors, (2644), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:01,503 INFO L175 Difference]: Start difference. First operand has 55 places, 36 transitions, 174 flow. Second operand 3 states and 798 transitions. [2023-11-06 21:56:01,503 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 347 flow [2023-11-06 21:56:01,507 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 54 transitions, 319 flow, removed 7 selfloop flow, removed 8 redundant places. [2023-11-06 21:56:01,508 INFO L231 Difference]: Finished difference. Result has 47 places, 39 transitions, 190 flow [2023-11-06 21:56:01,508 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=661, PETRI_DIFFERENCE_MINUEND_FLOW=152, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=190, PETRI_PLACES=47, PETRI_TRANSITIONS=39} [2023-11-06 21:56:01,509 INFO L281 CegarLoopForPetriNet]: 31 programPoint places, 16 predicate places. [2023-11-06 21:56:01,509 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 39 transitions, 190 flow [2023-11-06 21:56:01,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 253.42857142857142) internal successors, (1774), 7 states have internal predecessors, (1774), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 21:56:01,511 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 21:56:01,511 INFO L208 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] [2023-11-06 21:56:01,520 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 21:56:01,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:01,720 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)] === [2023-11-06 21:56:01,721 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 21:56:01,721 INFO L85 PathProgramCache]: Analyzing trace with hash 682711447, now seen corresponding path program 1 times [2023-11-06 21:56:01,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 21:56:01,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1690753125] [2023-11-06 21:56:01,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:01,722 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 21:56:01,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:04,109 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 21:56:04,109 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 21:56:04,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1690753125] [2023-11-06 21:56:04,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1690753125] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 21:56:04,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1970945778] [2023-11-06 21:56:04,110 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 21:56:04,110 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 21:56:04,110 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 21:56:04,111 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 21:56:04,138 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_e1f5b61a-e366-4f3b-9b24-6d4405971b25/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 21:56:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 21:56:04,304 INFO L262 TraceCheckSpWp]: Trace formula consists of 263 conjuncts, 65 conjunts are in the unsatisfiable core [2023-11-06 21:56:04,320 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 21:56:04,379 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-06 21:56:04,398 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,406 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,420 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,425 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 21:56:04,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,464 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 21:56:04,474 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,483 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,499 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,503 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 21:56:04,538 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 5 [2023-11-06 21:56:04,565 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:04,570 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 5 [2023-11-06 21:56:04,585 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,595 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-06 21:56:04,693 INFO L351 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 1 [2023-11-06 21:56:04,799 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-06 21:56:04,800 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-06 21:56:04,990 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 21:56:05,139 INFO L322 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-06 21:56:05,139 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2023-11-06 21:56:05,289 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 21:56:05,419 INFO L351 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 8 treesize of output 1 [2023-11-06 21:56:05,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:05,691 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:56:05,987 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 21:56:05,988 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 21:56:06,568 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 21:56:06,568 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 21:56:10,650 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_AB~0 1))) (or (< .cse0 c_~An~0) (let ((.cse19 (* c_~i_AB~0 4)) (.cse25 (* c_~i_BC~0 4)) (.cse26 (* c_~i_AC~0 4))) (let ((.cse1 (= .cse0 c_~An~0)) (.cse15 (+ c_~A~0.offset .cse26)) (.cse16 (+ c_~C~0.offset .cse26)) (.cse18 (< c_~Cn~0 (+ c_~i_AC~0 1))) (.cse6 (+ c_~C~0.offset .cse25)) (.cse7 (+ .cse25 c_~B~0.offset)) (.cse8 (+ c_~B~0.offset .cse19)) (.cse9 (< c_~i_AC~0 c_~Cn~0)) (.cse10 (< c_~Cn~0 (+ c_~i_BC~0 1))) (.cse11 (= c_~An~0 c_~i_AC~0))) (and (or .cse1 (let ((.cse3 (+ 4 c_~B~0.offset .cse19)) (.cse5 (+ c_~A~0.offset 4 .cse19))) (and (or (forall ((v_ArrVal_296 (Array Int Int)) (~C~0.base Int)) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse2 (select .cse4 c_~B~0.base))) (or (< (select .cse2 .cse3) (select (select .cse4 c_~A~0.base) .cse5)) (< (select (select .cse4 ~C~0.base) .cse6) (select .cse2 .cse7)) (< (select .cse2 .cse8) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse9 .cse10 .cse11) (or (forall ((v_ArrVal_296 (Array Int Int)) (~C~0.base Int)) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse12 (select .cse17 c_~B~0.base)) (.cse13 (select .cse17 c_~A~0.base)) (.cse14 (select .cse17 ~C~0.base))) (or (< (select .cse12 .cse3) (select .cse13 .cse5)) (< (select .cse14 .cse6) (select .cse12 .cse7)) (< (select .cse12 .cse8) |c_thread1Thread1of1ForFork1_#t~mem1|) (< (select .cse13 .cse15) (+ (select .cse14 .cse16) 1)))))) .cse18 .cse10 .cse11)))) (or (not .cse1) (and (or (forall ((v_ArrVal_296 (Array Int Int)) (~C~0.base Int)) (let ((.cse22 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse21 (select .cse22 c_~B~0.base)) (.cse20 (select .cse22 ~C~0.base))) (or (< (select .cse20 .cse6) (select .cse21 .cse7)) (< (select .cse21 .cse8) |c_thread1Thread1of1ForFork1_#t~mem1|) (< (select (select .cse22 c_~A~0.base) .cse15) (+ (select .cse20 .cse16) 1)))))) .cse18 .cse10 .cse11) (or (forall ((v_ArrVal_296 (Array Int Int)) (~C~0.base Int)) (let ((.cse23 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse24 (select .cse23 c_~B~0.base))) (or (< (select (select .cse23 ~C~0.base) .cse6) (select .cse24 .cse7)) (< (select .cse24 .cse8) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse9 .cse10 .cse11)))))))) is different from false [2023-11-06 21:56:11,033 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_AB~0 1))) (or (< .cse0 c_~An~0) (let ((.cse24 (* c_~i_AB~0 4)) (.cse25 (* c_~i_BC~0 4)) (.cse26 (* c_~i_AC~0 4))) (let ((.cse1 (= .cse0 c_~An~0)) (.cse7 (+ c_~A~0.offset .cse26)) (.cse8 (+ c_~C~0.offset .cse26)) (.cse10 (< c_~Cn~0 (+ c_~i_AC~0 1))) (.cse3 (+ c_~C~0.offset .cse25)) (.cse5 (+ .cse25 c_~B~0.offset)) (.cse9 (+ c_~B~0.offset .cse24)) (.cse15 (< c_~i_AC~0 c_~Cn~0)) (.cse11 (< c_~Cn~0 (+ c_~i_BC~0 1))) (.cse12 (= c_~An~0 c_~i_AC~0))) (and (or (not .cse1) (and (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse2 (select .cse6 ~C~0.base)) (.cse4 (select .cse6 c_~B~0.base))) (or (< (select .cse2 .cse3) (select .cse4 .cse5)) (< (select (select .cse6 c_~A~0.base) .cse7) (+ (select .cse2 .cse8) 1)) (< (select .cse4 .cse9) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse10 .cse11 .cse12) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse13 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse14 (select .cse13 c_~B~0.base))) (or (< (select (select .cse13 ~C~0.base) .cse3) (select .cse14 .cse5)) (< (select .cse14 .cse9) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse15 .cse11 .cse12))) (or .cse1 (let ((.cse19 (+ 4 c_~B~0.offset .cse24)) (.cse20 (+ c_~A~0.offset 4 .cse24))) (and (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse21 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse16 (select .cse21 ~C~0.base)) (.cse18 (select .cse21 c_~A~0.base)) (.cse17 (select .cse21 c_~B~0.base))) (or (< (select .cse16 .cse3) (select .cse17 .cse5)) (< (select .cse18 .cse7) (+ (select .cse16 .cse8) 1)) (< (select .cse17 .cse19) (select .cse18 .cse20)) (< (select .cse17 .cse9) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse10 .cse11 .cse12) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse22 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse23 (select .cse22 c_~B~0.base))) (or (< (select (select .cse22 ~C~0.base) .cse3) (select .cse23 .cse5)) (< (select .cse23 .cse19) (select (select .cse22 c_~A~0.base) .cse20)) (< (select .cse23 .cse9) |c_thread1Thread1of1ForFork1_#t~mem1|))))) .cse15 .cse11 .cse12))))))))) is different from false [2023-11-06 21:56:11,306 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_AB~0 1))) (or (< .cse0 c_~An~0) (let ((.cse26 (* c_~i_AC~0 4)) (.cse27 (* c_~i_BC~0 4)) (.cse25 (* c_~i_AB~0 4))) (let ((.cse16 (< c_~i_AC~0 c_~Cn~0)) (.cse4 (+ c_~B~0.offset .cse25)) (.cse5 (select (select |c_#memory_int| c_~A~0.base) (+ c_~A~0.offset .cse25))) (.cse7 (+ c_~C~0.offset .cse27)) (.cse8 (+ .cse27 c_~B~0.offset)) (.cse10 (+ c_~A~0.offset .cse26)) (.cse11 (+ c_~C~0.offset .cse26)) (.cse2 (< c_~Cn~0 (+ c_~i_AC~0 1))) (.cse12 (< c_~Cn~0 (+ c_~i_BC~0 1))) (.cse13 (= c_~An~0 c_~i_AC~0)) (.cse1 (= .cse0 c_~An~0))) (and (or (not .cse1) (and (or .cse2 (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse9 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse3 (select .cse9 c_~B~0.base)) (.cse6 (select .cse9 ~C~0.base))) (or (< (select .cse3 .cse4) .cse5) (< (select .cse6 .cse7) (select .cse3 .cse8)) (< (select (select .cse9 c_~A~0.base) .cse10) (+ (select .cse6 .cse11) 1)))))) .cse12 .cse13) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse15 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse14 (select .cse15 c_~B~0.base))) (or (< (select .cse14 .cse4) .cse5) (< (select (select .cse15 ~C~0.base) .cse7) (select .cse14 .cse8)))))) .cse16 .cse12 .cse13))) (or (let ((.cse19 (+ 4 c_~B~0.offset .cse25)) (.cse20 (+ c_~A~0.offset 4 .cse25))) (and (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse17 (select .cse18 c_~B~0.base))) (or (< (select .cse17 .cse4) .cse5) (< (select (select .cse18 ~C~0.base) .cse7) (select .cse17 .cse8)) (< (select .cse17 .cse19) (select (select .cse18 c_~A~0.base) .cse20)))))) .cse16 .cse12 .cse13) (or (forall ((v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse22 (select .cse24 ~C~0.base)) (.cse21 (select .cse24 c_~B~0.base)) (.cse23 (select .cse24 c_~A~0.base))) (or (< (select .cse21 .cse4) .cse5) (< (select .cse22 .cse7) (select .cse21 .cse8)) (< (select .cse23 .cse10) (+ (select .cse22 .cse11) 1)) (< (select .cse21 .cse19) (select .cse23 .cse20)))))) .cse2 .cse12 .cse13))) .cse1)))))) is different from false [2023-11-06 21:56:11,675 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_AB~0 1))) (or (< .cse0 c_~An~0) (let ((.cse29 (* c_~i_AB~0 4)) (.cse30 (* c_~i_BC~0 4)) (.cse31 (* c_~i_AC~0 4))) (let ((.cse16 (+ c_~A~0.offset .cse31)) (.cse17 (+ .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse18 (< c_~Cn~0 (+ c_~i_AC~0 1))) (.cse3 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse5 (+ .cse30 c_~B~0.offset)) (.cse6 (+ c_~B~0.offset .cse29)) (.cse8 (+ c_~A~0.offset .cse29)) (.cse9 (< c_~i_AC~0 c_~Cn~0)) (.cse10 (< c_~Cn~0 (+ c_~i_BC~0 1))) (.cse11 (= c_~An~0 c_~i_AC~0)) (.cse1 (= .cse0 c_~An~0))) (and (or (not .cse1) (and (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse2 (store (store .cse7 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse4 (select .cse2 c_~B~0.base))) (or (< (select (select .cse2 ~C~0.base) .cse3) (select .cse4 .cse5)) (< (select .cse4 .cse6) (select (select .cse7 c_~A~0.base) .cse8))))))) .cse9 .cse10 .cse11) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse15 (store (store .cse14 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse13 (select .cse15 c_~B~0.base)) (.cse12 (select .cse15 ~C~0.base))) (or (< (select .cse12 .cse3) (select .cse13 .cse5)) (< (select .cse13 .cse6) (select (select .cse14 c_~A~0.base) .cse8)) (< (select (select .cse15 c_~A~0.base) .cse16) (+ (select .cse12 .cse17) 1))))))) .cse18 .cse10 .cse11))) (or (let ((.cse20 (+ 4 c_~B~0.offset .cse29)) (.cse22 (+ c_~A~0.offset 4 .cse29))) (and (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse24 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse25 (store (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse19 (select .cse25 c_~B~0.base)) (.cse21 (select .cse25 c_~A~0.base)) (.cse23 (select .cse25 ~C~0.base))) (or (< (select .cse19 .cse20) (select .cse21 .cse22)) (< (select .cse23 .cse3) (select .cse19 .cse5)) (< (select .cse19 .cse6) (select (select .cse24 c_~A~0.base) .cse8)) (< (select .cse21 .cse16) (+ (select .cse23 .cse17) 1))))))) .cse18 .cse10 .cse11) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse28 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse27 (store (store .cse28 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse26 (select .cse27 c_~B~0.base))) (or (< (select .cse26 .cse20) (select (select .cse27 c_~A~0.base) .cse22)) (< (select (select .cse27 ~C~0.base) .cse3) (select .cse26 .cse5)) (< (select .cse26 .cse6) (select (select .cse28 c_~A~0.base) .cse8))))))) .cse9 .cse10 .cse11))) .cse1)))))) is different from false [2023-11-06 21:56:11,921 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~i_AB~0 1))) (or (< .cse0 c_~An~0) (< |c_ULTIMATE.start_create_fresh_int_array_~size#1| (+ |c_ULTIMATE.start_create_fresh_int_array_~i~0#1| 1)) (let ((.cse30 (* c_~i_AC~0 4)) (.cse31 (* c_~i_BC~0 4)) (.cse21 (* c_~i_AB~0 4))) (let ((.cse22 (= .cse0 c_~An~0)) (.cse20 (< c_~i_AC~0 c_~Cn~0)) (.cse14 (< c_~Cn~0 (+ c_~i_AC~0 1))) (.cse15 (< c_~Cn~0 (+ c_~i_BC~0 1))) (.cse2 (+ c_~B~0.offset .cse21)) (.cse4 (+ c_~A~0.offset .cse21)) (.cse9 (+ .cse31 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse10 (+ .cse31 c_~B~0.offset)) (.cse11 (+ c_~A~0.offset .cse30)) (.cse12 (+ .cse30 |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.offset|)) (.cse16 (= c_~An~0 c_~i_AC~0))) (and (or (let ((.cse5 (+ 4 c_~B~0.offset .cse21)) (.cse7 (+ c_~A~0.offset 4 .cse21))) (and (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse3 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse13 (store (store .cse3 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse1 (select .cse13 c_~B~0.base)) (.cse6 (select .cse13 c_~A~0.base)) (.cse8 (select .cse13 ~C~0.base))) (or (< (select .cse1 .cse2) (select (select .cse3 c_~A~0.base) .cse4)) (< (select .cse1 .cse5) (select .cse6 .cse7)) (< (select .cse8 .cse9) (select .cse1 .cse10)) (< (select .cse6 .cse11) (+ (select .cse8 .cse12) 1))))))) .cse14 .cse15 .cse16) (or (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse18 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse19 (store (store .cse18 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse17 (select .cse19 c_~B~0.base))) (or (< (select .cse17 .cse2) (select (select .cse18 c_~A~0.base) .cse4)) (< (select .cse17 .cse5) (select (select .cse19 c_~A~0.base) .cse7)) (< (select (select .cse19 ~C~0.base) .cse9) (select .cse17 .cse10))))))) .cse20 .cse15 .cse16))) .cse22) (or (not .cse22) (and (or .cse20 (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse24 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse25 (store (store .cse24 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse23 (select .cse25 c_~B~0.base))) (or (< (select .cse23 .cse2) (select (select .cse24 c_~A~0.base) .cse4)) (< (select (select .cse25 ~C~0.base) .cse9) (select .cse23 .cse10))))))) .cse15 .cse16) (or .cse14 .cse15 (forall ((v_ArrVal_294 (Array Int Int)) (v_ArrVal_293 (Array Int Int)) (v_ArrVal_296 (Array Int Int)) (v_ArrVal_295 (Array Int Int)) (~C~0.base Int)) (let ((.cse27 (store (store |c_#memory_int| |c_ULTIMATE.start_create_fresh_int_array_~arr~0#1.base| v_ArrVal_293) |c_ULTIMATE.start_main_~#t1~0#1.base| v_ArrVal_294))) (let ((.cse29 (store (store .cse27 |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_295) |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_296))) (let ((.cse26 (select .cse29 c_~B~0.base)) (.cse28 (select .cse29 ~C~0.base))) (or (< (select .cse26 .cse2) (select (select .cse27 c_~A~0.base) .cse4)) (< (select .cse28 .cse9) (select .cse26 .cse10)) (< (select (select .cse29 c_~A~0.base) .cse11) (+ (select .cse28 .cse12) 1))))))) .cse16)))))))) is different from false [2023-11-06 21:56:14,306 INFO L322 Elim1Store]: treesize reduction 23, result has 60.3 percent of original size [2023-11-06 21:56:14,306 INFO L351 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 2 case distinctions, treesize of input 311 treesize of output 153 [2023-11-06 21:56:14,320 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 21:56:14,896 INFO L322 Elim1Store]: treesize reduction 24, result has 90.6 percent of original size [2023-11-06 21:56:14,898 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 1 disjoint index pairs (out of 21 index pairs), introduced 7 new quantified variables, introduced 20 case distinctions, treesize of input 218330 treesize of output 205016 [2023-11-06 21:56:15,940 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:15,941 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 5717 treesize of output 5128 [2023-11-06 21:56:16,426 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:16,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 2 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 8 case distinctions, treesize of input 5432 treesize of output 5081 [2023-11-06 21:56:16,803 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:16,804 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 5000 treesize of output 4893 [2023-11-06 21:56:17,134 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 21:56:17,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 4864 treesize of output 3763