./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:03:37,807 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:03:37,894 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-06 22:03:37,901 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:03:37,902 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:03:37,937 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:03:37,938 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:03:37,939 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:03:37,940 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:03:37,941 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:03:37,942 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:03:37,943 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:03:37,943 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:03:37,944 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:03:37,945 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:03:37,946 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:03:37,947 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:03:37,947 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:03:37,948 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:03:37,949 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:03:37,949 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:03:37,961 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:03:37,962 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:03:37,963 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:03:37,963 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:03:37,964 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:03:37,964 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:03:37,965 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:03:37,965 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:03:37,968 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:03:37,969 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:03:37,969 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:03:37,971 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:03:37,972 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:03:37,972 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:03:37,973 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:03:37,973 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:03:37,974 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:03:37,975 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:03:37,975 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_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 841ea5a5ca051cc33dfe29d877ccdea4b63526a0ee61a2de18869a9ba1858c4b [2023-11-06 22:03:38,398 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:03:38,439 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:03:38,443 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:03:38,445 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:03:38,446 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:03:38,447 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2023-11-06 22:03:42,218 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:03:42,535 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:03:42,536 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c [2023-11-06 22:03:42,554 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/data/17ff4b893/93f9540f7cec402c9258780516645385/FLAG5dbf3f1df [2023-11-06 22:03:42,578 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/data/17ff4b893/93f9540f7cec402c9258780516645385 [2023-11-06 22:03:42,589 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:03:42,593 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:03:42,598 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:03:42,599 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:03:42,605 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:03:42,606 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:42,607 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@38907f8a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42, skipping insertion in model container [2023-11-06 22:03:42,607 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:42,649 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:03:42,886 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_cc154210-1d6a-40ff-a043-576656495e75/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2023-11-06 22:03:42,898 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:03:42,910 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:03:42,947 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_cc154210-1d6a-40ff-a043-576656495e75/sv-benchmarks/c/weaver/popl20-prod-cons3.wvr.c[4007,4020] [2023-11-06 22:03:42,953 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:03:42,964 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:03:42,964 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-06 22:03:42,973 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:03:42,974 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42 WrapperNode [2023-11-06 22:03:42,974 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:03:42,976 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:03:42,976 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:03:42,976 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:03:42,986 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:42,998 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,038 INFO L138 Inliner]: procedures = 26, calls = 73, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 276 [2023-11-06 22:03:43,039 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:03:43,040 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:03:43,040 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:03:43,041 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:03:43,050 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,050 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,055 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,056 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,068 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,074 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,077 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,080 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,085 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:03:43,087 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:03:43,087 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:03:43,087 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:03:43,088 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (1/1) ... [2023-11-06 22:03:43,104 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:03:43,118 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:03:43,134 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:03:43,169 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:03:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:03:43,188 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:03:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:03:43,189 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:03:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:03:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:03:43,190 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:03:43,190 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:03:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread3 [2023-11-06 22:03:43,191 INFO L138 BoogieDeclarations]: Found implementation of procedure thread3 [2023-11-06 22:03:43,191 INFO L130 BoogieDeclarations]: Found specification of procedure thread4 [2023-11-06 22:03:43,194 INFO L138 BoogieDeclarations]: Found implementation of procedure thread4 [2023-11-06 22:03:43,194 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:03:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-06 22:03:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-06 22:03:43,195 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:03:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:03:43,196 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:03:43,196 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:03:43,198 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:03:43,415 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:03:43,418 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:03:44,032 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:03:44,157 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:03:44,157 INFO L302 CfgBuilder]: Removed 5 assume(true) statements. [2023-11-06 22:03:44,161 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:44 BoogieIcfgContainer [2023-11-06 22:03:44,161 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:03:44,179 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:03:44,179 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:03:44,184 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:03:44,184 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:03:42" (1/3) ... [2023-11-06 22:03:44,185 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:44, skipping insertion in model container [2023-11-06 22:03:44,185 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:03:42" (2/3) ... [2023-11-06 22:03:44,186 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3e72c1b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:03:44, skipping insertion in model container [2023-11-06 22:03:44,186 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:03:44" (3/3) ... [2023-11-06 22:03:44,188 INFO L112 eAbstractionObserver]: Analyzing ICFG popl20-prod-cons3.wvr.c [2023-11-06 22:03:44,200 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:03:44,214 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:03:44,214 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-06 22:03:44,214 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:03:44,378 INFO L144 ThreadInstanceAdder]: Constructed 4 joinOtherThreadTransitions. [2023-11-06 22:03:44,431 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 240 places, 245 transitions, 518 flow [2023-11-06 22:03:44,564 INFO L124 PetriNetUnfolderBase]: 18/241 cut-off events. [2023-11-06 22:03:44,564 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:03:44,572 INFO L83 FinitePrefix]: Finished finitePrefix Result has 258 conditions, 241 events. 18/241 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 133 event pairs, 0 based on Foata normal form. 0/222 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2023-11-06 22:03:44,572 INFO L82 GeneralOperation]: Start removeDead. Operand has 240 places, 245 transitions, 518 flow [2023-11-06 22:03:44,581 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 223 places, 228 transitions, 480 flow [2023-11-06 22:03:44,586 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:03:44,599 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 223 places, 228 transitions, 480 flow [2023-11-06 22:03:44,603 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 223 places, 228 transitions, 480 flow [2023-11-06 22:03:44,604 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 223 places, 228 transitions, 480 flow [2023-11-06 22:03:44,682 INFO L124 PetriNetUnfolderBase]: 18/228 cut-off events. [2023-11-06 22:03:44,682 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:03:44,684 INFO L83 FinitePrefix]: Finished finitePrefix Result has 245 conditions, 228 events. 18/228 cut-off events. For 4/4 co-relation queries the response was YES. Maximal size of possible extension queue 3. Compared 132 event pairs, 0 based on Foata normal form. 0/210 useless extension candidates. Maximal degree in co-relation 207. Up to 3 conditions per place. [2023-11-06 22:03:44,688 INFO L119 LiptonReduction]: Number of co-enabled transitions 2374 [2023-11-06 22:03:57,895 INFO L134 LiptonReduction]: Checked pairs total: 5035 [2023-11-06 22:03:57,896 INFO L136 LiptonReduction]: Total number of compositions: 237 [2023-11-06 22:03:57,915 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:03:57,923 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@1fa82e10, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:03:57,923 INFO L358 AbstractCegarLoop]: Starting to check reachability of 5 error locations. [2023-11-06 22:03:57,937 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:03:57,938 INFO L124 PetriNetUnfolderBase]: 5/35 cut-off events. [2023-11-06 22:03:57,938 INFO L125 PetriNetUnfolderBase]: For 4/4 co-relation queries the response was YES. [2023-11-06 22:03:57,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:57,939 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:57,940 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 2 more)] === [2023-11-06 22:03:57,945 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:57,946 INFO L85 PathProgramCache]: Analyzing trace with hash -1694093376, now seen corresponding path program 1 times [2023-11-06 22:03:57,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:57,958 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1926865708] [2023-11-06 22:03:57,958 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:57,958 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:58,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:58,698 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:58,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:58,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1926865708] [2023-11-06 22:03:58,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1926865708] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:58,702 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:58,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:58,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1484685197] [2023-11-06 22:03:58,706 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:58,714 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:58,720 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:58,748 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:58,748 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:58,800 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 482 [2023-11-06 22:03:58,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 36 transitions, 96 flow. Second operand has 4 states, 4 states have (on average 220.25) internal successors, (881), 4 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:58,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:58,808 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 482 [2023-11-06 22:03:58,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:03:59,466 INFO L124 PetriNetUnfolderBase]: 1729/2516 cut-off events. [2023-11-06 22:03:59,466 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2023-11-06 22:03:59,479 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5103 conditions, 2516 events. 1729/2516 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 158. Compared 11773 event pairs, 180 based on Foata normal form. 0/2077 useless extension candidates. Maximal degree in co-relation 4347. Up to 805 conditions per place. [2023-11-06 22:03:59,511 INFO L140 encePairwiseOnDemand]: 477/482 looper letters, 72 selfloop transitions, 5 changer transitions 0/80 dead transitions. [2023-11-06 22:03:59,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 359 flow [2023-11-06 22:03:59,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:03:59,517 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:03:59,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1149 transitions. [2023-11-06 22:03:59,542 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47676348547717845 [2023-11-06 22:03:59,543 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1149 transitions. [2023-11-06 22:03:59,544 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1149 transitions. [2023-11-06 22:03:59,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:03:59,554 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1149 transitions. [2023-11-06 22:03:59,565 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 229.8) internal successors, (1149), 5 states have internal predecessors, (1149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:59,579 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:59,583 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:59,585 INFO L175 Difference]: Start difference. First operand has 44 places, 36 transitions, 96 flow. Second operand 5 states and 1149 transitions. [2023-11-06 22:03:59,587 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 359 flow [2023-11-06 22:03:59,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 39 places, 80 transitions, 326 flow, removed 0 selfloop flow, removed 9 redundant places. [2023-11-06 22:03:59,602 INFO L231 Difference]: Finished difference. Result has 42 places, 39 transitions, 108 flow [2023-11-06 22:03:59,604 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=78, PETRI_DIFFERENCE_MINUEND_PLACES=35, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=108, PETRI_PLACES=42, PETRI_TRANSITIONS=39} [2023-11-06 22:03:59,611 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -2 predicate places. [2023-11-06 22:03:59,612 INFO L495 AbstractCegarLoop]: Abstraction has has 42 places, 39 transitions, 108 flow [2023-11-06 22:03:59,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.25) internal successors, (881), 4 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:59,613 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:03:59,614 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:03:59,614 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:03:59,615 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 2 more)] === [2023-11-06 22:03:59,615 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:03:59,616 INFO L85 PathProgramCache]: Analyzing trace with hash 1043173774, now seen corresponding path program 2 times [2023-11-06 22:03:59,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:03:59,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [636962976] [2023-11-06 22:03:59,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:03:59,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:03:59,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:03:59,886 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:03:59,886 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:03:59,887 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [636962976] [2023-11-06 22:03:59,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [636962976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:03:59,887 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:03:59,887 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:03:59,888 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1179940634] [2023-11-06 22:03:59,888 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:03:59,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:03:59,890 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:03:59,890 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:03:59,891 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:03:59,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 214 out of 482 [2023-11-06 22:03:59,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 42 places, 39 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 220.25) internal successors, (881), 4 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:03:59,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:03:59,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 214 of 482 [2023-11-06 22:03:59,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:00,494 INFO L124 PetriNetUnfolderBase]: 1949/2762 cut-off events. [2023-11-06 22:04:00,495 INFO L125 PetriNetUnfolderBase]: For 733/733 co-relation queries the response was YES. [2023-11-06 22:04:00,504 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6091 conditions, 2762 events. 1949/2762 cut-off events. For 733/733 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 12675 event pairs, 198 based on Foata normal form. 0/2393 useless extension candidates. Maximal degree in co-relation 3849. Up to 1095 conditions per place. [2023-11-06 22:04:00,528 INFO L140 encePairwiseOnDemand]: 477/482 looper letters, 65 selfloop transitions, 7 changer transitions 0/76 dead transitions. [2023-11-06 22:04:00,529 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 76 transitions, 346 flow [2023-11-06 22:04:00,529 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:04:00,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:04:00,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1142 transitions. [2023-11-06 22:04:00,535 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4738589211618257 [2023-11-06 22:04:00,535 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1142 transitions. [2023-11-06 22:04:00,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1142 transitions. [2023-11-06 22:04:00,537 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:00,537 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1142 transitions. [2023-11-06 22:04:00,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 228.4) internal successors, (1142), 5 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:00,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:00,553 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 482.0) internal successors, (2892), 6 states have internal predecessors, (2892), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:00,554 INFO L175 Difference]: Start difference. First operand has 42 places, 39 transitions, 108 flow. Second operand 5 states and 1142 transitions. [2023-11-06 22:04:00,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 76 transitions, 346 flow [2023-11-06 22:04:00,559 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 76 transitions, 342 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:04:00,561 INFO L231 Difference]: Finished difference. Result has 48 places, 43 transitions, 149 flow [2023-11-06 22:04:00,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=149, PETRI_PLACES=48, PETRI_TRANSITIONS=43} [2023-11-06 22:04:00,563 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 4 predicate places. [2023-11-06 22:04:00,563 INFO L495 AbstractCegarLoop]: Abstraction has has 48 places, 43 transitions, 149 flow [2023-11-06 22:04:00,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 220.25) internal successors, (881), 4 states have internal predecessors, (881), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:00,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:00,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:00,565 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:04:00,565 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 2 more)] === [2023-11-06 22:04:00,566 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:00,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1866310368, now seen corresponding path program 3 times [2023-11-06 22:04:00,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:00,567 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1715384029] [2023-11-06 22:04:00,567 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:00,567 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:00,617 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:00,894 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:00,895 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:00,895 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1715384029] [2023-11-06 22:04:00,895 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1715384029] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:00,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:00,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:04:00,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [758783463] [2023-11-06 22:04:00,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:00,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:04:00,897 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:00,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:04:00,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:04:00,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 482 [2023-11-06 22:04:00,990 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 48 places, 43 transitions, 149 flow. Second operand has 6 states, 6 states have (on average 214.16666666666666) internal successors, (1285), 6 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:00,990 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:00,991 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 482 [2023-11-06 22:04:00,991 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:02,296 INFO L124 PetriNetUnfolderBase]: 4627/6418 cut-off events. [2023-11-06 22:04:02,297 INFO L125 PetriNetUnfolderBase]: For 3006/3006 co-relation queries the response was YES. [2023-11-06 22:04:02,320 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15203 conditions, 6418 events. 4627/6418 cut-off events. For 3006/3006 co-relation queries the response was YES. Maximal size of possible extension queue 346. Compared 32010 event pairs, 338 based on Foata normal form. 164/5857 useless extension candidates. Maximal degree in co-relation 8964. Up to 2110 conditions per place. [2023-11-06 22:04:02,354 INFO L140 encePairwiseOnDemand]: 475/482 looper letters, 79 selfloop transitions, 7 changer transitions 18/107 dead transitions. [2023-11-06 22:04:02,354 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 107 transitions, 544 flow [2023-11-06 22:04:02,355 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:04:02,355 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:04:02,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1568 transitions. [2023-11-06 22:04:02,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.46473029045643155 [2023-11-06 22:04:02,363 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1568 transitions. [2023-11-06 22:04:02,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1568 transitions. [2023-11-06 22:04:02,365 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:02,365 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1568 transitions. [2023-11-06 22:04:02,372 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 224.0) internal successors, (1568), 7 states have internal predecessors, (1568), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:02,382 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 482.0) internal successors, (3856), 8 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:02,386 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 482.0) internal successors, (3856), 8 states have internal predecessors, (3856), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:02,386 INFO L175 Difference]: Start difference. First operand has 48 places, 43 transitions, 149 flow. Second operand 7 states and 1568 transitions. [2023-11-06 22:04:02,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 107 transitions, 544 flow [2023-11-06 22:04:02,403 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 107 transitions, 539 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:04:02,405 INFO L231 Difference]: Finished difference. Result has 55 places, 41 transitions, 156 flow [2023-11-06 22:04:02,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=145, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=156, PETRI_PLACES=55, PETRI_TRANSITIONS=41} [2023-11-06 22:04:02,407 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-06 22:04:02,412 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 41 transitions, 156 flow [2023-11-06 22:04:02,414 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 214.16666666666666) internal successors, (1285), 6 states have internal predecessors, (1285), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:02,414 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:02,414 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:02,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:04:02,415 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 2 more)] === [2023-11-06 22:04:02,416 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:02,416 INFO L85 PathProgramCache]: Analyzing trace with hash -1032525922, now seen corresponding path program 1 times [2023-11-06 22:04:02,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:02,419 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2048224720] [2023-11-06 22:04:02,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:02,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:02,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:02,591 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:02,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:02,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2048224720] [2023-11-06 22:04:02,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2048224720] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:02,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:02,592 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:04:02,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [197096840] [2023-11-06 22:04:02,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:02,594 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:04:02,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:02,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:04:02,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:04:02,605 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 482 [2023-11-06 22:04:02,607 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 41 transitions, 156 flow. Second operand has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:02,607 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:02,607 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 482 [2023-11-06 22:04:02,607 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:03,086 INFO L124 PetriNetUnfolderBase]: 1581/2444 cut-off events. [2023-11-06 22:04:03,087 INFO L125 PetriNetUnfolderBase]: For 2949/2949 co-relation queries the response was YES. [2023-11-06 22:04:03,098 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6285 conditions, 2444 events. 1581/2444 cut-off events. For 2949/2949 co-relation queries the response was YES. Maximal size of possible extension queue 136. Compared 11579 event pairs, 426 based on Foata normal form. 54/2212 useless extension candidates. Maximal degree in co-relation 2434. Up to 1681 conditions per place. [2023-11-06 22:04:03,116 INFO L140 encePairwiseOnDemand]: 479/482 looper letters, 43 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-06 22:04:03,117 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 52 transitions, 268 flow [2023-11-06 22:04:03,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:04:03,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:04:03,120 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 694 transitions. [2023-11-06 22:04:03,120 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.47994467496542187 [2023-11-06 22:04:03,121 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 694 transitions. [2023-11-06 22:04:03,121 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 694 transitions. [2023-11-06 22:04:03,122 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:03,122 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 694 transitions. [2023-11-06 22:04:03,124 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.33333333333334) internal successors, (694), 3 states have internal predecessors, (694), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,129 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,131 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,131 INFO L175 Difference]: Start difference. First operand has 55 places, 41 transitions, 156 flow. Second operand 3 states and 694 transitions. [2023-11-06 22:04:03,132 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 52 transitions, 268 flow [2023-11-06 22:04:03,139 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 52 transitions, 240 flow, removed 1 selfloop flow, removed 11 redundant places. [2023-11-06 22:04:03,140 INFO L231 Difference]: Finished difference. Result has 47 places, 40 transitions, 130 flow [2023-11-06 22:04:03,141 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=37, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=47, PETRI_TRANSITIONS=40} [2023-11-06 22:04:03,142 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-06 22:04:03,142 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 40 transitions, 130 flow [2023-11-06 22:04:03,143 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 224.66666666666666) internal successors, (674), 3 states have internal predecessors, (674), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,143 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:03,143 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:03,143 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:04:03,144 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 2 more)] === [2023-11-06 22:04:03,144 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:03,144 INFO L85 PathProgramCache]: Analyzing trace with hash -1135408077, now seen corresponding path program 1 times [2023-11-06 22:04:03,145 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:03,145 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527984086] [2023-11-06 22:04:03,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:03,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:03,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:03,248 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:04:03,249 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:03,249 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527984086] [2023-11-06 22:04:03,249 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527984086] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:03,249 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:03,250 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:04:03,250 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [90410146] [2023-11-06 22:04:03,250 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:03,250 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:04:03,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:03,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:04:03,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:04:03,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 216 out of 482 [2023-11-06 22:04:03,261 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 40 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,262 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:03,262 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 216 of 482 [2023-11-06 22:04:03,262 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:03,665 INFO L124 PetriNetUnfolderBase]: 1239/1961 cut-off events. [2023-11-06 22:04:03,665 INFO L125 PetriNetUnfolderBase]: For 1317/1317 co-relation queries the response was YES. [2023-11-06 22:04:03,673 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5011 conditions, 1961 events. 1239/1961 cut-off events. For 1317/1317 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 8878 event pairs, 557 based on Foata normal form. 34/1791 useless extension candidates. Maximal degree in co-relation 2132. Up to 1567 conditions per place. [2023-11-06 22:04:03,688 INFO L140 encePairwiseOnDemand]: 479/482 looper letters, 42 selfloop transitions, 2 changer transitions 3/54 dead transitions. [2023-11-06 22:04:03,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 49 places, 54 transitions, 260 flow [2023-11-06 22:04:03,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:04:03,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:04:03,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 695 transitions. [2023-11-06 22:04:03,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4806362378976487 [2023-11-06 22:04:03,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 695 transitions. [2023-11-06 22:04:03,693 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 695 transitions. [2023-11-06 22:04:03,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:03,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 695 transitions. [2023-11-06 22:04:03,697 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 231.66666666666666) internal successors, (695), 3 states have internal predecessors, (695), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,701 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,702 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 482.0) internal successors, (1928), 4 states have internal predecessors, (1928), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,702 INFO L175 Difference]: Start difference. First operand has 47 places, 40 transitions, 130 flow. Second operand 3 states and 695 transitions. [2023-11-06 22:04:03,702 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 49 places, 54 transitions, 260 flow [2023-11-06 22:04:03,705 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 54 transitions, 258 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:04:03,706 INFO L231 Difference]: Finished difference. Result has 49 places, 41 transitions, 140 flow [2023-11-06 22:04:03,707 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=140, PETRI_PLACES=49, PETRI_TRANSITIONS=41} [2023-11-06 22:04:03,707 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 5 predicate places. [2023-11-06 22:04:03,708 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 41 transitions, 140 flow [2023-11-06 22:04:03,708 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 225.33333333333334) internal successors, (676), 3 states have internal predecessors, (676), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:03,709 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:03,709 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:03,709 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:04:03,710 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 2 more)] === [2023-11-06 22:04:03,710 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:03,710 INFO L85 PathProgramCache]: Analyzing trace with hash -117787816, now seen corresponding path program 1 times [2023-11-06 22:04:03,710 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:03,711 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [622499457] [2023-11-06 22:04:03,711 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:03,711 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:03,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:03,925 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-06 22:04:03,926 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:03,926 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [622499457] [2023-11-06 22:04:03,926 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [622499457] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:03,926 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:03,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:04:03,927 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [718763612] [2023-11-06 22:04:03,927 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:03,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:04:03,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:03,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:04:03,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:04:04,006 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 482 [2023-11-06 22:04:04,008 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 41 transitions, 140 flow. Second operand has 4 states, 4 states have (on average 213.5) internal successors, (854), 4 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,008 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:04,008 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 482 [2023-11-06 22:04:04,009 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:04,410 INFO L124 PetriNetUnfolderBase]: 1349/2181 cut-off events. [2023-11-06 22:04:04,410 INFO L125 PetriNetUnfolderBase]: For 1699/1699 co-relation queries the response was YES. [2023-11-06 22:04:04,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5820 conditions, 2181 events. 1349/2181 cut-off events. For 1699/1699 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 9931 event pairs, 1008 based on Foata normal form. 22/2003 useless extension candidates. Maximal degree in co-relation 4895. Up to 1741 conditions per place. [2023-11-06 22:04:04,450 INFO L140 encePairwiseOnDemand]: 478/482 looper letters, 33 selfloop transitions, 2 changer transitions 17/59 dead transitions. [2023-11-06 22:04:04,450 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 59 transitions, 289 flow [2023-11-06 22:04:04,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:04:04,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:04:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 875 transitions. [2023-11-06 22:04:04,454 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538381742738589 [2023-11-06 22:04:04,455 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 875 transitions. [2023-11-06 22:04:04,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 875 transitions. [2023-11-06 22:04:04,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:04,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 875 transitions. [2023-11-06 22:04:04,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.75) internal successors, (875), 4 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,464 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,465 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,466 INFO L175 Difference]: Start difference. First operand has 49 places, 41 transitions, 140 flow. Second operand 4 states and 875 transitions. [2023-11-06 22:04:04,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 59 transitions, 289 flow [2023-11-06 22:04:04,470 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 59 transitions, 287 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:04:04,471 INFO L231 Difference]: Finished difference. Result has 53 places, 42 transitions, 152 flow [2023-11-06 22:04:04,472 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=152, PETRI_PLACES=53, PETRI_TRANSITIONS=42} [2023-11-06 22:04:04,473 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-06 22:04:04,473 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 42 transitions, 152 flow [2023-11-06 22:04:04,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.5) internal successors, (854), 4 states have internal predecessors, (854), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,474 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:04,474 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:04,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:04:04,475 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 2 more)] === [2023-11-06 22:04:04,475 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:04,475 INFO L85 PathProgramCache]: Analyzing trace with hash 1453582796, now seen corresponding path program 1 times [2023-11-06 22:04:04,476 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:04,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1332728102] [2023-11-06 22:04:04,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:04,476 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:04,515 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:04,715 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:04:04,715 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:04,715 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1332728102] [2023-11-06 22:04:04,716 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1332728102] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:04:04,716 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:04:04,716 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:04:04,716 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [837287312] [2023-11-06 22:04:04,717 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:04:04,717 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:04:04,717 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:04,718 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:04:04,718 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:04:04,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 482 [2023-11-06 22:04:04,811 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 42 transitions, 152 flow. Second operand has 4 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:04,812 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:04,812 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 482 [2023-11-06 22:04:04,812 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:05,271 INFO L124 PetriNetUnfolderBase]: 1558/2498 cut-off events. [2023-11-06 22:04:05,271 INFO L125 PetriNetUnfolderBase]: For 1995/1995 co-relation queries the response was YES. [2023-11-06 22:04:05,283 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6643 conditions, 2498 events. 1558/2498 cut-off events. For 1995/1995 co-relation queries the response was YES. Maximal size of possible extension queue 108. Compared 11588 event pairs, 1186 based on Foata normal form. 34/2301 useless extension candidates. Maximal degree in co-relation 6622. Up to 1742 conditions per place. [2023-11-06 22:04:05,294 INFO L140 encePairwiseOnDemand]: 478/482 looper letters, 34 selfloop transitions, 2 changer transitions 18/61 dead transitions. [2023-11-06 22:04:05,295 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 61 transitions, 315 flow [2023-11-06 22:04:05,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:04:05,297 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:04:05,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 875 transitions. [2023-11-06 22:04:05,301 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4538381742738589 [2023-11-06 22:04:05,301 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 875 transitions. [2023-11-06 22:04:05,301 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 875 transitions. [2023-11-06 22:04:05,302 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:04:05,302 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 875 transitions. [2023-11-06 22:04:05,307 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 218.75) internal successors, (875), 4 states have internal predecessors, (875), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:05,312 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:05,313 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 482.0) internal successors, (2410), 5 states have internal predecessors, (2410), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:05,313 INFO L175 Difference]: Start difference. First operand has 53 places, 42 transitions, 152 flow. Second operand 4 states and 875 transitions. [2023-11-06 22:04:05,313 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 61 transitions, 315 flow [2023-11-06 22:04:05,319 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 61 transitions, 307 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-06 22:04:05,323 INFO L231 Difference]: Finished difference. Result has 55 places, 43 transitions, 160 flow [2023-11-06 22:04:05,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=146, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=160, PETRI_PLACES=55, PETRI_TRANSITIONS=43} [2023-11-06 22:04:05,324 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-06 22:04:05,325 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 43 transitions, 160 flow [2023-11-06 22:04:05,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 213.75) internal successors, (855), 4 states have internal predecessors, (855), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:05,325 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:04:05,326 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:04:05,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:04:05,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:04:05,327 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:04:05,327 INFO L85 PathProgramCache]: Analyzing trace with hash -1151495839, now seen corresponding path program 1 times [2023-11-06 22:04:05,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:04:05,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [139904285] [2023-11-06 22:04:05,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:05,328 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:04:05,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:08,720 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:04:08,721 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:04:08,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [139904285] [2023-11-06 22:04:08,721 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [139904285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:04:08,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1741928692] [2023-11-06 22:04:08,722 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:04:08,722 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:04:08,722 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:04:08,728 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:04:08,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:04:08,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:04:08,944 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:04:08,955 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:04:09,082 INFO L351 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 638 treesize of output 622 [2023-11-06 22:04:09,975 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-06 22:04:10,121 INFO L351 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-06 22:04:10,441 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:10,442 INFO L351 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 30 treesize of output 26 [2023-11-06 22:04:10,637 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:04:10,637 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:04:13,152 WARN L839 $PredicateComparison]: unable to prove that (forall ((~queue2~0.base Int) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse1 (store |c_#memory_int| |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse0 (select .cse1 ~queue2~0.base))) (or (< (+ (select .cse0 (+ ~queue2~0.offset (* c_~front2~0 4))) c_~d2~0) (+ (* c_~W~0 2) 1)) (< (+ (select (select .cse1 c_~queue1~0.base) (+ c_~queue1~0.offset (* c_~front1~0 4))) 1) (select .cse0 (+ ~queue2~0.offset (* c_~back2~0 4)))))))) is different from false [2023-11-06 22:04:13,228 WARN L839 $PredicateComparison]: unable to prove that (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse0 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse1 (select .cse0 ~queue2~0.base))) (or (< (+ (select (select .cse0 c_~queue1~0.base) (+ c_~queue1~0.offset (* c_~front1~0 4))) 1) (select .cse1 (+ ~queue2~0.offset (* c_~back2~0 4)))) (< (+ (select .cse1 (+ ~queue2~0.offset (* c_~front2~0 4))) c_~d2~0) (+ (* c_~W~0 2) 1)))))) is different from false [2023-11-06 22:04:13,372 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:13,372 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1987 treesize of output 1799 [2023-11-06 22:04:13,528 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:13,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 414 treesize of output 346 [2023-11-06 22:04:13,637 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:04:13,638 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 313 treesize of output 299 [2023-11-06 22:04:26,520 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 1 trivial. 1 not checked. [2023-11-06 22:04:26,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1741928692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:04:26,521 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:04:26,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 15, 15] total 42 [2023-11-06 22:04:26,521 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021851770] [2023-11-06 22:04:26,521 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:04:26,522 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 43 states [2023-11-06 22:04:26,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:04:26,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 43 interpolants. [2023-11-06 22:04:26,525 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=143, Invalid=1502, Unknown=3, NotChecked=158, Total=1806 [2023-11-06 22:04:27,009 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 482 [2023-11-06 22:04:27,017 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 43 transitions, 160 flow. Second operand has 43 states, 43 states have (on average 128.13953488372093) internal successors, (5510), 43 states have internal predecessors, (5510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:04:27,017 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:04:27,017 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 482 [2023-11-06 22:04:27,018 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:04:29,364 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~W~0 2))) (let ((.cse0 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse2 (* c_~back2~0 4)) (.cse3 (* c_~front2~0 4)) (.cse4 (+ .cse7 1))) (and (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse0) 1) (select .cse1 (+ ~queue2~0.offset .cse2))) (< (+ c_~d2~0 (select .cse1 (+ ~queue2~0.offset .cse3))) .cse4)))) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse6 (select .cse5 ~queue2~0.base))) (or (< (+ (select (select .cse5 c_~queue1~0.base) .cse0) 1) (select .cse6 (+ ~queue2~0.offset .cse2))) (< (+ (select .cse6 (+ ~queue2~0.offset .cse3)) c_~d2~0) .cse4))))) (<= c_~d2~0 .cse7)))) is different from false [2023-11-06 22:04:32,010 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse2 (* c_~back2~0 4)) (.cse3 (* c_~front2~0 4)) (.cse4 (+ (* c_~W~0 2) 1))) (and (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse0) 1) (select .cse1 (+ ~queue2~0.offset .cse2))) (< (+ c_~d2~0 (select .cse1 (+ ~queue2~0.offset .cse3))) .cse4)))) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse6 (select .cse5 ~queue2~0.base))) (or (< (+ (select (select .cse5 c_~queue1~0.base) .cse0) 1) (select .cse6 (+ ~queue2~0.offset .cse2))) (< (+ (select .cse6 (+ ~queue2~0.offset .cse3)) c_~d2~0) .cse4))))) (<= 1 c_~W~0) (<= c_~d2~0 2))) is different from false [2023-11-06 22:04:32,401 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (* c_~W~0 2))) (let ((.cse0 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse2 (* c_~back2~0 4)) (.cse3 (* c_~front2~0 4)) (.cse4 (+ .cse7 1))) (and (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse0) 1) (select .cse1 (+ ~queue2~0.offset .cse2))) (< (+ c_~d2~0 (select .cse1 (+ ~queue2~0.offset .cse3))) .cse4)))) (= |c_thread2Thread1of1ForFork1_~cond~1#1| 1) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse6 (select .cse5 ~queue2~0.base))) (or (< (+ (select (select .cse5 c_~queue1~0.base) .cse0) 1) (select .cse6 (+ ~queue2~0.offset .cse2))) (< (+ (select .cse6 (+ ~queue2~0.offset .cse3)) c_~d2~0) .cse4))))) (<= c_~d2~0 .cse7)))) is different from false [2023-11-06 22:04:35,017 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse2 (* c_~back2~0 4)) (.cse3 (* c_~front2~0 4)) (.cse4 (+ (* c_~W~0 2) 1))) (and (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse0) 1) (select .cse1 (+ ~queue2~0.offset .cse2))) (< (+ c_~d2~0 (select .cse1 (+ ~queue2~0.offset .cse3))) .cse4)))) (= |c_thread2Thread1of1ForFork1_~cond~1#1| 1) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse6 (select .cse5 ~queue2~0.base))) (or (< (+ (select (select .cse5 c_~queue1~0.base) .cse0) 1) (select .cse6 (+ ~queue2~0.offset .cse2))) (< (+ (select .cse6 (+ ~queue2~0.offset .cse3)) c_~d2~0) .cse4))))) (<= 1 c_~W~0) (<= c_~d2~0 2))) is different from false [2023-11-06 22:04:38,963 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:40,981 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:43,001 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:45,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:47,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:47,343 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse2 (* c_~back2~0 4)) (.cse3 (* c_~front2~0 4)) (.cse4 (+ (* c_~W~0 2) 1))) (and (exists ((~queue1~0.base Int)) (= (select (select |c_#memory_int| ~queue1~0.base) 0) 1)) (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse1 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse0) 1) (select .cse1 (+ ~queue2~0.offset .cse2))) (< (+ c_~d2~0 (select .cse1 (+ ~queue2~0.offset .cse3))) .cse4)))) (= c_~back2~0 c_~front2~0) (= |c_thread2Thread1of1ForFork1_~cond~1#1| 1) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse5 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse6 (select .cse5 ~queue2~0.base))) (or (< (+ (select (select .cse5 c_~queue1~0.base) .cse0) 1) (select .cse6 (+ ~queue2~0.offset .cse2))) (< (+ (select .cse6 (+ ~queue2~0.offset .cse3)) c_~d2~0) .cse4))))) (<= |c_thread2Thread1of1ForFork1_~temp~0#1| 1) (<= c_~d2~0 0) (<= 1 c_~W~0))) is different from false [2023-11-06 22:04:50,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:52,711 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:54,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:04:54,922 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ c_~queue1~0.offset (* c_~front1~0 4))) (.cse1 (* c_~back2~0 4)) (.cse2 (* c_~front2~0 4)) (.cse3 (+ (* c_~W~0 2) 1))) (and (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse0 (select |c_#memory_int| ~queue2~0.base))) (or (not (= (select .cse0 (+ ~queue2~0.offset .cse1)) (+ |c_thread2Thread1of1ForFork1_~temp~0#1| 1))) (< (+ c_~d2~0 (select .cse0 (+ ~queue2~0.offset .cse2))) .cse3)))) (forall ((~queue2~0.base Int) (~queue2~0.offset Int)) (let ((.cse5 (select |c_#memory_int| ~queue2~0.base))) (or (< (+ (select (select |c_#memory_int| c_~queue1~0.base) .cse4) 1) (select .cse5 (+ ~queue2~0.offset .cse1))) (< (+ c_~d2~0 (select .cse5 (+ ~queue2~0.offset .cse2))) .cse3)))) (= |c_thread2Thread1of1ForFork1_~cond~1#1| 1) (= c_~v_assert~0 1) (forall ((~queue2~0.base Int) (v_ArrVal_195 (Array Int Int)) (v_ArrVal_196 (Array Int Int)) (~queue2~0.offset Int)) (let ((.cse6 (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#t3~0#1.base| v_ArrVal_195) |c_ULTIMATE.start_main_~#t4~0#1.base| v_ArrVal_196))) (let ((.cse7 (select .cse6 ~queue2~0.base))) (or (< (+ (select (select .cse6 c_~queue1~0.base) .cse4) 1) (select .cse7 (+ ~queue2~0.offset .cse1))) (< (+ (select .cse7 (+ ~queue2~0.offset .cse2)) c_~d2~0) .cse3))))) (<= 1 c_~W~0) (<= c_~d2~0 2))) is different from false [2023-11-06 22:04:59,263 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:05:01,365 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:05:03,375 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:05:07,722 INFO L124 PetriNetUnfolderBase]: 15448/21819 cut-off events. [2023-11-06 22:05:07,722 INFO L125 PetriNetUnfolderBase]: For 14172/14172 co-relation queries the response was YES. [2023-11-06 22:05:07,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 60572 conditions, 21819 events. 15448/21819 cut-off events. For 14172/14172 co-relation queries the response was YES. Maximal size of possible extension queue 503. Compared 118072 event pairs, 968 based on Foata normal form. 136/20170 useless extension candidates. Maximal degree in co-relation 41334. Up to 3415 conditions per place. [2023-11-06 22:05:07,925 INFO L140 encePairwiseOnDemand]: 455/482 looper letters, 762 selfloop transitions, 250 changer transitions 95/1107 dead transitions. [2023-11-06 22:05:07,925 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 150 places, 1107 transitions, 5705 flow [2023-11-06 22:05:07,925 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 97 states. [2023-11-06 22:05:07,925 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 97 states. [2023-11-06 22:05:07,990 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 13306 transitions. [2023-11-06 22:05:08,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.2845959703982547 [2023-11-06 22:05:08,002 INFO L72 ComplementDD]: Start complementDD. Operand 97 states and 13306 transitions. [2023-11-06 22:05:08,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 97 states and 13306 transitions. [2023-11-06 22:05:08,014 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:05:08,014 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 97 states and 13306 transitions. [2023-11-06 22:05:08,064 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 98 states, 97 states have (on average 137.17525773195877) internal successors, (13306), 97 states have internal predecessors, (13306), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:08,175 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 98 states, 98 states have (on average 482.0) internal successors, (47236), 98 states have internal predecessors, (47236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:08,203 INFO L81 ComplementDD]: Finished complementDD. Result has 98 states, 98 states have (on average 482.0) internal successors, (47236), 98 states have internal predecessors, (47236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:08,204 INFO L175 Difference]: Start difference. First operand has 55 places, 43 transitions, 160 flow. Second operand 97 states and 13306 transitions. [2023-11-06 22:05:08,204 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 150 places, 1107 transitions, 5705 flow [2023-11-06 22:05:08,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 148 places, 1107 transitions, 5634 flow, removed 32 selfloop flow, removed 2 redundant places. [2023-11-06 22:05:08,346 INFO L231 Difference]: Finished difference. Result has 206 places, 314 transitions, 2263 flow [2023-11-06 22:05:08,347 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=482, PETRI_DIFFERENCE_MINUEND_FLOW=154, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=12, PETRI_DIFFERENCE_SUBTRAHEND_STATES=97, PETRI_FLOW=2263, PETRI_PLACES=206, PETRI_TRANSITIONS=314} [2023-11-06 22:05:08,348 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 162 predicate places. [2023-11-06 22:05:08,348 INFO L495 AbstractCegarLoop]: Abstraction has has 206 places, 314 transitions, 2263 flow [2023-11-06 22:05:08,351 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 43 states, 43 states have (on average 128.13953488372093) internal successors, (5510), 43 states have internal predecessors, (5510), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-06 22:05:08,351 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:05:08,352 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:05:08,366 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:05:08,559 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:08,560 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 2 more)] === [2023-11-06 22:05:08,561 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:05:08,561 INFO L85 PathProgramCache]: Analyzing trace with hash -1844719397, now seen corresponding path program 2 times [2023-11-06 22:05:08,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:05:08,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [711382717] [2023-11-06 22:05:08,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:05:08,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:05:08,717 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:05:11,880 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:05:11,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:05:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [711382717] [2023-11-06 22:05:11,881 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [711382717] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:05:11,881 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1524020700] [2023-11-06 22:05:11,881 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:05:11,882 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:05:11,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:05:11,883 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:05:11,908 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_cc154210-1d6a-40ff-a043-576656495e75/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:05:12,106 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:05:12,106 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:05:12,110 INFO L262 TraceCheckSpWp]: Trace formula consists of 309 conjuncts, 64 conjunts are in the unsatisfiable core [2023-11-06 22:05:12,119 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:05:12,637 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-06 22:05:12,780 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:05:12,991 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:05:13,124 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-06 22:05:14,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:05:14,024 INFO L322 Elim1Store]: treesize reduction 21, result has 30.0 percent of original size [2023-11-06 22:05:14,025 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 27 [2023-11-06 22:05:14,149 INFO L351 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 15 treesize of output 7 [2023-11-06 22:05:14,344 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:05:14,344 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:05:16,772 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:16,772 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 134 treesize of output 98 [2023-11-06 22:05:16,871 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:16,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 8009 treesize of output 7557 [2023-11-06 22:05:17,154 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:17,155 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1928 treesize of output 1792 [2023-11-06 22:05:17,355 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:17,355 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1719 treesize of output 1691 [2023-11-06 22:05:17,618 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:05:17,619 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1761 treesize of output 1409 [2023-11-06 22:05:17,775 INFO L351 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 278 treesize of output 230