./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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 ! overflow) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:36:37,243 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:36:37,309 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:36:37,315 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:36:37,316 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:36:37,345 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:36:37,346 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:36:37,346 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:36:37,347 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:36:37,347 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:36:37,348 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:36:37,349 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:36:37,349 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:36:37,350 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:36:37,350 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:36:37,351 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:36:37,352 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:36:37,352 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:36:37,353 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:36:37,353 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:36:37,354 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:36:37,361 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:36:37,361 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:36:37,362 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:36:37,364 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:36:37,364 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:36:37,364 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:36:37,365 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:36:37,365 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:36:37,366 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:36:37,366 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:36:37,367 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:36:37,367 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:36:37,368 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:36:37,368 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:36:37,369 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:36:37,369 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:36:37,369 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:36:37,370 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:36:37,370 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:36:37,371 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:36:37,375 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_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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 ! overflow) ) 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 -> 7cc273f13a619f37768d5108c297b75ab7c37145fe391daced9c134730721251 [2023-11-06 22:36:37,617 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:36:37,638 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:36:37,640 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:36:37,641 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:36:37,642 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:36:37,643 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread/queue_ok.i [2023-11-06 22:36:40,766 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:36:41,037 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:36:41,038 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/sv-benchmarks/c/pthread/queue_ok.i [2023-11-06 22:36:41,058 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/data/7a9baceeb/ec77f5c07ef34bfdb3f121f803e180f7/FLAGd7de57401 [2023-11-06 22:36:41,073 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/data/7a9baceeb/ec77f5c07ef34bfdb3f121f803e180f7 [2023-11-06 22:36:41,078 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:36:41,081 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:36:41,086 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:36:41,089 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:36:41,095 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:36:41,095 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,097 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3210e778 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41, skipping insertion in model container [2023-11-06 22:36:41,097 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,164 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:36:41,632 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:36:41,648 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:36:41,737 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:36:41,837 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:36:41,837 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41 WrapperNode [2023-11-06 22:36:41,837 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:36:41,839 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:36:41,839 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:36:41,840 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:36:41,849 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:36:41" (1/1) ... [2023-11-06 22:36:41,884 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:36:41" (1/1) ... [2023-11-06 22:36:41,942 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2023-11-06 22:36:41,943 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:36:41,944 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:36:41,945 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:36:41,945 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:36:41,955 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,956 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,970 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,970 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:41,997 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:42,002 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:42,004 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:42,006 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:42,022 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:36:42,023 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:36:42,023 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:36:42,024 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:36:42,024 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (1/1) ... [2023-11-06 22:36:42,033 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:36:42,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:36:42,066 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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:36:42,101 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/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:36:42,110 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-06 22:36:42,111 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-06 22:36:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-06 22:36:42,111 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-06 22:36:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:36:42,111 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:36:42,112 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:36:42,113 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:36:42,114 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:36:42,319 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:36:42,320 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:36:42,758 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:36:42,770 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:36:42,770 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:36:42,773 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:42 BoogieIcfgContainer [2023-11-06 22:36:42,773 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:36:42,776 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:36:42,776 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:36:42,780 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:36:42,780 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:36:41" (1/3) ... [2023-11-06 22:36:42,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e69b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:42, skipping insertion in model container [2023-11-06 22:36:42,781 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:36:41" (2/3) ... [2023-11-06 22:36:42,781 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@64e69b4f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:36:42, skipping insertion in model container [2023-11-06 22:36:42,782 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:36:42" (3/3) ... [2023-11-06 22:36:42,783 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok.i [2023-11-06 22:36:42,792 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:36:42,803 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:36:42,803 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 22:36:42,803 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:36:42,960 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:36:43,004 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 258 transitions, 530 flow [2023-11-06 22:36:43,122 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2023-11-06 22:36:43,122 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:36:43,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 265 conditions, 256 events. 15/256 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 7. Compared 477 event pairs, 0 based on Foata normal form. 0/229 useless extension candidates. Maximal degree in co-relation 175. Up to 3 conditions per place. [2023-11-06 22:36:43,132 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 258 transitions, 530 flow [2023-11-06 22:36:43,140 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 246 transitions, 501 flow [2023-11-06 22:36:43,144 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:36:43,166 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 246 transitions, 501 flow [2023-11-06 22:36:43,169 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 246 transitions, 501 flow [2023-11-06 22:36:43,170 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 246 transitions, 501 flow [2023-11-06 22:36:43,275 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-11-06 22:36:43,276 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:36:43,282 INFO L83 FinitePrefix]: Finished finitePrefix Result has 254 conditions, 246 events. 15/246 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 393 event pairs, 0 based on Foata normal form. 0/219 useless extension candidates. Maximal degree in co-relation 175. Up to 3 conditions per place. [2023-11-06 22:36:43,294 INFO L119 LiptonReduction]: Number of co-enabled transitions 15300 [2023-11-06 22:36:51,458 INFO L134 LiptonReduction]: Checked pairs total: 32311 [2023-11-06 22:36:51,459 INFO L136 LiptonReduction]: Total number of compositions: 241 [2023-11-06 22:36:51,474 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:36:51,480 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;@36090d44, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:36:51,481 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-06 22:36:51,486 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:36:51,486 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-06 22:36:51,487 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:36:51,487 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:51,488 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:51,488 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:51,494 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:51,494 INFO L85 PathProgramCache]: Analyzing trace with hash 665727335, now seen corresponding path program 1 times [2023-11-06 22:36:51,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:51,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1882073139] [2023-11-06 22:36:51,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:51,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:51,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:52,549 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:36:52,550 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:52,551 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1882073139] [2023-11-06 22:36:52,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1882073139] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:52,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:52,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:36:52,555 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063949190] [2023-11-06 22:36:52,555 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:52,564 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:36:52,571 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:52,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:36:52,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:36:52,948 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 499 [2023-11-06 22:36:52,954 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 58 transitions, 125 flow. Second operand has 5 states, 5 states have (on average 230.4) internal successors, (1152), 5 states have internal predecessors, (1152), 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:36:52,954 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:52,954 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 499 [2023-11-06 22:36:52,955 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:53,489 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-11-06 22:36:53,490 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-06 22:36:53,494 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4982 conditions, 2487 events. 1510/2487 cut-off events. For 75/75 co-relation queries the response was YES. Maximal size of possible extension queue 104. Compared 12471 event pairs, 1101 based on Foata normal form. 0/1781 useless extension candidates. Maximal degree in co-relation 4762. Up to 2421 conditions per place. [2023-11-06 22:36:53,511 INFO L140 encePairwiseOnDemand]: 491/499 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-11-06 22:36:53,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 275 flow [2023-11-06 22:36:53,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:36:53,515 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:36:53,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1439 transitions. [2023-11-06 22:36:53,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48062792251169006 [2023-11-06 22:36:53,535 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1439 transitions. [2023-11-06 22:36:53,536 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1439 transitions. [2023-11-06 22:36:53,539 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:53,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1439 transitions. [2023-11-06 22:36:53,550 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 239.83333333333334) internal successors, (1439), 6 states have internal predecessors, (1439), 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:36:53,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:53,564 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:53,566 INFO L175 Difference]: Start difference. First operand has 58 places, 58 transitions, 125 flow. Second operand 6 states and 1439 transitions. [2023-11-06 22:36:53,567 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 275 flow [2023-11-06 22:36:53,572 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 70 transitions, 270 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:36:53,575 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 180 flow [2023-11-06 22:36:53,577 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=55, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=180, PETRI_PLACES=64, PETRI_TRANSITIONS=66} [2023-11-06 22:36:53,581 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-06 22:36:53,582 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 180 flow [2023-11-06 22:36:53,583 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 230.4) internal successors, (1152), 5 states have internal predecessors, (1152), 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:36:53,583 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:53,583 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:53,584 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:36:53,584 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:53,585 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:53,585 INFO L85 PathProgramCache]: Analyzing trace with hash -837658795, now seen corresponding path program 1 times [2023-11-06 22:36:53,585 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:53,585 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1803766441] [2023-11-06 22:36:53,586 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:53,586 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:53,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:54,004 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:36:54,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:54,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1803766441] [2023-11-06 22:36:54,005 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1803766441] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:54,005 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:54,005 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:36:54,005 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1619344217] [2023-11-06 22:36:54,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:54,007 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:36:54,007 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:54,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:36:54,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:36:54,403 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 499 [2023-11-06 22:36:54,406 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 226.33333333333334) internal successors, (1358), 6 states have internal predecessors, (1358), 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:36:54,406 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:54,406 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 499 [2023-11-06 22:36:54,406 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:55,121 INFO L124 PetriNetUnfolderBase]: 1996/3328 cut-off events. [2023-11-06 22:36:55,122 INFO L125 PetriNetUnfolderBase]: For 161/161 co-relation queries the response was YES. [2023-11-06 22:36:55,130 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7044 conditions, 3328 events. 1996/3328 cut-off events. For 161/161 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 18275 event pairs, 376 based on Foata normal form. 0/2570 useless extension candidates. Maximal degree in co-relation 5965. Up to 2493 conditions per place. [2023-11-06 22:36:55,151 INFO L140 encePairwiseOnDemand]: 490/499 looper letters, 121 selfloop transitions, 17 changer transitions 0/145 dead transitions. [2023-11-06 22:36:55,151 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 145 transitions, 633 flow [2023-11-06 22:36:55,152 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:36:55,153 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:36:55,157 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1486 transitions. [2023-11-06 22:36:55,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49632598530394123 [2023-11-06 22:36:55,159 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1486 transitions. [2023-11-06 22:36:55,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1486 transitions. [2023-11-06 22:36:55,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:55,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1486 transitions. [2023-11-06 22:36:55,166 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.66666666666666) internal successors, (1486), 6 states have internal predecessors, (1486), 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:36:55,174 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:55,177 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:55,178 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 180 flow. Second operand 6 states and 1486 transitions. [2023-11-06 22:36:55,180 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 145 transitions, 633 flow [2023-11-06 22:36:55,193 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 145 transitions, 633 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:36:55,197 INFO L231 Difference]: Finished difference. Result has 72 places, 75 transitions, 274 flow [2023-11-06 22:36:55,197 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=180, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=274, PETRI_PLACES=72, PETRI_TRANSITIONS=75} [2023-11-06 22:36:55,198 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2023-11-06 22:36:55,199 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 75 transitions, 274 flow [2023-11-06 22:36:55,201 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.33333333333334) internal successors, (1358), 6 states have internal predecessors, (1358), 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:36:55,201 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:55,202 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:55,208 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:36:55,208 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:55,212 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:55,212 INFO L85 PathProgramCache]: Analyzing trace with hash -836966875, now seen corresponding path program 2 times [2023-11-06 22:36:55,212 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:55,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [541875131] [2023-11-06 22:36:55,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:55,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:55,251 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:55,588 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:36:55,588 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:55,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [541875131] [2023-11-06 22:36:55,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [541875131] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:55,590 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:55,591 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:36:55,591 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1879725804] [2023-11-06 22:36:55,591 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:55,592 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:36:55,596 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:55,596 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:36:55,597 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:36:55,897 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 499 [2023-11-06 22:36:55,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 75 transitions, 274 flow. Second operand has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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:36:55,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:55,900 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 499 [2023-11-06 22:36:55,900 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:56,577 INFO L124 PetriNetUnfolderBase]: 2136/3567 cut-off events. [2023-11-06 22:36:56,578 INFO L125 PetriNetUnfolderBase]: For 798/798 co-relation queries the response was YES. [2023-11-06 22:36:56,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8326 conditions, 3567 events. 2136/3567 cut-off events. For 798/798 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 19783 event pairs, 402 based on Foata normal form. 0/2776 useless extension candidates. Maximal degree in co-relation 7236. Up to 2526 conditions per place. [2023-11-06 22:36:56,611 INFO L140 encePairwiseOnDemand]: 491/499 looper letters, 110 selfloop transitions, 19 changer transitions 0/136 dead transitions. [2023-11-06 22:36:56,611 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 136 transitions, 682 flow [2023-11-06 22:36:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:36:56,612 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:36:56,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2023-11-06 22:36:56,616 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5002004008016032 [2023-11-06 22:36:56,617 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2023-11-06 22:36:56,617 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2023-11-06 22:36:56,618 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:56,618 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2023-11-06 22:36:56,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 249.6) internal successors, (1248), 5 states have internal predecessors, (1248), 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:36:56,629 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 499.0) internal successors, (2994), 6 states have internal predecessors, (2994), 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:36:56,631 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 499.0) internal successors, (2994), 6 states have internal predecessors, (2994), 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:36:56,631 INFO L175 Difference]: Start difference. First operand has 72 places, 75 transitions, 274 flow. Second operand 5 states and 1248 transitions. [2023-11-06 22:36:56,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 136 transitions, 682 flow [2023-11-06 22:36:56,646 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 136 transitions, 662 flow, removed 10 selfloop flow, removed 0 redundant places. [2023-11-06 22:36:56,649 INFO L231 Difference]: Finished difference. Result has 77 places, 82 transitions, 346 flow [2023-11-06 22:36:56,649 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=260, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=346, PETRI_PLACES=77, PETRI_TRANSITIONS=82} [2023-11-06 22:36:56,650 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 19 predicate places. [2023-11-06 22:36:56,650 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 82 transitions, 346 flow [2023-11-06 22:36:56,652 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.33333333333334) internal successors, (1364), 6 states have internal predecessors, (1364), 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:36:56,652 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:56,652 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:56,652 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:36:56,653 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting t2Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:56,653 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:56,653 INFO L85 PathProgramCache]: Analyzing trace with hash 548683948, now seen corresponding path program 1 times [2023-11-06 22:36:56,653 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:56,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1239434897] [2023-11-06 22:36:56,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:56,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:56,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:56,735 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:36:56,736 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:56,736 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1239434897] [2023-11-06 22:36:56,737 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1239434897] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:56,737 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:56,737 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:36:56,738 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [248636828] [2023-11-06 22:36:56,738 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:56,738 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:36:56,738 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:56,740 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:36:56,740 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:36:56,766 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 499 [2023-11-06 22:36:56,768 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 82 transitions, 346 flow. Second operand has 4 states, 4 states have (on average 239.25) internal successors, (957), 4 states have internal predecessors, (957), 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:36:56,768 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:56,768 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 499 [2023-11-06 22:36:56,768 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:57,717 INFO L124 PetriNetUnfolderBase]: 3509/5806 cut-off events. [2023-11-06 22:36:57,717 INFO L125 PetriNetUnfolderBase]: For 2393/2433 co-relation queries the response was YES. [2023-11-06 22:36:57,734 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13652 conditions, 5806 events. 3509/5806 cut-off events. For 2393/2433 co-relation queries the response was YES. Maximal size of possible extension queue 237. Compared 35443 event pairs, 1596 based on Foata normal form. 40/4443 useless extension candidates. Maximal degree in co-relation 12124. Up to 3407 conditions per place. [2023-11-06 22:36:57,780 INFO L140 encePairwiseOnDemand]: 492/499 looper letters, 151 selfloop transitions, 4 changer transitions 0/165 dead transitions. [2023-11-06 22:36:57,780 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 165 transitions, 978 flow [2023-11-06 22:36:57,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:36:57,781 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:36:57,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1065 transitions. [2023-11-06 22:36:57,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335671342685371 [2023-11-06 22:36:57,785 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1065 transitions. [2023-11-06 22:36:57,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1065 transitions. [2023-11-06 22:36:57,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:57,787 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1065 transitions. [2023-11-06 22:36:57,790 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 266.25) internal successors, (1065), 4 states have internal predecessors, (1065), 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:36:57,796 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 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:36:57,797 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 499.0) internal successors, (2495), 5 states have internal predecessors, (2495), 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:36:57,798 INFO L175 Difference]: Start difference. First operand has 77 places, 82 transitions, 346 flow. Second operand 4 states and 1065 transitions. [2023-11-06 22:36:57,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 165 transitions, 978 flow [2023-11-06 22:36:57,810 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 80 places, 165 transitions, 948 flow, removed 15 selfloop flow, removed 0 redundant places. [2023-11-06 22:36:57,814 INFO L231 Difference]: Finished difference. Result has 82 places, 85 transitions, 368 flow [2023-11-06 22:36:57,815 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=336, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=368, PETRI_PLACES=82, PETRI_TRANSITIONS=85} [2023-11-06 22:36:57,817 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 24 predicate places. [2023-11-06 22:36:57,817 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 85 transitions, 368 flow [2023-11-06 22:36:57,818 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 239.25) internal successors, (957), 4 states have internal predecessors, (957), 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:36:57,818 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:57,818 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:57,818 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:36:57,819 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:57,819 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:57,819 INFO L85 PathProgramCache]: Analyzing trace with hash -1474196742, now seen corresponding path program 1 times [2023-11-06 22:36:57,820 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:57,820 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [443242219] [2023-11-06 22:36:57,820 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:57,820 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:57,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:58,143 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:36:58,144 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:58,144 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [443242219] [2023-11-06 22:36:58,144 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [443242219] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:58,145 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:58,149 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:36:58,149 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [523309792] [2023-11-06 22:36:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:58,150 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:36:58,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:58,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:36:58,151 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:36:58,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 499 [2023-11-06 22:36:58,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 85 transitions, 368 flow. Second operand has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 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:36:58,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:36:58,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 499 [2023-11-06 22:36:58,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:36:59,365 INFO L124 PetriNetUnfolderBase]: 3550/5946 cut-off events. [2023-11-06 22:36:59,365 INFO L125 PetriNetUnfolderBase]: For 2536/2548 co-relation queries the response was YES. [2023-11-06 22:36:59,390 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14421 conditions, 5946 events. 3550/5946 cut-off events. For 2536/2548 co-relation queries the response was YES. Maximal size of possible extension queue 238. Compared 36335 event pairs, 2444 based on Foata normal form. 0/4798 useless extension candidates. Maximal degree in co-relation 10046. Up to 5706 conditions per place. [2023-11-06 22:36:59,420 INFO L140 encePairwiseOnDemand]: 490/499 looper letters, 76 selfloop transitions, 10 changer transitions 0/93 dead transitions. [2023-11-06 22:36:59,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 93 transitions, 558 flow [2023-11-06 22:36:59,421 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:36:59,421 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:36:59,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1443 transitions. [2023-11-06 22:36:59,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4819639278557114 [2023-11-06 22:36:59,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1443 transitions. [2023-11-06 22:36:59,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1443 transitions. [2023-11-06 22:36:59,429 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:36:59,429 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1443 transitions. [2023-11-06 22:36:59,433 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 240.5) internal successors, (1443), 6 states have internal predecessors, (1443), 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:36:59,440 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:59,443 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:36:59,444 INFO L175 Difference]: Start difference. First operand has 82 places, 85 transitions, 368 flow. Second operand 6 states and 1443 transitions. [2023-11-06 22:36:59,444 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 93 transitions, 558 flow [2023-11-06 22:36:59,455 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 93 transitions, 556 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:36:59,457 INFO L231 Difference]: Finished difference. Result has 87 places, 87 transitions, 406 flow [2023-11-06 22:36:59,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=366, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=8, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=75, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=406, PETRI_PLACES=87, PETRI_TRANSITIONS=87} [2023-11-06 22:36:59,461 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 29 predicate places. [2023-11-06 22:36:59,461 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 87 transitions, 406 flow [2023-11-06 22:36:59,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 231.0) internal successors, (1155), 5 states have internal predecessors, (1155), 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:36:59,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:36:59,462 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:36:59,462 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:36:59,463 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:36:59,463 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:36:59,463 INFO L85 PathProgramCache]: Analyzing trace with hash -931432907, now seen corresponding path program 1 times [2023-11-06 22:36:59,463 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:36:59,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1217189760] [2023-11-06 22:36:59,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:36:59,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:36:59,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:36:59,934 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:36:59,934 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:36:59,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1217189760] [2023-11-06 22:36:59,935 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1217189760] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:36:59,935 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:36:59,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:36:59,941 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2138785630] [2023-11-06 22:36:59,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:36:59,942 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:36:59,942 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:36:59,943 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:36:59,944 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:00,319 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 224 out of 499 [2023-11-06 22:37:00,322 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 87 transitions, 406 flow. Second operand has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 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:37:00,322 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:00,322 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 224 of 499 [2023-11-06 22:37:00,322 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:01,474 INFO L124 PetriNetUnfolderBase]: 3833/6332 cut-off events. [2023-11-06 22:37:01,474 INFO L125 PetriNetUnfolderBase]: For 1882/1926 co-relation queries the response was YES. [2023-11-06 22:37:01,501 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15626 conditions, 6332 events. 3833/6332 cut-off events. For 1882/1926 co-relation queries the response was YES. Maximal size of possible extension queue 242. Compared 38547 event pairs, 610 based on Foata normal form. 94/5417 useless extension candidates. Maximal degree in co-relation 12222. Up to 4662 conditions per place. [2023-11-06 22:37:01,530 INFO L140 encePairwiseOnDemand]: 489/499 looper letters, 142 selfloop transitions, 20 changer transitions 0/169 dead transitions. [2023-11-06 22:37:01,530 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 169 transitions, 973 flow [2023-11-06 22:37:01,531 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:01,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:37:01,535 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1484 transitions. [2023-11-06 22:37:01,536 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4956579826319305 [2023-11-06 22:37:01,537 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1484 transitions. [2023-11-06 22:37:01,537 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1484 transitions. [2023-11-06 22:37:01,538 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:01,538 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1484 transitions. [2023-11-06 22:37:01,543 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.33333333333334) internal successors, (1484), 6 states have internal predecessors, (1484), 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:37:01,551 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:01,553 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:01,553 INFO L175 Difference]: Start difference. First operand has 87 places, 87 transitions, 406 flow. Second operand 6 states and 1484 transitions. [2023-11-06 22:37:01,554 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 169 transitions, 973 flow [2023-11-06 22:37:01,588 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 169 transitions, 957 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:37:01,591 INFO L231 Difference]: Finished difference. Result has 89 places, 89 transitions, 458 flow [2023-11-06 22:37:01,592 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=390, PETRI_DIFFERENCE_MINUEND_PLACES=83, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=458, PETRI_PLACES=89, PETRI_TRANSITIONS=89} [2023-11-06 22:37:01,593 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 31 predicate places. [2023-11-06 22:37:01,593 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 89 transitions, 458 flow [2023-11-06 22:37:01,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 225.83333333333334) internal successors, (1355), 6 states have internal predecessors, (1355), 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:37:01,594 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:01,594 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:01,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:37:01,595 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:01,595 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:01,595 INFO L85 PathProgramCache]: Analyzing trace with hash -995547143, now seen corresponding path program 1 times [2023-11-06 22:37:01,595 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:01,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1963502771] [2023-11-06 22:37:01,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:01,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:01,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:01,652 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:37:01,653 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:01,653 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1963502771] [2023-11-06 22:37:01,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1963502771] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:01,653 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:01,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:37:01,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1994167391] [2023-11-06 22:37:01,654 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:01,654 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:37:01,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:01,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:37:01,655 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:37:01,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 499 [2023-11-06 22:37:01,664 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 89 places, 89 transitions, 458 flow. Second operand has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:37:01,665 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:01,665 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 499 [2023-11-06 22:37:01,665 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:01,922 INFO L124 PetriNetUnfolderBase]: 704/1391 cut-off events. [2023-11-06 22:37:01,922 INFO L125 PetriNetUnfolderBase]: For 576/576 co-relation queries the response was YES. [2023-11-06 22:37:01,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3415 conditions, 1391 events. 704/1391 cut-off events. For 576/576 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 7820 event pairs, 441 based on Foata normal form. 58/1291 useless extension candidates. Maximal degree in co-relation 3023. Up to 785 conditions per place. [2023-11-06 22:37:01,933 INFO L140 encePairwiseOnDemand]: 495/499 looper letters, 73 selfloop transitions, 2 changer transitions 6/90 dead transitions. [2023-11-06 22:37:01,933 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 579 flow [2023-11-06 22:37:01,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:37:01,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:37:01,938 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-11-06 22:37:01,939 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210420841683366 [2023-11-06 22:37:01,939 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-11-06 22:37:01,939 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-11-06 22:37:01,940 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:01,940 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-11-06 22:37:01,942 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 260.0) internal successors, (780), 3 states have internal predecessors, (780), 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:37:01,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:37:01,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:37:01,948 INFO L175 Difference]: Start difference. First operand has 89 places, 89 transitions, 458 flow. Second operand 3 states and 780 transitions. [2023-11-06 22:37:01,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 579 flow [2023-11-06 22:37:01,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 90 transitions, 553 flow, removed 1 selfloop flow, removed 4 redundant places. [2023-11-06 22:37:01,954 INFO L231 Difference]: Finished difference. Result has 88 places, 79 transitions, 367 flow [2023-11-06 22:37:01,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=365, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=79, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=367, PETRI_PLACES=88, PETRI_TRANSITIONS=79} [2023-11-06 22:37:01,957 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 30 predicate places. [2023-11-06 22:37:01,957 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 79 transitions, 367 flow [2023-11-06 22:37:01,958 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 243.66666666666666) internal successors, (731), 3 states have internal predecessors, (731), 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:37:01,958 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:01,958 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:01,958 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:37:01,958 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:01,959 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:01,959 INFO L85 PathProgramCache]: Analyzing trace with hash -1793280644, now seen corresponding path program 1 times [2023-11-06 22:37:01,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:01,959 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1671417375] [2023-11-06 22:37:01,959 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:01,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:01,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:02,337 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:37:02,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:02,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1671417375] [2023-11-06 22:37:02,337 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1671417375] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:02,337 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:02,338 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:02,338 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381216483] [2023-11-06 22:37:02,338 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:02,338 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:37:02,339 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:02,339 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:02,339 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:02,641 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 499 [2023-11-06 22:37:02,643 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 79 transitions, 367 flow. Second operand has 6 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 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:37:02,643 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:02,643 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 499 [2023-11-06 22:37:02,644 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:03,030 INFO L124 PetriNetUnfolderBase]: 710/1404 cut-off events. [2023-11-06 22:37:03,031 INFO L125 PetriNetUnfolderBase]: For 449/449 co-relation queries the response was YES. [2023-11-06 22:37:03,037 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3452 conditions, 1404 events. 710/1404 cut-off events. For 449/449 co-relation queries the response was YES. Maximal size of possible extension queue 67. Compared 7843 event pairs, 411 based on Foata normal form. 14/1261 useless extension candidates. Maximal degree in co-relation 2497. Up to 804 conditions per place. [2023-11-06 22:37:03,042 INFO L140 encePairwiseOnDemand]: 489/499 looper letters, 94 selfloop transitions, 15 changer transitions 0/115 dead transitions. [2023-11-06 22:37:03,043 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 115 transitions, 686 flow [2023-11-06 22:37:03,043 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:03,043 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:37:03,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1452 transitions. [2023-11-06 22:37:03,053 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4849699398797595 [2023-11-06 22:37:03,053 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1452 transitions. [2023-11-06 22:37:03,053 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1452 transitions. [2023-11-06 22:37:03,054 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:03,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1452 transitions. [2023-11-06 22:37:03,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 242.0) internal successors, (1452), 6 states have internal predecessors, (1452), 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:37:03,065 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:03,067 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:03,067 INFO L175 Difference]: Start difference. First operand has 88 places, 79 transitions, 367 flow. Second operand 6 states and 1452 transitions. [2023-11-06 22:37:03,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 115 transitions, 686 flow [2023-11-06 22:37:03,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 115 transitions, 682 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:37:03,073 INFO L231 Difference]: Finished difference. Result has 91 places, 80 transitions, 415 flow [2023-11-06 22:37:03,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=363, PETRI_DIFFERENCE_MINUEND_PLACES=85, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=415, PETRI_PLACES=91, PETRI_TRANSITIONS=80} [2023-11-06 22:37:03,077 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 33 predicate places. [2023-11-06 22:37:03,077 INFO L495 AbstractCegarLoop]: Abstraction has has 91 places, 80 transitions, 415 flow [2023-11-06 22:37:03,078 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 227.83333333333334) internal successors, (1367), 6 states have internal predecessors, (1367), 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:37:03,078 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:03,078 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:03,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:37:03,079 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:03,079 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:03,079 INFO L85 PathProgramCache]: Analyzing trace with hash 1544542564, now seen corresponding path program 2 times [2023-11-06 22:37:03,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:03,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826116508] [2023-11-06 22:37:03,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:03,080 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:03,099 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:03,356 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:37:03,357 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:03,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826116508] [2023-11-06 22:37:03,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826116508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:03,357 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:03,358 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:03,358 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2146780103] [2023-11-06 22:37:03,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:03,359 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:37:03,359 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:03,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:03,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:03,587 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 499 [2023-11-06 22:37:03,589 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 91 places, 80 transitions, 415 flow. Second operand has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 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:37:03,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:03,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 499 [2023-11-06 22:37:03,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:03,938 INFO L124 PetriNetUnfolderBase]: 734/1445 cut-off events. [2023-11-06 22:37:03,939 INFO L125 PetriNetUnfolderBase]: For 738/738 co-relation queries the response was YES. [2023-11-06 22:37:03,944 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3670 conditions, 1445 events. 734/1445 cut-off events. For 738/738 co-relation queries the response was YES. Maximal size of possible extension queue 68. Compared 8082 event pairs, 231 based on Foata normal form. 14/1306 useless extension candidates. Maximal degree in co-relation 2943. Up to 792 conditions per place. [2023-11-06 22:37:03,950 INFO L140 encePairwiseOnDemand]: 490/499 looper letters, 96 selfloop transitions, 14 changer transitions 0/116 dead transitions. [2023-11-06 22:37:03,950 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 116 transitions, 738 flow [2023-11-06 22:37:03,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:03,951 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:37:03,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1446 transitions. [2023-11-06 22:37:03,957 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48296593186372744 [2023-11-06 22:37:03,957 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1446 transitions. [2023-11-06 22:37:03,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1446 transitions. [2023-11-06 22:37:03,958 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:03,959 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1446 transitions. [2023-11-06 22:37:03,971 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 241.0) internal successors, (1446), 6 states have internal predecessors, (1446), 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:37:03,986 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:03,987 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 499.0) internal successors, (3493), 7 states have internal predecessors, (3493), 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:37:03,988 INFO L175 Difference]: Start difference. First operand has 91 places, 80 transitions, 415 flow. Second operand 6 states and 1446 transitions. [2023-11-06 22:37:03,988 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 116 transitions, 738 flow [2023-11-06 22:37:03,994 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 116 transitions, 716 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 22:37:03,996 INFO L231 Difference]: Finished difference. Result has 95 places, 81 transitions, 444 flow [2023-11-06 22:37:03,997 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=395, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=444, PETRI_PLACES=95, PETRI_TRANSITIONS=81} [2023-11-06 22:37:03,999 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-06 22:37:03,999 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 81 transitions, 444 flow [2023-11-06 22:37:04,000 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 226.83333333333334) internal successors, (1361), 6 states have internal predecessors, (1361), 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:37:04,001 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:04,001 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:04,001 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:37:04,002 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:04,003 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:04,004 INFO L85 PathProgramCache]: Analyzing trace with hash 635992631, now seen corresponding path program 1 times [2023-11-06 22:37:04,004 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:04,006 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461002247] [2023-11-06 22:37:04,006 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:04,007 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:04,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:04,060 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:37:04,061 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:04,061 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461002247] [2023-11-06 22:37:04,061 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461002247] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:04,061 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:04,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:37:04,062 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208293109] [2023-11-06 22:37:04,062 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:04,063 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:37:04,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:04,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:37:04,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:37:04,074 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 499 [2023-11-06 22:37:04,075 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 81 transitions, 444 flow. Second operand has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:37:04,076 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:04,076 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 499 [2023-11-06 22:37:04,076 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:04,360 INFO L124 PetriNetUnfolderBase]: 564/1115 cut-off events. [2023-11-06 22:37:04,360 INFO L125 PetriNetUnfolderBase]: For 720/720 co-relation queries the response was YES. [2023-11-06 22:37:04,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2923 conditions, 1115 events. 564/1115 cut-off events. For 720/720 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 5572 event pairs, 426 based on Foata normal form. 8/997 useless extension candidates. Maximal degree in co-relation 2320. Up to 804 conditions per place. [2023-11-06 22:37:04,371 INFO L140 encePairwiseOnDemand]: 494/499 looper letters, 77 selfloop transitions, 2 changer transitions 0/89 dead transitions. [2023-11-06 22:37:04,372 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 89 transitions, 619 flow [2023-11-06 22:37:04,372 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:37:04,372 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:37:04,376 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-11-06 22:37:04,376 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257181028724115 [2023-11-06 22:37:04,377 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-11-06 22:37:04,377 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-11-06 22:37:04,378 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:04,378 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-11-06 22:37:04,380 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 262.3333333333333) internal successors, (787), 3 states have internal predecessors, (787), 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:37:04,384 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:37:04,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:37:04,385 INFO L175 Difference]: Start difference. First operand has 95 places, 81 transitions, 444 flow. Second operand 3 states and 787 transitions. [2023-11-06 22:37:04,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 89 transitions, 619 flow [2023-11-06 22:37:04,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 89 transitions, 588 flow, removed 6 selfloop flow, removed 4 redundant places. [2023-11-06 22:37:04,393 INFO L231 Difference]: Finished difference. Result has 94 places, 81 transitions, 419 flow [2023-11-06 22:37:04,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=78, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=419, PETRI_PLACES=94, PETRI_TRANSITIONS=81} [2023-11-06 22:37:04,396 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 36 predicate places. [2023-11-06 22:37:04,396 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 81 transitions, 419 flow [2023-11-06 22:37:04,396 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 244.66666666666666) internal successors, (734), 3 states have internal predecessors, (734), 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:37:04,397 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:04,397 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:04,397 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:37:04,397 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:04,398 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:04,398 INFO L85 PathProgramCache]: Analyzing trace with hash 1757219408, now seen corresponding path program 1 times [2023-11-06 22:37:04,398 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:04,398 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050238643] [2023-11-06 22:37:04,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:04,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:04,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:04,962 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:04,963 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050238643] [2023-11-06 22:37:04,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050238643] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:04,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [221660823] [2023-11-06 22:37:04,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:04,964 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:04,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:04,969 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:05,000 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:37:05,118 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:05,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:37:05,128 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:05,345 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:37:05,417 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 25 treesize of output 13 [2023-11-06 22:37:05,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:05,450 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 18 treesize of output 13 [2023-11-06 22:37:05,532 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-06 22:37:05,532 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-11-06 22:37:05,598 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:05,598 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:05,961 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:05,962 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 40 treesize of output 46 [2023-11-06 22:37:05,983 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:05,984 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 56 treesize of output 60 [2023-11-06 22:37:05,996 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 28 treesize of output 24 [2023-11-06 22:37:06,029 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 10 treesize of output 6 [2023-11-06 22:37:06,040 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:06,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 44 [2023-11-06 22:37:06,182 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:06,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [221660823] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:06,182 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:06,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-06 22:37:06,183 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1183882286] [2023-11-06 22:37:06,183 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:06,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:37:06,184 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:06,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:37:06,185 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=515, Unknown=4, NotChecked=0, Total=650 [2023-11-06 22:37:09,700 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 [0] [2023-11-06 22:37:10,395 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:37:10,400 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 94 places, 81 transitions, 419 flow. Second operand has 26 states, 26 states have (on average 190.73076923076923) internal successors, (4959), 26 states have internal predecessors, (4959), 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:37:10,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:10,401 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:37:10,401 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:11,757 INFO L124 PetriNetUnfolderBase]: 1063/2079 cut-off events. [2023-11-06 22:37:11,757 INFO L125 PetriNetUnfolderBase]: For 772/772 co-relation queries the response was YES. [2023-11-06 22:37:11,770 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5156 conditions, 2079 events. 1063/2079 cut-off events. For 772/772 co-relation queries the response was YES. Maximal size of possible extension queue 95. Compared 12364 event pairs, 362 based on Foata normal form. 0/1843 useless extension candidates. Maximal degree in co-relation 3994. Up to 665 conditions per place. [2023-11-06 22:37:11,782 INFO L140 encePairwiseOnDemand]: 487/499 looper letters, 121 selfloop transitions, 44 changer transitions 0/171 dead transitions. [2023-11-06 22:37:11,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 171 transitions, 1048 flow [2023-11-06 22:37:11,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:37:11,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:37:11,791 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2214 transitions. [2023-11-06 22:37:11,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40335215886318093 [2023-11-06 22:37:11,793 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2214 transitions. [2023-11-06 22:37:11,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2214 transitions. [2023-11-06 22:37:11,796 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:11,796 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2214 transitions. [2023-11-06 22:37:11,802 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 201.27272727272728) internal successors, (2214), 11 states have internal predecessors, (2214), 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:37:11,814 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 499.0) internal successors, (5988), 12 states have internal predecessors, (5988), 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:37:11,816 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 499.0) internal successors, (5988), 12 states have internal predecessors, (5988), 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:37:11,817 INFO L175 Difference]: Start difference. First operand has 94 places, 81 transitions, 419 flow. Second operand 11 states and 2214 transitions. [2023-11-06 22:37:11,817 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 171 transitions, 1048 flow [2023-11-06 22:37:11,823 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 103 places, 171 transitions, 1044 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:37:11,827 INFO L231 Difference]: Finished difference. Result has 105 places, 99 transitions, 623 flow [2023-11-06 22:37:11,827 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=417, PETRI_DIFFERENCE_MINUEND_PLACES=93, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=623, PETRI_PLACES=105, PETRI_TRANSITIONS=99} [2023-11-06 22:37:11,828 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 47 predicate places. [2023-11-06 22:37:11,828 INFO L495 AbstractCegarLoop]: Abstraction has has 105 places, 99 transitions, 623 flow [2023-11-06 22:37:11,830 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 26 states have (on average 190.73076923076923) internal successors, (4959), 26 states have internal predecessors, (4959), 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:37:11,830 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:11,831 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:11,845 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:12,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:37:12,038 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:12,038 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:12,038 INFO L85 PathProgramCache]: Analyzing trace with hash 1757219439, now seen corresponding path program 1 times [2023-11-06 22:37:12,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:12,039 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1612321332] [2023-11-06 22:37:12,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:12,086 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:12,975 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:12,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1612321332] [2023-11-06 22:37:12,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1612321332] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:12,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1776551759] [2023-11-06 22:37:12,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:12,977 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:12,977 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:12,978 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:12,991 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:37:13,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:13,146 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-06 22:37:13,151 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:13,188 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:13,189 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:13,191 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:37:13,213 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:37:13,213 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2023-11-06 22:37:13,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:13,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-06 22:37:13,230 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:13,235 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:37:13,474 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 44 [2023-11-06 22:37:13,718 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 55 [2023-11-06 22:37:14,062 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 106 [2023-11-06 22:37:14,241 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:14,243 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 240 treesize of output 199 [2023-11-06 22:37:14,536 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 258 treesize of output 215 [2023-11-06 22:37:14,930 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:14,930 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:16,016 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_310 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_58| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_70| Int) (v_ArrVal_309 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49| Int) (v_ArrVal_306 Int)) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_306)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_70| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_58| 1))) |c_~#stored_elements~0.base| v_ArrVal_309) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_58|) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_70|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_49|) |c_~#queue~0.offset|) v_ArrVal_310) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-06 22:37:16,645 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 22:37:16,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1776551759] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:16,645 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:16,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-06 22:37:16,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1886999259] [2023-11-06 22:37:16,646 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:16,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 22:37:16,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:16,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:37:16,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=203, Invalid=696, Unknown=35, NotChecked=58, Total=992 [2023-11-06 22:37:17,260 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 499 [2023-11-06 22:37:17,268 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 105 places, 99 transitions, 623 flow. Second operand has 32 states, 32 states have (on average 189.40625) internal successors, (6061), 32 states have internal predecessors, (6061), 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:37:17,268 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:17,268 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 499 [2023-11-06 22:37:17,269 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:21,264 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 [0, 1] [2023-11-06 22:37:23,301 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 [0, 1] [2023-11-06 22:37:25,304 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 [0, 1] [2023-11-06 22:37:32,749 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:37:34,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.64s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:37:35,405 INFO L124 PetriNetUnfolderBase]: 1087/2108 cut-off events. [2023-11-06 22:37:35,406 INFO L125 PetriNetUnfolderBase]: For 1422/1422 co-relation queries the response was YES. [2023-11-06 22:37:35,418 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5722 conditions, 2108 events. 1087/2108 cut-off events. For 1422/1422 co-relation queries the response was YES. Maximal size of possible extension queue 100. Compared 12471 event pairs, 842 based on Foata normal form. 0/1877 useless extension candidates. Maximal degree in co-relation 4540. Up to 1927 conditions per place. [2023-11-06 22:37:35,428 INFO L140 encePairwiseOnDemand]: 483/499 looper letters, 89 selfloop transitions, 54 changer transitions 1/150 dead transitions. [2023-11-06 22:37:35,429 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 126 places, 150 transitions, 1192 flow [2023-11-06 22:37:35,429 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:37:35,429 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-06 22:37:35,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4251 transitions. [2023-11-06 22:37:35,446 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3872290034614684 [2023-11-06 22:37:35,446 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4251 transitions. [2023-11-06 22:37:35,446 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4251 transitions. [2023-11-06 22:37:35,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:35,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4251 transitions. [2023-11-06 22:37:35,460 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 193.22727272727272) internal successors, (4251), 22 states have internal predecessors, (4251), 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:37:35,482 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 499.0) internal successors, (11477), 23 states have internal predecessors, (11477), 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:37:35,485 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 499.0) internal successors, (11477), 23 states have internal predecessors, (11477), 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:37:35,486 INFO L175 Difference]: Start difference. First operand has 105 places, 99 transitions, 623 flow. Second operand 22 states and 4251 transitions. [2023-11-06 22:37:35,486 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 126 places, 150 transitions, 1192 flow [2023-11-06 22:37:35,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 122 places, 150 transitions, 1162 flow, removed 10 selfloop flow, removed 4 redundant places. [2023-11-06 22:37:35,501 INFO L231 Difference]: Finished difference. Result has 127 places, 132 transitions, 974 flow [2023-11-06 22:37:35,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=599, PETRI_DIFFERENCE_MINUEND_PLACES=101, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=99, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=31, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=974, PETRI_PLACES=127, PETRI_TRANSITIONS=132} [2023-11-06 22:37:35,502 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 69 predicate places. [2023-11-06 22:37:35,502 INFO L495 AbstractCegarLoop]: Abstraction has has 127 places, 132 transitions, 974 flow [2023-11-06 22:37:35,504 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 32 states have (on average 189.40625) internal successors, (6061), 32 states have internal predecessors, (6061), 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:37:35,504 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:35,504 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:35,512 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:35,710 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:37:35,711 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:35,712 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:35,712 INFO L85 PathProgramCache]: Analyzing trace with hash 650863197, now seen corresponding path program 1 times [2023-11-06 22:37:35,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:35,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2079817679] [2023-11-06 22:37:35,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:35,713 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:35,741 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:36,504 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:36,505 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2079817679] [2023-11-06 22:37:36,505 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2079817679] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:36,505 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [535186652] [2023-11-06 22:37:36,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,505 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:36,506 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:36,509 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:36,525 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:37:36,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:36,655 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:37:36,659 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:36,680 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,682 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:37:36,707 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:37:36,708 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-06 22:37:36,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:37:36,736 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,739 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,740 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:36,741 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:37:36,742 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:37:36,832 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 39 treesize of output 28 [2023-11-06 22:37:36,961 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 44 [2023-11-06 22:37:37,109 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 55 [2023-11-06 22:37:37,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 106 [2023-11-06 22:37:37,490 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:37,491 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 240 treesize of output 199 [2023-11-06 22:37:37,727 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 258 treesize of output 215 [2023-11-06 22:37:38,121 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:37:38,122 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:38,473 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|)))) is different from false [2023-11-06 22:37:38,524 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_378 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|))))) is different from false [2023-11-06 22:37:39,421 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77| Int) (v_ArrVal_378 Int) (v_ArrVal_373 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_377 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_373)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_377) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_378) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77|))))) is different from false [2023-11-06 22:37:40,784 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-06 22:37:40,784 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [535186652] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:40,785 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:40,785 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-11-06 22:37:40,785 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49619417] [2023-11-06 22:37:40,785 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:40,786 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:37:40,787 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:40,787 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:37:40,788 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=216, Invalid=761, Unknown=27, NotChecked=186, Total=1190 [2023-11-06 22:37:41,368 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:37:41,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 127 places, 132 transitions, 974 flow. Second operand has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:37:41,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:41,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:37:41,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:45,893 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:37:49,298 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:37:52,915 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 [0, 1] [2023-11-06 22:37:54,938 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 [0, 1] [2023-11-06 22:37:56,951 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 [0, 1] [2023-11-06 22:37:59,724 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:01,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.51s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:03,765 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.31s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:03,868 INFO L124 PetriNetUnfolderBase]: 1563/3033 cut-off events. [2023-11-06 22:38:03,868 INFO L125 PetriNetUnfolderBase]: For 2148/2148 co-relation queries the response was YES. [2023-11-06 22:38:03,887 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8299 conditions, 3033 events. 1563/3033 cut-off events. For 2148/2148 co-relation queries the response was YES. Maximal size of possible extension queue 123. Compared 18896 event pairs, 483 based on Foata normal form. 14/2754 useless extension candidates. Maximal degree in co-relation 8154. Up to 1669 conditions per place. [2023-11-06 22:38:03,902 INFO L140 encePairwiseOnDemand]: 477/499 looper letters, 186 selfloop transitions, 91 changer transitions 3/286 dead transitions. [2023-11-06 22:38:03,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 151 places, 286 transitions, 2048 flow [2023-11-06 22:38:03,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:38:03,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-06 22:38:03,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4800 transitions. [2023-11-06 22:38:03,920 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3847695390781563 [2023-11-06 22:38:03,920 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4800 transitions. [2023-11-06 22:38:03,920 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4800 transitions. [2023-11-06 22:38:03,924 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:03,924 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4800 transitions. [2023-11-06 22:38:03,936 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 192.0) internal successors, (4800), 25 states have internal predecessors, (4800), 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:38:03,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 499.0) internal successors, (12974), 26 states have internal predecessors, (12974), 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:38:03,963 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 499.0) internal successors, (12974), 26 states have internal predecessors, (12974), 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:38:03,964 INFO L175 Difference]: Start difference. First operand has 127 places, 132 transitions, 974 flow. Second operand 25 states and 4800 transitions. [2023-11-06 22:38:03,964 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 151 places, 286 transitions, 2048 flow [2023-11-06 22:38:03,987 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 145 places, 286 transitions, 1938 flow, removed 43 selfloop flow, removed 6 redundant places. [2023-11-06 22:38:03,993 INFO L231 Difference]: Finished difference. Result has 154 places, 173 transitions, 1393 flow [2023-11-06 22:38:03,994 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=868, PETRI_DIFFERENCE_MINUEND_PLACES=121, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=132, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1393, PETRI_PLACES=154, PETRI_TRANSITIONS=173} [2023-11-06 22:38:03,994 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 96 predicate places. [2023-11-06 22:38:03,995 INFO L495 AbstractCegarLoop]: Abstraction has has 154 places, 173 transitions, 1393 flow [2023-11-06 22:38:03,997 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:38:03,997 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:03,997 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:04,010 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:04,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:38:04,205 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:38:04,205 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:04,205 INFO L85 PathProgramCache]: Analyzing trace with hash 575732308, now seen corresponding path program 1 times [2023-11-06 22:38:04,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:04,206 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [345948553] [2023-11-06 22:38:04,206 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:04,206 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:04,235 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:05,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:05,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [345948553] [2023-11-06 22:38:05,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [345948553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:05,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [344987115] [2023-11-06 22:38:05,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:05,204 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:05,204 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:05,205 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:05,229 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:38:05,362 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:05,364 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:38:05,369 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:05,404 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:38:05,405 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 29 treesize of output 34 [2023-11-06 22:38:05,619 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:38:05,689 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 18 treesize of output 13 [2023-11-06 22:38:05,790 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 25 treesize of output 13 [2023-11-06 22:38:05,861 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:05,861 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 18 treesize of output 13 [2023-11-06 22:38:05,965 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-06 22:38:05,966 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 17 [2023-11-06 22:38:06,034 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:06,034 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:06,500 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_436 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_438 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~mem40#1| Int) (v_ArrVal_439 Int)) (or (< (+ v_ArrVal_439 2147483648) 0) (< 0 (+ (select (store (select (store (let ((.cse0 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_436))) (store .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select .cse0 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1)))) |c_~#stored_elements~0.base| v_ArrVal_438) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_439) (+ 88 |c_~#queue~0.offset|)) 2147483650)))) is different from false [2023-11-06 22:38:06,558 INFO L322 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2023-11-06 22:38:06,558 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 1022 treesize of output 950 [2023-11-06 22:38:06,589 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:38:06,589 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 208 treesize of output 208 [2023-11-06 22:38:06,614 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 423 treesize of output 403 [2023-11-06 22:38:06,647 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 130 treesize of output 114 [2023-11-06 22:38:07,002 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 24 treesize of output 20 [2023-11-06 22:38:07,026 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 550 treesize of output 534 [2023-11-06 22:38:07,058 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:07,059 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,067 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:07,068 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:07,077 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,082 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,085 WARN L207 Elim1Store]: Array PQE input equivalent to true [2023-11-06 22:38:07,099 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:07,100 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,114 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:07,115 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:07,129 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 550 treesize of output 534 [2023-11-06 22:38:07,370 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:07,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [344987115] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:07,370 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:38:07,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 29 [2023-11-06 22:38:07,371 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1483242134] [2023-11-06 22:38:07,371 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:07,371 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-06 22:38:07,372 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:07,372 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:38:07,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=721, Unknown=4, NotChecked=56, Total=930 [2023-11-06 22:38:07,424 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 182 out of 499 [2023-11-06 22:38:07,430 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 154 places, 173 transitions, 1393 flow. Second operand has 31 states, 31 states have (on average 183.5483870967742) internal successors, (5690), 31 states have internal predecessors, (5690), 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:38:07,430 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:07,430 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 182 of 499 [2023-11-06 22:38:07,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:09,666 INFO L124 PetriNetUnfolderBase]: 1892/3744 cut-off events. [2023-11-06 22:38:09,666 INFO L125 PetriNetUnfolderBase]: For 11012/11018 co-relation queries the response was YES. [2023-11-06 22:38:09,690 INFO L83 FinitePrefix]: Finished finitePrefix Result has 14664 conditions, 3744 events. 1892/3744 cut-off events. For 11012/11018 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 24297 event pairs, 526 based on Foata normal form. 18/3425 useless extension candidates. Maximal degree in co-relation 14428. Up to 1486 conditions per place. [2023-11-06 22:38:09,780 INFO L140 encePairwiseOnDemand]: 485/499 looper letters, 200 selfloop transitions, 70 changer transitions 3/279 dead transitions. [2023-11-06 22:38:09,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 166 places, 279 transitions, 2656 flow [2023-11-06 22:38:09,785 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:38:09,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:38:09,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3079 transitions. [2023-11-06 22:38:09,799 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38564629258517036 [2023-11-06 22:38:09,800 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3079 transitions. [2023-11-06 22:38:09,800 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3079 transitions. [2023-11-06 22:38:09,805 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:09,805 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3079 transitions. [2023-11-06 22:38:09,814 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 192.4375) internal successors, (3079), 16 states have internal predecessors, (3079), 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:38:09,827 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 499.0) internal successors, (8483), 17 states have internal predecessors, (8483), 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:38:09,829 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 499.0) internal successors, (8483), 17 states have internal predecessors, (8483), 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:38:09,829 INFO L175 Difference]: Start difference. First operand has 154 places, 173 transitions, 1393 flow. Second operand 16 states and 3079 transitions. [2023-11-06 22:38:09,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 166 places, 279 transitions, 2656 flow [2023-11-06 22:38:09,869 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 158 places, 279 transitions, 2517 flow, removed 34 selfloop flow, removed 8 redundant places. [2023-11-06 22:38:09,875 INFO L231 Difference]: Finished difference. Result has 162 places, 181 transitions, 1496 flow [2023-11-06 22:38:09,876 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=1248, PETRI_DIFFERENCE_MINUEND_PLACES=143, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=172, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=61, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1496, PETRI_PLACES=162, PETRI_TRANSITIONS=181} [2023-11-06 22:38:09,877 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 104 predicate places. [2023-11-06 22:38:09,877 INFO L495 AbstractCegarLoop]: Abstraction has has 162 places, 181 transitions, 1496 flow [2023-11-06 22:38:09,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 183.5483870967742) internal successors, (5690), 31 states have internal predecessors, (5690), 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:38:09,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:09,879 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:09,892 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:10,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:38:10,092 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:38:10,093 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:10,093 INFO L85 PathProgramCache]: Analyzing trace with hash -1361142869, now seen corresponding path program 2 times [2023-11-06 22:38:10,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:10,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [980923406] [2023-11-06 22:38:10,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:10,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:10,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:11,165 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:11,166 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [980923406] [2023-11-06 22:38:11,166 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [980923406] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:11,166 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [733262736] [2023-11-06 22:38:11,166 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:38:11,166 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:11,167 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:11,169 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:11,193 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:38:11,347 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:38:11,348 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:11,350 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:38:11,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:11,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,370 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,371 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:38:11,402 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:38:11,402 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-06 22:38:11,415 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,418 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:38:11,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,430 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:11,431 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:11,432 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:38:11,607 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 46 treesize of output 37 [2023-11-06 22:38:11,793 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 59 treesize of output 48 [2023-11-06 22:38:12,040 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 99 treesize of output 80 [2023-11-06 22:38:12,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:12,179 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 163 treesize of output 132 [2023-11-06 22:38:12,294 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 163 treesize of output 132 [2023-11-06 22:38:12,478 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 181 treesize of output 148 [2023-11-06 22:38:12,782 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:12,782 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:13,123 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_506) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-06 22:38:21,924 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:21,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [733262736] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:21,925 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:38:21,925 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-11-06 22:38:21,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55738703] [2023-11-06 22:38:21,925 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:21,926 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:38:21,926 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:21,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:38:21,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=274, Invalid=807, Unknown=45, NotChecked=64, Total=1190 [2023-11-06 22:38:22,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:38:22,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 162 places, 181 transitions, 1496 flow. Second operand has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:38:22,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:22,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:38:22,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:31,110 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_~#queue~0.offset|)) (.cse1 (+ 88 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_506) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_73| Int)) (or (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_73|) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse6 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_73| 1))) |c_~#stored_elements~0.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_506) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) .cse1) 2147483647) (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))))) (forall ((v_ArrVal_506 (Array Int Int)) (v_ArrVal_505 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse7 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_505) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_506) |c_~#queue~0.base|))) (or (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) .cse1) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|)))) (forall ((v_ArrVal_506 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69| Int) (v_ArrVal_507 Int)) (let ((.cse8 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_506) |c_~#queue~0.base|))) (or (< (select .cse8 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) (< (select (store .cse8 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_69|) |c_~#queue~0.offset|) v_ArrVal_507) .cse1) 2147483647)))))) is different from false [2023-11-06 22:38:32,990 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:35,060 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.96s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:38,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.80s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:40,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.86s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:41,242 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.17s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:43,178 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:44,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:45,855 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.11s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-06 22:38:46,137 INFO L124 PetriNetUnfolderBase]: 2676/5239 cut-off events. [2023-11-06 22:38:46,137 INFO L125 PetriNetUnfolderBase]: For 16622/16642 co-relation queries the response was YES. [2023-11-06 22:38:46,174 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20917 conditions, 5239 events. 2676/5239 cut-off events. For 16622/16642 co-relation queries the response was YES. Maximal size of possible extension queue 203. Compared 36859 event pairs, 756 based on Foata normal form. 18/4755 useless extension candidates. Maximal degree in co-relation 20548. Up to 2345 conditions per place. [2023-11-06 22:38:46,201 INFO L140 encePairwiseOnDemand]: 479/499 looper letters, 254 selfloop transitions, 109 changer transitions 3/372 dead transitions. [2023-11-06 22:38:46,202 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 186 places, 372 transitions, 3742 flow [2023-11-06 22:38:46,202 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:38:46,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-06 22:38:46,210 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4830 transitions. [2023-11-06 22:38:46,212 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3871743486973948 [2023-11-06 22:38:46,213 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4830 transitions. [2023-11-06 22:38:46,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4830 transitions. [2023-11-06 22:38:46,218 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:46,218 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4830 transitions. [2023-11-06 22:38:46,227 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 193.2) internal successors, (4830), 25 states have internal predecessors, (4830), 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:38:46,238 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 26 states, 26 states have (on average 499.0) internal successors, (12974), 26 states have internal predecessors, (12974), 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:38:46,241 INFO L81 ComplementDD]: Finished complementDD. Result has 26 states, 26 states have (on average 499.0) internal successors, (12974), 26 states have internal predecessors, (12974), 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:38:46,241 INFO L175 Difference]: Start difference. First operand has 162 places, 181 transitions, 1496 flow. Second operand 25 states and 4830 transitions. [2023-11-06 22:38:46,242 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 186 places, 372 transitions, 3742 flow [2023-11-06 22:38:46,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 179 places, 372 transitions, 3667 flow, removed 22 selfloop flow, removed 7 redundant places. [2023-11-06 22:38:46,299 INFO L231 Difference]: Finished difference. Result has 186 places, 216 transitions, 2100 flow [2023-11-06 22:38:46,300 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=1435, PETRI_DIFFERENCE_MINUEND_PLACES=155, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=181, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=79, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=81, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=2100, PETRI_PLACES=186, PETRI_TRANSITIONS=216} [2023-11-06 22:38:46,301 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 128 predicate places. [2023-11-06 22:38:46,302 INFO L495 AbstractCegarLoop]: Abstraction has has 186 places, 216 transitions, 2100 flow [2023-11-06 22:38:46,303 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:38:46,303 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:46,304 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:46,314 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:46,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:38:46,510 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:38:46,510 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:46,510 INFO L85 PathProgramCache]: Analyzing trace with hash -1360770869, now seen corresponding path program 3 times [2023-11-06 22:38:46,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:46,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709241871] [2023-11-06 22:38:46,511 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:46,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:46,548 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:47,671 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:47,671 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709241871] [2023-11-06 22:38:47,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709241871] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:47,671 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1919335013] [2023-11-06 22:38:47,671 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:38:47,672 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:47,672 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:47,684 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:47,707 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:38:47,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 22:38:47,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:47,879 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 48 conjunts are in the unsatisfiable core [2023-11-06 22:38:47,883 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:47,901 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:47,902 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:38:47,912 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:47,928 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:38:47,928 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-11-06 22:38:47,941 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:47,942 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:47,946 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:38:47,982 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:38:47,982 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 29 treesize of output 34 [2023-11-06 22:38:48,188 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 44 [2023-11-06 22:38:48,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 55 [2023-11-06 22:38:48,628 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 106 [2023-11-06 22:38:48,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:48,800 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 240 treesize of output 199 [2023-11-06 22:38:49,031 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 258 treesize of output 215 [2023-11-06 22:38:49,402 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 929 treesize of output 784 [2023-11-06 22:38:49,888 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:49,888 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:49,919 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_576 (Array Int Int))) (< (select (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-11-06 22:38:49,988 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-06 22:38:50,080 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_573))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-06 22:38:50,103 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_573))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|))))) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|)))) is different from false [2023-11-06 22:38:50,144 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_573))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|))) (or (< (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|) (< (select .cse1 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|)))))) is different from false [2023-11-06 22:38:50,182 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| Int) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_576 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_573))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (select (store (store .cse1 |c_~#queue~0.base| (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98|)))))) is different from false [2023-11-06 22:38:50,221 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| Int) (v_ArrVal_575 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_573 (Array Int Int)) (v_ArrVal_569 Int) (v_ArrVal_576 (Array Int Int))) (let ((.cse0 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_569)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_573))) (let ((.cse4 (select .cse3 |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98|) (< (select (select (store (store .cse3 |c_~#queue~0.base| (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_575)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_576) |c_~#queue~0.base|) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse4 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|)))))) is different from false [2023-11-06 22:38:50,742 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-06 22:38:50,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1919335013] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:50,743 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:38:50,743 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 33 [2023-11-06 22:38:50,743 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062044609] [2023-11-06 22:38:50,743 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:50,744 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-06 22:38:50,744 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:50,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-06 22:38:50,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=207, Invalid=564, Unknown=13, NotChecked=406, Total=1190 [2023-11-06 22:38:50,753 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:38:50,758 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 186 places, 216 transitions, 2100 flow. Second operand has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:38:50,758 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:50,758 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:38:50,758 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:55,661 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 [0, 1] [2023-11-06 22:38:57,678 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 [0, 1] [2023-11-06 22:39:00,094 INFO L124 PetriNetUnfolderBase]: 2865/5479 cut-off events. [2023-11-06 22:39:00,094 INFO L125 PetriNetUnfolderBase]: For 25794/26150 co-relation queries the response was YES. [2023-11-06 22:39:00,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25193 conditions, 5479 events. 2865/5479 cut-off events. For 25794/26150 co-relation queries the response was YES. Maximal size of possible extension queue 205. Compared 37878 event pairs, 953 based on Foata normal form. 16/4946 useless extension candidates. Maximal degree in co-relation 24869. Up to 3731 conditions per place. [2023-11-06 22:39:00,159 INFO L140 encePairwiseOnDemand]: 477/499 looper letters, 201 selfloop transitions, 133 changer transitions 3/343 dead transitions. [2023-11-06 22:39:00,159 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 207 places, 343 transitions, 4136 flow [2023-11-06 22:39:00,160 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-06 22:39:00,160 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22 states. [2023-11-06 22:39:00,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 4226 transitions. [2023-11-06 22:39:00,167 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3849517216250683 [2023-11-06 22:39:00,167 INFO L72 ComplementDD]: Start complementDD. Operand 22 states and 4226 transitions. [2023-11-06 22:39:00,167 INFO L73 IsDeterministic]: Start isDeterministic. Operand 22 states and 4226 transitions. [2023-11-06 22:39:00,170 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:00,170 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 22 states and 4226 transitions. [2023-11-06 22:39:00,178 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 23 states, 22 states have (on average 192.0909090909091) internal successors, (4226), 22 states have internal predecessors, (4226), 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:39:00,187 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 23 states, 23 states have (on average 499.0) internal successors, (11477), 23 states have internal predecessors, (11477), 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:39:00,189 INFO L81 ComplementDD]: Finished complementDD. Result has 23 states, 23 states have (on average 499.0) internal successors, (11477), 23 states have internal predecessors, (11477), 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:39:00,190 INFO L175 Difference]: Start difference. First operand has 186 places, 216 transitions, 2100 flow. Second operand 22 states and 4226 transitions. [2023-11-06 22:39:00,190 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 207 places, 343 transitions, 4136 flow [2023-11-06 22:39:00,281 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 193 places, 343 transitions, 3893 flow, removed 62 selfloop flow, removed 14 redundant places. [2023-11-06 22:39:00,289 INFO L231 Difference]: Finished difference. Result has 202 places, 265 transitions, 2910 flow [2023-11-06 22:39:00,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=1906, PETRI_DIFFERENCE_MINUEND_PLACES=172, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=215, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=84, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=106, PETRI_DIFFERENCE_SUBTRAHEND_STATES=22, PETRI_FLOW=2910, PETRI_PLACES=202, PETRI_TRANSITIONS=265} [2023-11-06 22:39:00,290 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 144 predicate places. [2023-11-06 22:39:00,290 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 265 transitions, 2910 flow [2023-11-06 22:39:00,291 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 35 states have (on average 184.37142857142857) internal successors, (6453), 35 states have internal predecessors, (6453), 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:39:00,291 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:00,292 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:00,305 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:00,497 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:39:00,498 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:00,498 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:00,498 INFO L85 PathProgramCache]: Analyzing trace with hash -2031248038, now seen corresponding path program 1 times [2023-11-06 22:39:00,498 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:00,498 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1613379446] [2023-11-06 22:39:00,498 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:00,499 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:00,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:01,000 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:01,000 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1613379446] [2023-11-06 22:39:01,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1613379446] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:01,000 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [651049947] [2023-11-06 22:39:01,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:01,001 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:01,001 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:01,002 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:01,025 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:39:01,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:01,165 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 22:39:01,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:01,409 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2023-11-06 22:39:01,449 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:01,450 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 26 treesize of output 19 [2023-11-06 22:39:01,538 INFO L322 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-06 22:39:01,539 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-06 22:39:01,586 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 33 treesize of output 17 [2023-11-06 22:39:01,604 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:01,604 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:01,708 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_632 (Array Int Int)) (v_ArrVal_634 Int)) (< 0 (+ 2147483650 (let ((.cse1 (+ 84 |c_~#queue~0.offset|))) (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_632) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_634)) .cse1))))) is different from false [2023-11-06 22:39:01,820 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:01,821 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 87 treesize of output 51 [2023-11-06 22:39:01,832 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:01,832 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 74 treesize of output 74 [2023-11-06 22:39:01,839 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 36 treesize of output 24 [2023-11-06 22:39:01,861 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 17 treesize of output 9 [2023-11-06 22:39:01,892 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:01,892 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 59 treesize of output 47 [2023-11-06 22:39:01,997 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:01,998 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [651049947] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:01,998 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:01,998 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 8, 8] total 22 [2023-11-06 22:39:01,998 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003565034] [2023-11-06 22:39:01,998 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:01,999 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:39:01,999 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:01,999 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:39:02,000 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=94, Invalid=415, Unknown=1, NotChecked=42, Total=552 [2023-11-06 22:39:02,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 499 [2023-11-06 22:39:02,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 265 transitions, 2910 flow. Second operand has 24 states, 24 states have (on average 195.25) internal successors, (4686), 24 states have internal predecessors, (4686), 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:39:02,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:02,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 499 [2023-11-06 22:39:02,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:05,429 INFO L124 PetriNetUnfolderBase]: 4587/8772 cut-off events. [2023-11-06 22:39:05,429 INFO L125 PetriNetUnfolderBase]: For 118265/119320 co-relation queries the response was YES. [2023-11-06 22:39:05,492 INFO L83 FinitePrefix]: Finished finitePrefix Result has 51804 conditions, 8772 events. 4587/8772 cut-off events. For 118265/119320 co-relation queries the response was YES. Maximal size of possible extension queue 340. Compared 67379 event pairs, 1371 based on Foata normal form. 0/7920 useless extension candidates. Maximal degree in co-relation 51113. Up to 2622 conditions per place. [2023-11-06 22:39:05,546 INFO L140 encePairwiseOnDemand]: 484/499 looper letters, 362 selfloop transitions, 161 changer transitions 0/529 dead transitions. [2023-11-06 22:39:05,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 219 places, 529 transitions, 7180 flow [2023-11-06 22:39:05,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:39:05,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 22:39:05,553 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3685 transitions. [2023-11-06 22:39:05,554 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4102649743932309 [2023-11-06 22:39:05,555 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3685 transitions. [2023-11-06 22:39:05,555 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3685 transitions. [2023-11-06 22:39:05,556 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:05,556 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3685 transitions. [2023-11-06 22:39:05,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 19 states, 18 states have (on average 204.72222222222223) internal successors, (3685), 18 states have internal predecessors, (3685), 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:39:05,570 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 19 states, 19 states have (on average 499.0) internal successors, (9481), 19 states have internal predecessors, (9481), 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:39:05,572 INFO L81 ComplementDD]: Finished complementDD. Result has 19 states, 19 states have (on average 499.0) internal successors, (9481), 19 states have internal predecessors, (9481), 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:39:05,572 INFO L175 Difference]: Start difference. First operand has 202 places, 265 transitions, 2910 flow. Second operand 18 states and 3685 transitions. [2023-11-06 22:39:05,572 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 219 places, 529 transitions, 7180 flow [2023-11-06 22:39:05,767 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 209 places, 529 transitions, 6531 flow, removed 277 selfloop flow, removed 10 redundant places. [2023-11-06 22:39:05,774 INFO L231 Difference]: Finished difference. Result has 213 places, 324 transitions, 3704 flow [2023-11-06 22:39:05,774 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=2631, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=264, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=108, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=152, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=3704, PETRI_PLACES=213, PETRI_TRANSITIONS=324} [2023-11-06 22:39:05,775 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 155 predicate places. [2023-11-06 22:39:05,775 INFO L495 AbstractCegarLoop]: Abstraction has has 213 places, 324 transitions, 3704 flow [2023-11-06 22:39:05,776 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 195.25) internal successors, (4686), 24 states have internal predecessors, (4686), 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:39:05,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:05,776 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:05,785 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 22:39:05,982 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:39:05,982 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:05,983 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,983 INFO L85 PathProgramCache]: Analyzing trace with hash -1882000923, now seen corresponding path program 1 times [2023-11-06 22:39:05,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1231375957] [2023-11-06 22:39:05,984 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:06,012 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,820 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:06,820 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:06,820 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1231375957] [2023-11-06 22:39:06,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1231375957] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:06,821 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [333088988] [2023-11-06 22:39:06,821 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:06,821 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:06,821 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:06,822 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:06,845 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:39:06,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 47 conjunts are in the unsatisfiable core [2023-11-06 22:39:07,007 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:07,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,026 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:39:07,035 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,054 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:39:07,055 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 30 [2023-11-06 22:39:07,068 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,070 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:39:07,091 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:07,096 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:39:07,097 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 29 treesize of output 1 [2023-11-06 22:39:07,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 39 [2023-11-06 22:39:07,370 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 treesize of output 39 [2023-11-06 22:39:07,545 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 63 treesize of output 50 [2023-11-06 22:39:07,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,635 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 87 treesize of output 66 [2023-11-06 22:39:07,794 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 94 treesize of output 71 [2023-11-06 22:39:07,873 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 105 treesize of output 82 [2023-11-06 22:39:08,163 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 350 treesize of output 283 [2023-11-06 22:39:08,531 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:08,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:08,589 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_705) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_706) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) is different from false [2023-11-06 22:39:08,603 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (let ((.cse0 (+ 84 |c_~#queue~0.offset|))) (or (< (select (select |c_#memory_int| |c_~#queue~0.base|) .cse0) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) (< (select (store (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_705) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_706) .cse0) 2147483647)))) is different from false [2023-11-06 22:39:08,978 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_90| Int) (v_ArrVal_704 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89| Int) (v_ArrVal_705 (Array Int Int)) (v_ArrVal_706 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_90| 1))) |c_~#stored_elements~0.base| v_ArrVal_704)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (or (< (select (store (select (store .cse0 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_705) |c_~#queue~0.base|) (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|) |c_~#queue~0.offset|) v_ArrVal_706) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_90|) (< (select (select .cse0 |c_~#queue~0.base|) .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_89|))))) is different from false [2023-11-06 22:39:09,646 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-06 22:39:09,646 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [333088988] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:09,646 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:09,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-11-06 22:39:09,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1840366201] [2023-11-06 22:39:09,647 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:09,647 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:39:09,648 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:09,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:39:09,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=171, Invalid=518, Unknown=25, NotChecked=156, Total=870 [2023-11-06 22:39:10,206 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:39:10,209 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 213 places, 324 transitions, 3704 flow. Second operand has 30 states, 30 states have (on average 190.9) internal successors, (5727), 30 states have internal predecessors, (5727), 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:39:10,209 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:10,209 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:39:10,209 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:15,063 INFO L124 PetriNetUnfolderBase]: 4680/9032 cut-off events. [2023-11-06 22:39:15,064 INFO L125 PetriNetUnfolderBase]: For 126916/127890 co-relation queries the response was YES. [2023-11-06 22:39:15,141 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54722 conditions, 9032 events. 4680/9032 cut-off events. For 126916/127890 co-relation queries the response was YES. Maximal size of possible extension queue 342. Compared 68527 event pairs, 1477 based on Foata normal form. 111/8323 useless extension candidates. Maximal degree in co-relation 53151. Up to 5483 conditions per place. [2023-11-06 22:39:15,198 INFO L140 encePairwiseOnDemand]: 477/499 looper letters, 265 selfloop transitions, 153 changer transitions 3/427 dead transitions. [2023-11-06 22:39:15,198 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 231 places, 427 transitions, 6313 flow [2023-11-06 22:39:15,199 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2023-11-06 22:39:15,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2023-11-06 22:39:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 3779 transitions. [2023-11-06 22:39:15,205 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39858664697816687 [2023-11-06 22:39:15,205 INFO L72 ComplementDD]: Start complementDD. Operand 19 states and 3779 transitions. [2023-11-06 22:39:15,205 INFO L73 IsDeterministic]: Start isDeterministic. Operand 19 states and 3779 transitions. [2023-11-06 22:39:15,207 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:15,207 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 19 states and 3779 transitions. [2023-11-06 22:39:15,213 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 20 states, 19 states have (on average 198.89473684210526) internal successors, (3779), 19 states have internal predecessors, (3779), 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:39:15,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 20 states, 20 states have (on average 499.0) internal successors, (9980), 20 states have internal predecessors, (9980), 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:39:15,223 INFO L81 ComplementDD]: Finished complementDD. Result has 20 states, 20 states have (on average 499.0) internal successors, (9980), 20 states have internal predecessors, (9980), 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:39:15,223 INFO L175 Difference]: Start difference. First operand has 213 places, 324 transitions, 3704 flow. Second operand 19 states and 3779 transitions. [2023-11-06 22:39:15,224 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 231 places, 427 transitions, 6313 flow [2023-11-06 22:39:15,438 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 228 places, 427 transitions, 6060 flow, removed 123 selfloop flow, removed 3 redundant places. [2023-11-06 22:39:15,445 INFO L231 Difference]: Finished difference. Result has 238 places, 347 transitions, 4646 flow [2023-11-06 22:39:15,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=3289, PETRI_DIFFERENCE_MINUEND_PLACES=210, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=299, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=107, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=165, PETRI_DIFFERENCE_SUBTRAHEND_STATES=19, PETRI_FLOW=4646, PETRI_PLACES=238, PETRI_TRANSITIONS=347} [2023-11-06 22:39:15,446 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 180 predicate places. [2023-11-06 22:39:15,446 INFO L495 AbstractCegarLoop]: Abstraction has has 238 places, 347 transitions, 4646 flow [2023-11-06 22:39:15,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 190.9) internal successors, (5727), 30 states have internal predecessors, (5727), 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:39:15,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:15,448 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:15,457 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:15,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:39:15,654 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:15,654 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:15,654 INFO L85 PathProgramCache]: Analyzing trace with hash 1455875272, now seen corresponding path program 1 times [2023-11-06 22:39:15,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:15,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1339712447] [2023-11-06 22:39:15,654 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:15,654 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:15,680 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:16,470 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:16,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1339712447] [2023-11-06 22:39:16,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1339712447] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:16,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281280524] [2023-11-06 22:39:16,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:16,471 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:16,471 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:16,472 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:16,480 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:39:16,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:16,648 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:39:16,651 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:16,679 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:39:16,679 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 29 treesize of output 34 [2023-11-06 22:39:17,050 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 35 treesize of output 19 [2023-11-06 22:39:17,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:17,104 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 26 treesize of output 19 [2023-11-06 22:39:17,231 INFO L322 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-06 22:39:17,231 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 45 treesize of output 35 [2023-11-06 22:39:17,305 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 33 treesize of output 17 [2023-11-06 22:39:17,326 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 26 treesize of output 19 [2023-11-06 22:39:17,383 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:17,383 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:17,476 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_773 (Array Int Int))) (< 0 (+ 2147483650 (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_773) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))))) is different from false [2023-11-06 22:39:17,890 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:17,890 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 69 [2023-11-06 22:39:17,903 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:17,903 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 112 treesize of output 112 [2023-11-06 22:39:17,911 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 88 treesize of output 80 [2023-11-06 22:39:17,920 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 51 treesize of output 39 [2023-11-06 22:39:17,942 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 17 treesize of output 9 [2023-11-06 22:39:17,967 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:17,968 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 74 treesize of output 62 [2023-11-06 22:39:18,172 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:39:18,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281280524] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:18,172 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:18,173 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-11-06 22:39:18,173 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1114458639] [2023-11-06 22:39:18,173 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:18,173 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:39:18,174 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:18,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:39:18,175 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=131, Invalid=677, Unknown=8, NotChecked=54, Total=870 [2023-11-06 22:39:18,604 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:39:18,609 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 238 places, 347 transitions, 4646 flow. Second operand has 30 states, 30 states have (on average 190.9) internal successors, (5727), 30 states have internal predecessors, (5727), 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:39:18,609 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:18,610 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:39:18,610 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:23,560 INFO L124 PetriNetUnfolderBase]: 5922/11696 cut-off events. [2023-11-06 22:39:23,560 INFO L125 PetriNetUnfolderBase]: For 262702/262896 co-relation queries the response was YES. [2023-11-06 22:39:23,659 INFO L83 FinitePrefix]: Finished finitePrefix Result has 79831 conditions, 11696 events. 5922/11696 cut-off events. For 262702/262896 co-relation queries the response was YES. Maximal size of possible extension queue 416. Compared 93724 event pairs, 2034 based on Foata normal form. 166/10852 useless extension candidates. Maximal degree in co-relation 78339. Up to 3367 conditions per place. [2023-11-06 22:39:23,722 INFO L140 encePairwiseOnDemand]: 486/499 looper letters, 328 selfloop transitions, 165 changer transitions 3/502 dead transitions. [2023-11-06 22:39:23,723 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 256 places, 502 transitions, 8128 flow [2023-11-06 22:39:23,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-06 22:39:23,725 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-06 22:39:23,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 3984 transitions. [2023-11-06 22:39:23,731 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39919839679358715 [2023-11-06 22:39:23,731 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 3984 transitions. [2023-11-06 22:39:23,731 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 3984 transitions. [2023-11-06 22:39:23,733 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:23,733 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 3984 transitions. [2023-11-06 22:39:23,739 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 199.2) internal successors, (3984), 20 states have internal predecessors, (3984), 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:39:23,748 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 499.0) internal successors, (10479), 21 states have internal predecessors, (10479), 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:39:23,751 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 499.0) internal successors, (10479), 21 states have internal predecessors, (10479), 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:39:23,751 INFO L175 Difference]: Start difference. First operand has 238 places, 347 transitions, 4646 flow. Second operand 20 states and 3984 transitions. [2023-11-06 22:39:23,751 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 256 places, 502 transitions, 8128 flow [2023-11-06 22:39:24,054 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 249 places, 502 transitions, 7718 flow, removed 170 selfloop flow, removed 7 redundant places. [2023-11-06 22:39:24,065 INFO L231 Difference]: Finished difference. Result has 250 places, 369 transitions, 4905 flow [2023-11-06 22:39:24,066 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4165, PETRI_DIFFERENCE_MINUEND_PLACES=230, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=341, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=138, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=199, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=4905, PETRI_PLACES=250, PETRI_TRANSITIONS=369} [2023-11-06 22:39:24,066 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 192 predicate places. [2023-11-06 22:39:24,066 INFO L495 AbstractCegarLoop]: Abstraction has has 250 places, 369 transitions, 4905 flow [2023-11-06 22:39:24,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 30 states have (on average 190.9) internal successors, (5727), 30 states have internal predecessors, (5727), 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:39:24,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:24,067 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:24,073 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:24,267 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:24,268 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err4ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:24,268 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:24,268 INFO L85 PathProgramCache]: Analyzing trace with hash 1580154218, now seen corresponding path program 1 times [2023-11-06 22:39:24,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:24,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [312874312] [2023-11-06 22:39:24,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:24,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:24,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:24,331 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:24,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:24,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [312874312] [2023-11-06 22:39:24,332 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [312874312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:24,332 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:24,332 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:24,332 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384544459] [2023-11-06 22:39:24,332 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:24,333 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:24,333 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:24,334 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:24,334 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:24,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 499 [2023-11-06 22:39:24,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 250 places, 369 transitions, 4905 flow. Second operand has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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:39:24,350 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:24,350 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 499 [2023-11-06 22:39:24,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:27,386 INFO L124 PetriNetUnfolderBase]: 5759/11429 cut-off events. [2023-11-06 22:39:27,387 INFO L125 PetriNetUnfolderBase]: For 258515/258591 co-relation queries the response was YES. [2023-11-06 22:39:27,457 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76568 conditions, 11429 events. 5759/11429 cut-off events. For 258515/258591 co-relation queries the response was YES. Maximal size of possible extension queue 407. Compared 91892 event pairs, 3504 based on Foata normal form. 0/10528 useless extension candidates. Maximal degree in co-relation 75187. Up to 10470 conditions per place. [2023-11-06 22:39:27,649 INFO L140 encePairwiseOnDemand]: 497/499 looper letters, 340 selfloop transitions, 1 changer transitions 3/370 dead transitions. [2023-11-06 22:39:27,649 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 251 places, 370 transitions, 5624 flow [2023-11-06 22:39:27,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:27,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:39:27,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 778 transitions. [2023-11-06 22:39:27,651 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5197060788243153 [2023-11-06 22:39:27,651 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 778 transitions. [2023-11-06 22:39:27,652 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 778 transitions. [2023-11-06 22:39:27,652 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:27,652 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 778 transitions. [2023-11-06 22:39:27,653 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 259.3333333333333) internal successors, (778), 3 states have internal predecessors, (778), 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:39:27,655 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:27,655 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:27,656 INFO L175 Difference]: Start difference. First operand has 250 places, 369 transitions, 4905 flow. Second operand 3 states and 778 transitions. [2023-11-06 22:39:27,656 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 251 places, 370 transitions, 5624 flow [2023-11-06 22:39:27,951 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 370 transitions, 5393 flow, removed 58 selfloop flow, removed 9 redundant places. [2023-11-06 22:39:27,958 INFO L231 Difference]: Finished difference. Result has 242 places, 362 transitions, 4576 flow [2023-11-06 22:39:27,959 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4574, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=362, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=361, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4576, PETRI_PLACES=242, PETRI_TRANSITIONS=362} [2023-11-06 22:39:27,959 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 184 predicate places. [2023-11-06 22:39:27,959 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 362 transitions, 4576 flow [2023-11-06 22:39:27,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 247.33333333333334) internal successors, (742), 3 states have internal predecessors, (742), 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:39:27,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:27,960 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:27,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-06 22:39:27,960 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:27,960 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:27,960 INFO L85 PathProgramCache]: Analyzing trace with hash 1580154217, now seen corresponding path program 1 times [2023-11-06 22:39:27,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:27,960 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2012698575] [2023-11-06 22:39:27,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:27,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:27,980 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:28,020 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:39:28,020 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:28,020 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2012698575] [2023-11-06 22:39:28,021 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2012698575] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:28,021 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:28,021 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:39:28,021 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [222209076] [2023-11-06 22:39:28,021 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:28,021 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:28,022 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:28,022 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:28,022 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:28,034 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 499 [2023-11-06 22:39:28,034 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 362 transitions, 4576 flow. Second operand has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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:39:28,035 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:28,035 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 499 [2023-11-06 22:39:28,035 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:30,869 INFO L124 PetriNetUnfolderBase]: 5620/11204 cut-off events. [2023-11-06 22:39:30,869 INFO L125 PetriNetUnfolderBase]: For 240551/240855 co-relation queries the response was YES. [2023-11-06 22:39:30,975 INFO L83 FinitePrefix]: Finished finitePrefix Result has 73261 conditions, 11204 events. 5620/11204 cut-off events. For 240551/240855 co-relation queries the response was YES. Maximal size of possible extension queue 397. Compared 90349 event pairs, 3460 based on Foata normal form. 52/10402 useless extension candidates. Maximal degree in co-relation 71878. Up to 7257 conditions per place. [2023-11-06 22:39:31,047 INFO L140 encePairwiseOnDemand]: 495/499 looper letters, 299 selfloop transitions, 38 changer transitions 0/363 dead transitions. [2023-11-06 22:39:31,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 243 places, 363 transitions, 5308 flow [2023-11-06 22:39:31,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:31,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:39:31,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 772 transitions. [2023-11-06 22:39:31,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5156980627922512 [2023-11-06 22:39:31,049 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 772 transitions. [2023-11-06 22:39:31,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 772 transitions. [2023-11-06 22:39:31,050 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:31,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 772 transitions. [2023-11-06 22:39:31,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.3333333333333) internal successors, (772), 3 states have internal predecessors, (772), 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:39:31,053 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:31,053 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:31,053 INFO L175 Difference]: Start difference. First operand has 242 places, 362 transitions, 4576 flow. Second operand 3 states and 772 transitions. [2023-11-06 22:39:31,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 243 places, 363 transitions, 5308 flow [2023-11-06 22:39:31,291 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 242 places, 363 transitions, 5307 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:39:31,298 INFO L231 Difference]: Finished difference. Result has 242 places, 355 transitions, 4551 flow [2023-11-06 22:39:31,299 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4475, PETRI_DIFFERENCE_MINUEND_PLACES=240, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=355, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=317, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4551, PETRI_PLACES=242, PETRI_TRANSITIONS=355} [2023-11-06 22:39:31,299 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 184 predicate places. [2023-11-06 22:39:31,300 INFO L495 AbstractCegarLoop]: Abstraction has has 242 places, 355 transitions, 4551 flow [2023-11-06 22:39:31,300 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.33333333333334) internal successors, (739), 3 states have internal predecessors, (739), 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:39:31,300 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:31,300 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:31,300 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-06 22:39:31,301 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:31,301 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:31,301 INFO L85 PathProgramCache]: Analyzing trace with hash -2045138823, now seen corresponding path program 1 times [2023-11-06 22:39:31,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:31,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1207326737] [2023-11-06 22:39:31,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:31,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:31,324 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:31,377 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:31,378 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:31,378 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1207326737] [2023-11-06 22:39:31,381 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1207326737] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:31,381 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [477669732] [2023-11-06 22:39:31,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:31,382 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:31,382 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:31,383 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:31,401 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:39:31,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:31,563 INFO L262 TraceCheckSpWp]: Trace formula consists of 248 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:39:31,566 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:31,569 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 11 treesize of output 7 [2023-11-06 22:39:31,596 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:39:31,597 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:31,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [477669732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:31,597 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-06 22:39:31,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [4] total 5 [2023-11-06 22:39:31,598 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1417311937] [2023-11-06 22:39:31,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:31,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:31,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:31,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:31,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:39:31,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 239 out of 499 [2023-11-06 22:39:31,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 242 places, 355 transitions, 4551 flow. Second operand has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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:39:31,621 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:31,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 239 of 499 [2023-11-06 22:39:31,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:33,854 INFO L124 PetriNetUnfolderBase]: 4476/9180 cut-off events. [2023-11-06 22:39:33,854 INFO L125 PetriNetUnfolderBase]: For 195588/195590 co-relation queries the response was YES. [2023-11-06 22:39:33,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 53430 conditions, 9180 events. 4476/9180 cut-off events. For 195588/195590 co-relation queries the response was YES. Maximal size of possible extension queue 279. Compared 68224 event pairs, 485 based on Foata normal form. 515/8926 useless extension candidates. Maximal degree in co-relation 53015. Up to 7939 conditions per place. [2023-11-06 22:39:33,965 INFO L140 encePairwiseOnDemand]: 495/499 looper letters, 321 selfloop transitions, 4 changer transitions 0/349 dead transitions. [2023-11-06 22:39:33,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 244 places, 349 transitions, 5245 flow [2023-11-06 22:39:33,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:39:33,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:39:33,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 773 transitions. [2023-11-06 22:39:33,967 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5163660654642619 [2023-11-06 22:39:33,967 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 773 transitions. [2023-11-06 22:39:33,967 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 773 transitions. [2023-11-06 22:39:33,967 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:33,967 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 773 transitions. [2023-11-06 22:39:33,968 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 257.6666666666667) internal successors, (773), 3 states have internal predecessors, (773), 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:39:33,969 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:33,969 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 499.0) internal successors, (1996), 4 states have internal predecessors, (1996), 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:39:33,970 INFO L175 Difference]: Start difference. First operand has 242 places, 355 transitions, 4551 flow. Second operand 3 states and 773 transitions. [2023-11-06 22:39:33,970 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 244 places, 349 transitions, 5245 flow [2023-11-06 22:39:34,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 243 places, 349 transitions, 5207 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:39:34,095 INFO L231 Difference]: Finished difference. Result has 243 places, 338 transitions, 4410 flow [2023-11-06 22:39:34,095 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4402, PETRI_DIFFERENCE_MINUEND_PLACES=241, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=338, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=334, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=4410, PETRI_PLACES=243, PETRI_TRANSITIONS=338} [2023-11-06 22:39:34,095 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 185 predicate places. [2023-11-06 22:39:34,096 INFO L495 AbstractCegarLoop]: Abstraction has has 243 places, 338 transitions, 4410 flow [2023-11-06 22:39:34,096 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 246.0) internal successors, (738), 3 states have internal predecessors, (738), 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:39:34,096 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:34,096 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:34,100 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-06 22:39:34,296 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-06 22:39:34,297 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:34,297 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:34,297 INFO L85 PathProgramCache]: Analyzing trace with hash -1776488146, now seen corresponding path program 4 times [2023-11-06 22:39:34,297 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:34,297 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1982685592] [2023-11-06 22:39:34,297 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:34,297 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:34,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:36,698 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:39:36,699 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1982685592] [2023-11-06 22:39:36,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1982685592] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:36,699 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [789644560] [2023-11-06 22:39:36,699 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:39:36,699 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:36,700 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:36,701 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:36,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_67d23c89-01b2-4bfc-ad17-2f8dc369df0e/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-06 22:39:36,949 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:39:36,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:36,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 268 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-06 22:39:36,957 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:36,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:36,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:36,984 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2023-11-06 22:39:37,001 INFO L322 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-06 22:39:37,002 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 20 treesize of output 22 [2023-11-06 22:39:37,017 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:37,019 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 15 [2023-11-06 22:39:37,029 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:37,032 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:37,034 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:37,034 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:37,035 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-06 22:39:37,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 57 treesize of output 44 [2023-11-06 22:39:37,434 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 70 treesize of output 55 [2023-11-06 22:39:37,754 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 129 treesize of output 106 [2023-11-06 22:39:37,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:37,928 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 240 treesize of output 199 [2023-11-06 22:39:38,144 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 258 treesize of output 215 [2023-11-06 22:39:38,847 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 936 treesize of output 789 [2023-11-06 22:39:39,279 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 949 treesize of output 802 [2023-11-06 22:39:40,836 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 3045 treesize of output 2570 [2023-11-06 22:39:48,786 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:48,788 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 9812 treesize of output 8397 [2023-11-06 22:39:57,878 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 9830 treesize of output 8413 [2023-11-06 22:40:11,796 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 0 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:11,796 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:12,311 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (forall ((v_ArrVal_983 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) (+ 88 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-11-06 22:40:14,762 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978))) (let ((.cse0 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (select (store (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select .cse2 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) (+ 88 |c_~#queue~0.offset|)) 2147483647)))))) is different from false [2023-11-06 22:40:14,802 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse4 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978))) (let ((.cse1 (select .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse2 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store .cse4 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse1 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|)))))) is different from false [2023-11-06 22:40:14,836 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse1 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_977))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| .cse1) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse3 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 (+ 84 |c_~#queue~0.offset|)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) (+ 88 |c_~#queue~0.offset|)) 2147483647) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|)))))) is different from false [2023-11-06 22:40:14,875 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (let ((.cse5 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse4 (select (store (store |c_#memory_int| |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse4 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse4 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|))))))) is different from false [2023-11-06 22:40:14,915 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse0 (select .cse6 |c_~#queue~0.base|))) (let ((.cse5 (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse4 (select (store (store .cse6 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse4 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse3) 2147483647) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|)))))))) is different from false [2023-11-06 22:40:14,956 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse2 (select .cse7 |c_~#queue~0.base|))) (let ((.cse4 (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse5 (select (store (store .cse7 |c_~#queue~0.base| .cse4) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse1 (+ 88 |c_~#queue~0.offset|)) (.cse3 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse5 .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse1) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select .cse0 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|) (< (select .cse5 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|))))))))) is different from false [2023-11-06 22:40:15,010 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| Int)) (let ((.cse8 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse9 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse6 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse8 .cse9 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| 1))))) (let ((.cse7 (store .cse6 |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse5 (select .cse7 |c_~#queue~0.base|))) (let ((.cse3 (store .cse5 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse0 (select (store (store .cse7 |c_~#queue~0.base| .cse3) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse2 (select (store (store (store .cse6 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse0 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select .cse2 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse3 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|) (< (select (store .cse2 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse4) 2147483647) (< (select .cse5 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|))))))))) (< (select .cse8 .cse9) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104|)))) is different from false [2023-11-06 22:40:15,116 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse8 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| 1))))) (let ((.cse9 (store .cse8 |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse6 (select .cse9 |c_~#queue~0.base|))) (let ((.cse7 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse3 (select (store (store .cse9 |c_~#queue~0.base| .cse7) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse2 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse8 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse3 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse2) 2147483647) (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select .cse4 .cse5) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|)))))))))) is different from false [2023-11-06 22:40:15,181 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_975 (Array Int Int)) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int) (v_ArrVal_977 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133| Int) (v_ArrVal_981 (Array Int Int))) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| 1))))) (let ((.cse10 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse6 (select .cse10 |c_~#queue~0.base|))) (let ((.cse5 (store .cse6 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| .cse5) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse4 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse8 .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse4) 2147483647) (< (select .cse5 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|) (< (select .cse6 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select .cse2 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|)))))))))) is different from false [2023-11-06 22:40:15,255 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| Int) (v_ArrVal_977 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133| Int) (v_ArrVal_981 (Array Int Int)) (v_ArrVal_975 (Array Int Int)) (v_ArrVal_972 Int) (v_ArrVal_983 Int) (v_ArrVal_978 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| Int)) (let ((.cse5 (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_972)) (.cse6 (+ 88 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse7 (+ 84 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse9 (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133| 1)) .cse7 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104| 1))))) (let ((.cse10 (store .cse9 |c_~#stored_elements~0.base| v_ArrVal_975))) (let ((.cse4 (select .cse10 |c_~#queue~0.base|))) (let ((.cse2 (store .cse4 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105| 4) |c_~#queue~0.offset|) v_ArrVal_977))) (let ((.cse8 (select (store (store .cse10 |c_~#queue~0.base| .cse2) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base|)) (.cse3 (+ 88 |c_~#queue~0.offset|)) (.cse1 (+ 84 |c_~#queue~0.offset|))) (let ((.cse0 (select (store (store (store .cse9 |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_978) |c_~#queue~0.base| (store (store .cse8 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102| 1))) |c_~#stored_elements~0.base| v_ArrVal_981) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_129|) (< (select .cse4 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_105|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_133|) (< (select .cse5 .cse7) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_104|) (< (select .cse8 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_102|) (< (select (store .cse0 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_983) .cse3) 2147483647)))))))))) is different from false