./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 9bd2c7ff Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu --witnessprinter.witness.filename witness --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 cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e --- Real Ultimate output --- This is Ultimate 0.2.3-dev-9bd2c7f [2023-11-19 07:37:04,776 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-19 07:37:04,904 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-19 07:37:04,912 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-19 07:37:04,913 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-19 07:37:04,950 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-19 07:37:04,951 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-19 07:37:04,952 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-19 07:37:04,953 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-19 07:37:04,958 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-19 07:37:04,959 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-19 07:37:04,959 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-19 07:37:04,959 INFO L153 SettingsManager]: * Use SBE=true [2023-11-19 07:37:04,961 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-19 07:37:04,962 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-19 07:37:04,962 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-19 07:37:04,962 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-19 07:37:04,963 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-19 07:37:04,963 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-19 07:37:04,964 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-19 07:37:04,964 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-19 07:37:04,965 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-19 07:37:04,965 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-19 07:37:04,967 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-19 07:37:04,967 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-19 07:37:04,968 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-19 07:37:04,968 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-19 07:37:04,969 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-19 07:37:04,969 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:04,970 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-19 07:37:04,971 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-19 07:37:04,971 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-19 07:37:04,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-19 07:37:04,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-19 07:37:04,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-19 07:37:04,972 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-19 07:37:04,972 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-19 07:37:04,972 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-19 07:37:04,973 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-19 07:37:04,973 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_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/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_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness 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 -> cc67bee348fb2ffff05c0616660a93fb872177c05d08813d910a29641aea282e [2023-11-19 07:37:05,307 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-19 07:37:05,339 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-19 07:37:05,342 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-19 07:37:05,343 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-19 07:37:05,344 INFO L274 PluginConnector]: CDTParser initialized [2023-11-19 07:37:05,345 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/../../sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2023-11-19 07:37:08,460 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-19 07:37:08,757 INFO L384 CDTParser]: Found 1 translation units. [2023-11-19 07:37:08,758 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c [2023-11-19 07:37:08,770 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/data/7bb673b9e/a08a6ae115a84f2fb7b18d0ee24ffead/FLAGad4a5c5b0 [2023-11-19 07:37:08,787 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/data/7bb673b9e/a08a6ae115a84f2fb7b18d0ee24ffead [2023-11-19 07:37:08,791 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-19 07:37:08,793 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-19 07:37:08,796 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:08,796 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-19 07:37:08,802 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-19 07:37:08,803 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:08" (1/1) ... [2023-11-19 07:37:08,804 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@191dfa02 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:08, skipping insertion in model container [2023-11-19 07:37:08,804 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 19.11 07:37:08" (1/1) ... [2023-11-19 07:37:08,840 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-19 07:37:09,105 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_d7850cbf-2674-4a3f-854b-e4739c466284/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2572,2585] [2023-11-19 07:37:09,130 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:09,143 INFO L202 MainTranslator]: Completed pre-run [2023-11-19 07:37:09,192 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_d7850cbf-2674-4a3f-854b-e4739c466284/sv-benchmarks/c/weaver/popl20-more-mts.wvr.c[2572,2585] [2023-11-19 07:37:09,204 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-19 07:37:09,217 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:37:09,217 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-19 07:37:09,225 INFO L206 MainTranslator]: Completed translation [2023-11-19 07:37:09,226 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09 WrapperNode [2023-11-19 07:37:09,227 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-19 07:37:09,228 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:09,229 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-19 07:37:09,229 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-19 07:37:09,237 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,263 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,314 INFO L138 Inliner]: procedures = 25, calls = 46, calls flagged for inlining = 13, calls inlined = 19, statements flattened = 234 [2023-11-19 07:37:09,316 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-19 07:37:09,317 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-19 07:37:09,317 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-19 07:37:09,317 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-19 07:37:09,327 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,328 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,332 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,332 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,343 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,350 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,352 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,356 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-19 07:37:09,357 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-19 07:37:09,358 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-19 07:37:09,358 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-19 07:37:09,359 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (1/1) ... [2023-11-19 07:37:09,365 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-19 07:37:09,379 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:09,398 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-19 07:37:09,440 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-19 07:37:09,456 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-19 07:37:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-19 07:37:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-19 07:37:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-19 07:37:09,457 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-19 07:37:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-19 07:37:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-19 07:37:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-19 07:37:09,458 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-19 07:37:09,458 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-19 07:37:09,459 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-19 07:37:09,460 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-19 07:37:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-19 07:37:09,461 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-19 07:37:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-19 07:37:09,462 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-19 07:37:09,462 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-19 07:37:09,464 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-19 07:37:09,597 INFO L236 CfgBuilder]: Building ICFG [2023-11-19 07:37:09,600 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-19 07:37:10,102 INFO L277 CfgBuilder]: Performing block encoding [2023-11-19 07:37:10,360 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-19 07:37:10,361 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-19 07:37:10,372 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:10 BoogieIcfgContainer [2023-11-19 07:37:10,372 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-19 07:37:10,378 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-19 07:37:10,378 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-19 07:37:10,381 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-19 07:37:10,383 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 19.11 07:37:08" (1/3) ... [2023-11-19 07:37:10,384 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f9d2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:10, skipping insertion in model container [2023-11-19 07:37:10,384 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 19.11 07:37:09" (2/3) ... [2023-11-19 07:37:10,385 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@79f9d2d7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 19.11 07:37:10, skipping insertion in model container [2023-11-19 07:37:10,386 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 19.11 07:37:10" (3/3) ... [2023-11-19 07:37:10,389 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-more-mts.wvr.c [2023-11-19 07:37:10,398 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-19 07:37:10,410 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-19 07:37:10,410 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-19 07:37:10,411 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-19 07:37:10,543 INFO L144 ThreadInstanceAdder]: Constructed 3 joinOtherThreadTransitions. [2023-11-19 07:37:10,593 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 233 transitions, 487 flow [2023-11-19 07:37:10,712 INFO L124 PetriNetUnfolderBase]: 18/230 cut-off events. [2023-11-19 07:37:10,712 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:37:10,721 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 230 events. 18/230 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 342 event pairs, 0 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2023-11-19 07:37:10,721 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 233 transitions, 487 flow [2023-11-19 07:37:10,733 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 211 places, 219 transitions, 456 flow [2023-11-19 07:37:10,737 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-19 07:37:10,749 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 211 places, 219 transitions, 456 flow [2023-11-19 07:37:10,752 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 211 places, 219 transitions, 456 flow [2023-11-19 07:37:10,752 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 211 places, 219 transitions, 456 flow [2023-11-19 07:37:10,808 INFO L124 PetriNetUnfolderBase]: 18/219 cut-off events. [2023-11-19 07:37:10,808 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:37:10,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 232 conditions, 219 events. 18/219 cut-off events. For 3/3 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 341 event pairs, 0 based on Foata normal form. 0/201 useless extension candidates. Maximal degree in co-relation 190. Up to 2 conditions per place. [2023-11-19 07:37:10,820 INFO L119 LiptonReduction]: Number of co-enabled transitions 9720 [2023-11-19 07:37:18,561 INFO L134 LiptonReduction]: Checked pairs total: 9110 [2023-11-19 07:37:18,561 INFO L136 LiptonReduction]: Total number of compositions: 239 [2023-11-19 07:37:18,578 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-19 07:37:18,586 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=LoopHeads, 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;@331167d7, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-19 07:37:18,586 INFO L358 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2023-11-19 07:37:18,594 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-19 07:37:18,594 INFO L124 PetriNetUnfolderBase]: 4/25 cut-off events. [2023-11-19 07:37:18,594 INFO L125 PetriNetUnfolderBase]: For 3/3 co-relation queries the response was YES. [2023-11-19 07:37:18,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:18,595 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-19 07:37:18,596 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-19 07:37:18,601 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:18,602 INFO L85 PathProgramCache]: Analyzing trace with hash -807965745, now seen corresponding path program 1 times [2023-11-19 07:37:18,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:18,613 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1129527337] [2023-11-19 07:37:18,613 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:18,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:18,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:19,266 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-19 07:37:19,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:19,267 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1129527337] [2023-11-19 07:37:19,268 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1129527337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:19,269 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:19,269 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-19 07:37:19,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083556495] [2023-11-19 07:37:19,273 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:19,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:19,288 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:19,317 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:19,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:19,360 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 472 [2023-11-19 07:37:19,367 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 32 places, 26 transitions, 70 flow. Second operand has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-19 07:37:19,367 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:19,368 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 472 [2023-11-19 07:37:19,369 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:19,696 INFO L124 PetriNetUnfolderBase]: 723/1054 cut-off events. [2023-11-19 07:37:19,697 INFO L125 PetriNetUnfolderBase]: For 89/89 co-relation queries the response was YES. [2023-11-19 07:37:19,702 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2223 conditions, 1054 events. 723/1054 cut-off events. For 89/89 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3719 event pairs, 253 based on Foata normal form. 1/826 useless extension candidates. Maximal degree in co-relation 1834. Up to 632 conditions per place. [2023-11-19 07:37:19,711 INFO L140 encePairwiseOnDemand]: 467/472 looper letters, 42 selfloop transitions, 4 changer transitions 1/47 dead transitions. [2023-11-19 07:37:19,711 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 34 places, 47 transitions, 221 flow [2023-11-19 07:37:19,712 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:19,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:37:19,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 681 transitions. [2023-11-19 07:37:19,737 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4809322033898305 [2023-11-19 07:37:19,738 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 681 transitions. [2023-11-19 07:37:19,739 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 681 transitions. [2023-11-19 07:37:19,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:19,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 681 transitions. [2023-11-19 07:37:19,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 227.0) internal successors, (681), 3 states have internal predecessors, (681), 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-19 07:37:19,764 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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-19 07:37:19,766 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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-19 07:37:19,768 INFO L175 Difference]: Start difference. First operand has 32 places, 26 transitions, 70 flow. Second operand 3 states and 681 transitions. [2023-11-19 07:37:19,769 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 34 places, 47 transitions, 221 flow [2023-11-19 07:37:19,776 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 28 places, 47 transitions, 199 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-19 07:37:19,779 INFO L231 Difference]: Finished difference. Result has 29 places, 29 transitions, 84 flow [2023-11-19 07:37:19,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=58, PETRI_DIFFERENCE_MINUEND_PLACES=26, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=26, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=22, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=29, PETRI_TRANSITIONS=29} [2023-11-19 07:37:19,787 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -3 predicate places. [2023-11-19 07:37:19,787 INFO L495 AbstractCegarLoop]: Abstraction has has 29 places, 29 transitions, 84 flow [2023-11-19 07:37:19,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 217.66666666666666) internal successors, (653), 3 states have internal predecessors, (653), 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-19 07:37:19,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:19,789 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-19 07:37:19,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-19 07:37:19,790 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-19 07:37:19,791 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:19,791 INFO L85 PathProgramCache]: Analyzing trace with hash -2070434521, now seen corresponding path program 1 times [2023-11-19 07:37:19,792 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:19,792 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669223666] [2023-11-19 07:37:19,792 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:19,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:19,859 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,006 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-19 07:37:20,006 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:20,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669223666] [2023-11-19 07:37:20,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669223666] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:20,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:20,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-19 07:37:20,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793227986] [2023-11-19 07:37:20,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:20,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-19 07:37:20,009 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:20,009 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-19 07:37:20,010 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-19 07:37:20,055 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 472 [2023-11-19 07:37:20,057 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 29 places, 29 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-19 07:37:20,057 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:20,058 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 472 [2023-11-19 07:37:20,058 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:20,277 INFO L124 PetriNetUnfolderBase]: 723/1055 cut-off events. [2023-11-19 07:37:20,277 INFO L125 PetriNetUnfolderBase]: For 150/150 co-relation queries the response was YES. [2023-11-19 07:37:20,279 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2497 conditions, 1055 events. 723/1055 cut-off events. For 150/150 co-relation queries the response was YES. Maximal size of possible extension queue 60. Compared 3650 event pairs, 506 based on Foata normal form. 0/910 useless extension candidates. Maximal degree in co-relation 867. Up to 1055 conditions per place. [2023-11-19 07:37:20,285 INFO L140 encePairwiseOnDemand]: 469/472 looper letters, 28 selfloop transitions, 2 changer transitions 0/30 dead transitions. [2023-11-19 07:37:20,285 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 31 places, 30 transitions, 146 flow [2023-11-19 07:37:20,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-19 07:37:20,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-19 07:37:20,288 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 646 transitions. [2023-11-19 07:37:20,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4562146892655367 [2023-11-19 07:37:20,289 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 646 transitions. [2023-11-19 07:37:20,289 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 646 transitions. [2023-11-19 07:37:20,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:20,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 646 transitions. [2023-11-19 07:37:20,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 215.33333333333334) internal successors, (646), 3 states have internal predecessors, (646), 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-19 07:37:20,296 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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-19 07:37:20,298 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 472.0) internal successors, (1888), 4 states have internal predecessors, (1888), 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-19 07:37:20,298 INFO L175 Difference]: Start difference. First operand has 29 places, 29 transitions, 84 flow. Second operand 3 states and 646 transitions. [2023-11-19 07:37:20,299 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 31 places, 30 transitions, 146 flow [2023-11-19 07:37:20,300 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 30 places, 30 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-19 07:37:20,301 INFO L231 Difference]: Finished difference. Result has 31 places, 30 transitions, 92 flow [2023-11-19 07:37:20,301 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=80, PETRI_DIFFERENCE_MINUEND_PLACES=28, 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=3, PETRI_FLOW=92, PETRI_PLACES=31, PETRI_TRANSITIONS=30} [2023-11-19 07:37:20,302 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, -1 predicate places. [2023-11-19 07:37:20,302 INFO L495 AbstractCegarLoop]: Abstraction has has 31 places, 30 transitions, 92 flow [2023-11-19 07:37:20,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 213.0) internal successors, (639), 3 states have internal predecessors, (639), 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-19 07:37:20,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:20,303 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-19 07:37:20,304 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-19 07:37:20,304 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-19 07:37:20,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:20,305 INFO L85 PathProgramCache]: Analyzing trace with hash 863099602, now seen corresponding path program 1 times [2023-11-19 07:37:20,305 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:20,305 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1295510528] [2023-11-19 07:37:20,305 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:20,306 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:20,332 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,462 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-19 07:37:20,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:20,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1295510528] [2023-11-19 07:37:20,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1295510528] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:20,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [639960249] [2023-11-19 07:37:20,463 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:20,463 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:20,464 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:20,468 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:20,496 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-19 07:37:20,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:20,606 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-19 07:37:20,612 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:20,681 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-19 07:37:20,682 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:20,729 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-19 07:37:20,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [639960249] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:20,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2023-11-19 07:37:20,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [5, 4] total 9 [2023-11-19 07:37:20,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1876791766] [2023-11-19 07:37:20,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:20,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-19 07:37:20,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:20,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-19 07:37:20,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-19 07:37:20,822 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 472 [2023-11-19 07:37:20,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 31 places, 30 transitions, 92 flow. Second operand has 5 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 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-19 07:37:20,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:20,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 472 [2023-11-19 07:37:20,824 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:21,101 INFO L124 PetriNetUnfolderBase]: 658/953 cut-off events. [2023-11-19 07:37:21,102 INFO L125 PetriNetUnfolderBase]: For 119/119 co-relation queries the response was YES. [2023-11-19 07:37:21,104 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2167 conditions, 953 events. 658/953 cut-off events. For 119/119 co-relation queries the response was YES. Maximal size of possible extension queue 55. Compared 3454 event pairs, 220 based on Foata normal form. 0/848 useless extension candidates. Maximal degree in co-relation 2154. Up to 493 conditions per place. [2023-11-19 07:37:21,111 INFO L140 encePairwiseOnDemand]: 466/472 looper letters, 39 selfloop transitions, 6 changer transitions 0/45 dead transitions. [2023-11-19 07:37:21,111 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 35 places, 45 transitions, 222 flow [2023-11-19 07:37:21,112 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-19 07:37:21,112 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-19 07:37:21,115 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1031 transitions. [2023-11-19 07:37:21,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43686440677966104 [2023-11-19 07:37:21,116 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1031 transitions. [2023-11-19 07:37:21,116 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1031 transitions. [2023-11-19 07:37:21,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:21,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1031 transitions. [2023-11-19 07:37:21,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 206.2) internal successors, (1031), 5 states have internal predecessors, (1031), 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-19 07:37:21,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 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-19 07:37:21,129 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 472.0) internal successors, (2832), 6 states have internal predecessors, (2832), 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-19 07:37:21,129 INFO L175 Difference]: Start difference. First operand has 31 places, 30 transitions, 92 flow. Second operand 5 states and 1031 transitions. [2023-11-19 07:37:21,129 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 35 places, 45 transitions, 222 flow [2023-11-19 07:37:21,132 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 34 places, 45 transitions, 216 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-19 07:37:21,133 INFO L231 Difference]: Finished difference. Result has 36 places, 31 transitions, 113 flow [2023-11-19 07:37:21,133 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=30, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=30, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=24, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=113, PETRI_PLACES=36, PETRI_TRANSITIONS=31} [2023-11-19 07:37:21,134 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 4 predicate places. [2023-11-19 07:37:21,135 INFO L495 AbstractCegarLoop]: Abstraction has has 36 places, 31 transitions, 113 flow [2023-11-19 07:37:21,136 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 202.4) internal successors, (1012), 5 states have internal predecessors, (1012), 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-19 07:37:21,136 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:21,136 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-19 07:37:21,157 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2023-11-19 07:37:21,357 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:21,357 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-19 07:37:21,358 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:21,358 INFO L85 PathProgramCache]: Analyzing trace with hash 118150923, now seen corresponding path program 1 times [2023-11-19 07:37:21,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:21,358 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1757287027] [2023-11-19 07:37:21,358 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:21,359 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:21,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:21,471 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-19 07:37:21,473 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:21,473 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1757287027] [2023-11-19 07:37:21,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1757287027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-19 07:37:21,474 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-19 07:37:21,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-19 07:37:21,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1403398659] [2023-11-19 07:37:21,474 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-19 07:37:21,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-19 07:37:21,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:21,478 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-19 07:37:21,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-19 07:37:21,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 472 [2023-11-19 07:37:21,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 36 places, 31 transitions, 113 flow. Second operand has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 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-19 07:37:21,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:21,508 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 472 [2023-11-19 07:37:21,508 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:21,750 INFO L124 PetriNetUnfolderBase]: 706/1023 cut-off events. [2023-11-19 07:37:21,750 INFO L125 PetriNetUnfolderBase]: For 773/773 co-relation queries the response was YES. [2023-11-19 07:37:21,752 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2802 conditions, 1023 events. 706/1023 cut-off events. For 773/773 co-relation queries the response was YES. Maximal size of possible extension queue 50. Compared 3507 event pairs, 355 based on Foata normal form. 70/1016 useless extension candidates. Maximal degree in co-relation 2781. Up to 782 conditions per place. [2023-11-19 07:37:21,759 INFO L140 encePairwiseOnDemand]: 468/472 looper letters, 44 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-11-19 07:37:21,759 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 39 places, 48 transitions, 275 flow [2023-11-19 07:37:21,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-19 07:37:21,760 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-19 07:37:21,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 857 transitions. [2023-11-19 07:37:21,763 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4539194915254237 [2023-11-19 07:37:21,763 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 857 transitions. [2023-11-19 07:37:21,764 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 857 transitions. [2023-11-19 07:37:21,764 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:21,765 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 857 transitions. [2023-11-19 07:37:21,767 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 214.25) internal successors, (857), 4 states have internal predecessors, (857), 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-19 07:37:21,772 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 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-19 07:37:21,774 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 472.0) internal successors, (2360), 5 states have internal predecessors, (2360), 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-19 07:37:21,775 INFO L175 Difference]: Start difference. First operand has 36 places, 31 transitions, 113 flow. Second operand 4 states and 857 transitions. [2023-11-19 07:37:21,775 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 39 places, 48 transitions, 275 flow [2023-11-19 07:37:21,779 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 36 places, 48 transitions, 264 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-19 07:37:21,781 INFO L231 Difference]: Finished difference. Result has 37 places, 32 transitions, 125 flow [2023-11-19 07:37:21,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=33, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=125, PETRI_PLACES=37, PETRI_TRANSITIONS=32} [2023-11-19 07:37:21,786 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 5 predicate places. [2023-11-19 07:37:21,787 INFO L495 AbstractCegarLoop]: Abstraction has has 37 places, 32 transitions, 125 flow [2023-11-19 07:37:21,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.75) internal successors, (839), 4 states have internal predecessors, (839), 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-19 07:37:21,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:21,788 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-19 07:37:21,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-19 07:37:21,789 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-19 07:37:21,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:21,790 INFO L85 PathProgramCache]: Analyzing trace with hash -482094159, now seen corresponding path program 1 times [2023-11-19 07:37:21,797 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:21,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [341811117] [2023-11-19 07:37:21,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:21,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:21,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,155 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:24,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [341811117] [2023-11-19 07:37:24,156 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [341811117] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:24,156 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1107474634] [2023-11-19 07:37:24,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:24,157 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:24,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:24,158 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:24,180 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-19 07:37:24,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:24,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-19 07:37:24,305 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:24,425 INFO L378 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-19 07:37:24,511 INFO L378 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-19 07:37:24,581 INFO L378 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-19 07:37:24,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:37:24,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:37:25,235 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-19 07:37:25,368 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:25,368 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:26,319 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (let ((.cse6 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (or (let ((.cse3 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4)))) (and (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse1))) (or (< 0 (+ c_~mts3~0 .cse0 1)) (< (+ c_~sum~0 .cse0 c_~mts2~0) 1)))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_113 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse1)) 0))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse2 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< 0 (+ c_~mts3~0 (select .cse2 .cse1) 1)) (= (+ c_~mts1~0 (select .cse2 .cse3)) 0)))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse5 .cse1)))) (or (< .cse4 0) (= (+ c_~mts1~0 (select .cse5 .cse3)) .cse4))))))) (< .cse6 0) (< 2147483647 .cse6))) (or (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0) (and (forall ((v_ArrVal_113 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse1) c_~mts2~0) 0)) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse7 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse1)))) (or (< .cse7 0) (= .cse7 0))))) (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1))))) is different from false [2023-11-19 07:37:27,027 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0))) (.cse6 (select (select |c_#memory_int| c_~A~0.base) c_~A~0.offset))) (and (let ((.cse0 (+ .cse6 c_~mts1~0))) (or (< .cse0 0) (< 2147483647 .cse0) (and (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse1 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (< 0 (+ c_~mts3~0 (select .cse1 .cse2) 1)) (= (+ (select .cse1 c_~A~0.offset) c_~mts1~0) 0)))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< 0 (+ c_~mts3~0 .cse3 1)) (< (+ c_~sum~0 .cse3 c_~mts2~0) 1)))) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse5 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse4 (+ c_~mts3~0 (select .cse5 .cse2)))) (or (< .cse4 0) (= (+ (select .cse5 c_~A~0.offset) c_~mts1~0) .cse4))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_113 (Array Int Int))) (< (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)) 0)))))) (or (< 0 (+ .cse6 c_~mts1~0 1)) (and (forall ((v_ArrVal_113 (Array Int Int))) (<= (+ c_~sum~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2) c_~mts2~0) 0)) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse7 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)))) (or (< .cse7 0) (= .cse7 0))))) (< (+ .cse6 c_~mts1~0 2147483648) 0)))) is different from false [2023-11-19 07:37:27,212 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse3 (select (select .cse1 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse0 (+ c_~mts3~0 (select (select (store .cse1 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)))) (or (= .cse0 0) (< .cse0 0)))) (< (+ c_~mts1~0 .cse3 2147483648) 0) (< 0 (+ c_~mts1~0 .cse3 1)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse4 (+ c_~mts1~0 (select (select .cse6 c_~A~0.base) c_~A~0.offset)))) (or (< .cse4 0) (< 2147483647 .cse4) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse5 (select (select (store .cse6 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 c_~mts2~0 .cse5) 1) (< 0 (+ c_~mts3~0 .cse5 1))))))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse7 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse8 (select (select .cse7 c_~A~0.base) c_~A~0.offset))) (or (forall ((v_ArrVal_113 (Array Int Int))) (<= (+ c_~sum~0 c_~mts2~0 (select (select (store .cse7 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)) 0)) (< (+ c_~mts1~0 .cse8 2147483648) 0) (< 0 (+ c_~mts1~0 .cse8 1)))))) (or (< (+ c_~sum~0 c_~mts2~0) (+ c_~mts3~0 1)) (forall ((v_ArrVal_113 (Array Int Int)) (v_ArrVal_112 (Array Int Int))) (let ((.cse10 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse9 (+ c_~mts1~0 (select (select .cse10 c_~A~0.base) c_~A~0.offset)))) (or (< .cse9 0) (< 2147483647 .cse9) (< (+ c_~mts3~0 (select (select (store .cse10 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base) .cse2)) 0)))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse14 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse11 (+ c_~mts1~0 (select (select .cse14 c_~A~0.base) c_~A~0.offset)))) (or (< .cse11 0) (< 2147483647 .cse11) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse13 (select (store .cse14 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (let ((.cse12 (+ c_~mts3~0 (select .cse13 .cse2)))) (or (= .cse12 (+ c_~mts1~0 (select .cse13 c_~A~0.offset))) (< .cse12 0))))))))) (forall ((v_ArrVal_112 (Array Int Int))) (let ((.cse17 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t2~0#1.base| v_ArrVal_112))) (let ((.cse15 (+ c_~mts1~0 (select (select .cse17 c_~A~0.base) c_~A~0.offset)))) (or (< .cse15 0) (< 2147483647 .cse15) (forall ((v_ArrVal_113 (Array Int Int))) (let ((.cse16 (select (store .cse17 |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_113) c_~A~0.base))) (or (= 0 (+ c_~mts1~0 (select .cse16 c_~A~0.offset))) (< 0 (+ c_~mts3~0 (select .cse16 .cse2) 1))))))))))) is different from false [2023-11-19 07:37:28,369 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:28,369 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 89 [2023-11-19 07:37:28,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:28,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 453 treesize of output 437 [2023-11-19 07:37:28,432 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 311 treesize of output 263 [2023-11-19 07:37:28,462 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:28,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 377 treesize of output 353 [2023-11-19 07:37:28,497 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:28,498 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 179 treesize of output 171 [2023-11-19 07:37:31,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:31,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 120 treesize of output 84 [2023-11-19 07:37:31,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:31,695 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2765 treesize of output 2661 [2023-11-19 07:37:31,766 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:31,767 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 187 [2023-11-19 07:37:31,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:31,820 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 188 treesize of output 172 [2023-11-19 07:37:31,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:31,864 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 196 treesize of output 172 [2023-11-19 07:37:33,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:33,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 150 treesize of output 102 [2023-11-19 07:37:33,518 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:37:33,531 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:33,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 617 treesize of output 565 [2023-11-19 07:37:33,572 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:37:33,573 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 123 treesize of output 101 [2023-11-19 07:37:33,598 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:33,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 141 treesize of output 109 [2023-11-19 07:37:33,683 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 07:37:33,683 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 125 treesize of output 1 [2023-11-19 07:37:33,699 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:33,699 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 65 [2023-11-19 07:37:33,707 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:37:33,721 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:33,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 420 treesize of output 392 [2023-11-19 07:37:33,753 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:37:33,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 90 treesize of output 80 [2023-11-19 07:37:33,801 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:33,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 81 [2023-11-19 07:37:33,862 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-19 07:37:33,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 1 [2023-11-19 07:37:33,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:33,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1107474634] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:33,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:33,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-19 07:37:33,963 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [634534195] [2023-11-19 07:37:33,963 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:33,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-19 07:37:33,964 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:33,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-19 07:37:33,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=697, Unknown=4, NotChecked=168, Total=992 [2023-11-19 07:37:34,333 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-11-19 07:37:34,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 37 places, 32 transitions, 125 flow. Second operand has 32 states, 32 states have (on average 137.25) internal successors, (4392), 32 states have internal predecessors, (4392), 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-19 07:37:34,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:34,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-11-19 07:37:34,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:37,386 INFO L124 PetriNetUnfolderBase]: 1437/2069 cut-off events. [2023-11-19 07:37:37,386 INFO L125 PetriNetUnfolderBase]: For 1541/1541 co-relation queries the response was YES. [2023-11-19 07:37:37,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6167 conditions, 2069 events. 1437/2069 cut-off events. For 1541/1541 co-relation queries the response was YES. Maximal size of possible extension queue 88. Compared 8143 event pairs, 145 based on Foata normal form. 1/1922 useless extension candidates. Maximal degree in co-relation 5355. Up to 1072 conditions per place. [2023-11-19 07:37:37,406 INFO L140 encePairwiseOnDemand]: 459/472 looper letters, 105 selfloop transitions, 32 changer transitions 1/138 dead transitions. [2023-11-19 07:37:37,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 138 transitions, 760 flow [2023-11-19 07:37:37,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-19 07:37:37,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-19 07:37:37,413 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 1618 transitions. [2023-11-19 07:37:37,414 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.31163328197226503 [2023-11-19 07:37:37,415 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 1618 transitions. [2023-11-19 07:37:37,415 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 1618 transitions. [2023-11-19 07:37:37,416 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:37,416 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 1618 transitions. [2023-11-19 07:37:37,422 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 147.0909090909091) internal successors, (1618), 11 states have internal predecessors, (1618), 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-19 07:37:37,432 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 472.0) internal successors, (5664), 12 states have internal predecessors, (5664), 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-19 07:37:37,435 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 472.0) internal successors, (5664), 12 states have internal predecessors, (5664), 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-19 07:37:37,436 INFO L175 Difference]: Start difference. First operand has 37 places, 32 transitions, 125 flow. Second operand 11 states and 1618 transitions. [2023-11-19 07:37:37,436 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 138 transitions, 760 flow [2023-11-19 07:37:37,442 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 138 transitions, 729 flow, removed 7 selfloop flow, removed 2 redundant places. [2023-11-19 07:37:37,446 INFO L231 Difference]: Finished difference. Result has 51 places, 59 transitions, 362 flow [2023-11-19 07:37:37,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=15, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=362, PETRI_PLACES=51, PETRI_TRANSITIONS=59} [2023-11-19 07:37:37,448 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 19 predicate places. [2023-11-19 07:37:37,449 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 59 transitions, 362 flow [2023-11-19 07:37:37,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 137.25) internal successors, (4392), 32 states have internal predecessors, (4392), 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-19 07:37:37,451 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:37,452 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-19 07:37:37,478 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:37,673 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:37,673 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-19 07:37:37,674 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:37,674 INFO L85 PathProgramCache]: Analyzing trace with hash -882043591, now seen corresponding path program 2 times [2023-11-19 07:37:37,674 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:37,674 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1431146790] [2023-11-19 07:37:37,674 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:37,674 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:37,739 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:38,808 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:38,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:38,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1431146790] [2023-11-19 07:37:38,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1431146790] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:38,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [696538974] [2023-11-19 07:37:38,809 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-19 07:37:38,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:38,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:38,812 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:38,832 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-19 07:37:38,946 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-19 07:37:38,946 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:37:38,949 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 44 conjunts are in the unsatisfiable core [2023-11-19 07:37:38,953 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:39,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 82 treesize of output 46 [2023-11-19 07:37:39,778 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:39,779 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:40,474 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:40,474 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 185 treesize of output 89 [2023-11-19 07:37:40,558 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-19 07:37:40,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 1 [2023-11-19 07:37:40,958 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:40,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [696538974] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:40,959 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:40,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-19 07:37:40,959 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [987629815] [2023-11-19 07:37:40,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:40,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-19 07:37:40,961 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:40,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-19 07:37:40,963 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=539, Unknown=0, NotChecked=0, Total=650 [2023-11-19 07:37:43,597 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 175 out of 472 [2023-11-19 07:37:43,604 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 59 transitions, 362 flow. Second operand has 26 states, 26 states have (on average 177.76923076923077) internal successors, (4622), 26 states have internal predecessors, (4622), 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-19 07:37:43,604 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:43,604 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 175 of 472 [2023-11-19 07:37:43,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-19 07:37:44,938 INFO L124 PetriNetUnfolderBase]: 1711/2462 cut-off events. [2023-11-19 07:37:44,938 INFO L125 PetriNetUnfolderBase]: For 3416/3416 co-relation queries the response was YES. [2023-11-19 07:37:44,947 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8721 conditions, 2462 events. 1711/2462 cut-off events. For 3416/3416 co-relation queries the response was YES. Maximal size of possible extension queue 107. Compared 9940 event pairs, 353 based on Foata normal form. 1/2286 useless extension candidates. Maximal degree in co-relation 7714. Up to 1796 conditions per place. [2023-11-19 07:37:44,965 INFO L140 encePairwiseOnDemand]: 462/472 looper letters, 95 selfloop transitions, 32 changer transitions 1/128 dead transitions. [2023-11-19 07:37:44,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 128 transitions, 905 flow [2023-11-19 07:37:44,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-19 07:37:44,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-19 07:37:44,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 1851 transitions. [2023-11-19 07:37:44,974 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39216101694915256 [2023-11-19 07:37:44,974 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 1851 transitions. [2023-11-19 07:37:44,974 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 1851 transitions. [2023-11-19 07:37:44,976 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-19 07:37:44,976 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 1851 transitions. [2023-11-19 07:37:44,981 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 185.1) internal successors, (1851), 10 states have internal predecessors, (1851), 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-19 07:37:44,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 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-19 07:37:44,993 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 472.0) internal successors, (5192), 11 states have internal predecessors, (5192), 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-19 07:37:44,993 INFO L175 Difference]: Start difference. First operand has 51 places, 59 transitions, 362 flow. Second operand 10 states and 1851 transitions. [2023-11-19 07:37:44,993 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 128 transitions, 905 flow [2023-11-19 07:37:45,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 128 transitions, 847 flow, removed 28 selfloop flow, removed 1 redundant places. [2023-11-19 07:37:45,010 INFO L231 Difference]: Finished difference. Result has 64 places, 77 transitions, 556 flow [2023-11-19 07:37:45,010 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=472, PETRI_DIFFERENCE_MINUEND_FLOW=320, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=556, PETRI_PLACES=64, PETRI_TRANSITIONS=77} [2023-11-19 07:37:45,013 INFO L281 CegarLoopForPetriNet]: 32 programPoint places, 32 predicate places. [2023-11-19 07:37:45,013 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 77 transitions, 556 flow [2023-11-19 07:37:45,017 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 177.76923076923077) internal successors, (4622), 26 states have internal predecessors, (4622), 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-19 07:37:45,017 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-19 07:37:45,017 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-19 07:37:45,038 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-19 07:37:45,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable5 [2023-11-19 07:37:45,232 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-19 07:37:45,233 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-19 07:37:45,233 INFO L85 PathProgramCache]: Analyzing trace with hash 29841085, now seen corresponding path program 3 times [2023-11-19 07:37:45,233 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-19 07:37:45,233 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [253556985] [2023-11-19 07:37:45,233 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-19 07:37:45,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-19 07:37:45,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-19 07:37:46,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-19 07:37:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [253556985] [2023-11-19 07:37:46,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [253556985] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-19 07:37:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1931549559] [2023-11-19 07:37:46,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-19 07:37:46,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-19 07:37:46,971 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 [2023-11-19 07:37:46,980 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-19 07:37:46,981 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d7850cbf-2674-4a3f-854b-e4739c466284/bin/uautomizer-verify-uCwYo4JHxu/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-19 07:37:47,119 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-19 07:37:47,120 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-19 07:37:47,123 INFO L262 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-19 07:37:47,126 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-19 07:37:47,545 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-19 07:37:47,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-19 07:37:47,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 52 [2023-11-19 07:37:48,157 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:48,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-19 07:37:49,458 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse26 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1|))) (let ((.cse0 (< (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 2147483648) 0)) (.cse4 (< 0 (+ |c_thread1Thread1of1ForFork2_plus_~a#1| |c_thread1Thread1of1ForFork2_plus_~b#1| 1))) (.cse6 (< .cse26 0)) (.cse17 (< 2147483647 .cse26)) (.cse11 (+ c_~A~0.offset (* |c_thread1Thread1of1ForFork2_~i~0#1| 4))) (.cse2 (+ c_~A~0.offset (* 4 c_~M~0)))) (and (or .cse0 (and (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base) .cse2))) (or (< (+ c_~mts3~0 .cse1) 0) (< (+ c_~sum~0 .cse1 c_~mts2~0) 1)))) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse3 (+ c_~mts3~0 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base) .cse2)))) (or (< .cse3 0) (= .cse3 0))))) .cse4) (or .cse0 (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse5 (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base) .cse2))) (or (< (+ c_~sum~0 .cse5 c_~mts2~0) 1) (< 0 (+ c_~mts3~0 .cse5 1))))) .cse4) (or .cse6 (let ((.cse12 (+ c_~sum~0 c_~mts2~0))) (and (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse10 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse8 (select .cse10 .cse2))) (let ((.cse7 (+ c_~mts1~0 (select .cse10 .cse11))) (.cse9 (+ c_~mts3~0 .cse8))) (or (= .cse7 (+ c_~sum~0 .cse8 c_~mts2~0)) (= .cse7 .cse9) (< .cse9 0)))))) (or (< c_~mts3~0 .cse12) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse13 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse14 (+ c_~mts3~0 (select .cse13 .cse2)))) (or (= (+ c_~mts1~0 (select .cse13 .cse11)) .cse14) (< .cse14 0)))))) (or (< .cse12 (+ c_~mts3~0 1)) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse15 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse16 (select .cse15 .cse2))) (or (= (+ c_~mts1~0 (select .cse15 .cse11)) (+ c_~sum~0 .cse16 c_~mts2~0)) (< (+ c_~mts3~0 .cse16) 0)))))))) .cse17) (or .cse6 .cse17 (and (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse18 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse19 (select .cse18 .cse2))) (or (= (+ c_~mts1~0 (select .cse18 .cse11)) 0) (< 0 (+ c_~sum~0 .cse19 c_~mts2~0)) (< 0 (+ c_~mts3~0 .cse19 1)))))) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse22 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse20 (+ c_~mts1~0 (select .cse22 .cse11))) (.cse21 (select .cse22 .cse2))) (or (= .cse20 (+ c_~sum~0 .cse21 c_~mts2~0)) (= .cse20 0) (< 0 (+ c_~mts3~0 .cse21 1)))))) (forall ((v_ArrVal_178 (Array Int Int))) (let ((.cse23 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_178) c_~A~0.base))) (let ((.cse25 (select .cse23 .cse2))) (let ((.cse24 (+ c_~sum~0 .cse25 c_~mts2~0))) (or (= (+ c_~mts1~0 (select .cse23 .cse11)) .cse24) (< .cse24 1) (< 0 (+ c_~mts3~0 .cse25 1)))))))))))) is different from false [2023-11-19 07:37:49,751 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:49,751 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 378 treesize of output 282 [2023-11-19 07:37:49,773 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:49,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 257 treesize of output 242 [2023-11-19 07:37:49,790 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:49,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 233 treesize of output 218 [2023-11-19 07:37:49,806 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-19 07:37:49,806 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 209 treesize of output 200 [2023-11-19 07:37:50,331 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:37:50,338 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:50,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 85 treesize of output 41 [2023-11-19 07:37:50,356 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:37:50,364 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:50,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 29 [2023-11-19 07:37:50,386 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-19 07:37:50,396 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-19 07:37:50,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 176 treesize of output 76 [2023-11-19 07:37:50,771 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-19 07:37:50,771 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1931549559] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-19 07:37:50,772 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-19 07:37:50,772 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 28 [2023-11-19 07:37:50,772 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [529227459] [2023-11-19 07:37:50,772 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-19 07:37:50,773 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-19 07:37:50,774 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-19 07:37:50,774 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-19 07:37:50,775 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=132, Invalid=683, Unknown=1, NotChecked=54, Total=870 [2023-11-19 07:37:50,895 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 472 [2023-11-19 07:37:50,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 77 transitions, 556 flow. Second operand has 30 states, 30 states have (on average 137.4) internal successors, (4122), 30 states have internal predecessors, (4122), 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-19 07:37:50,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-19 07:37:50,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 472 [2023-11-19 07:37:50,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand