./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/pthread/queue_ok_longest.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/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_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerReach.xml -i ../../sv-benchmarks/c/pthread/queue_ok_longest.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/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_3a52fc78-c62b-421e-b79d-74feb375a331/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 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:37:07,380 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:37:07,500 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-Overflow-32bit-Automizer_Default.epf [2023-11-06 22:37:07,507 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:37:07,508 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:37:07,551 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:37:07,552 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:37:07,553 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:37:07,554 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:37:07,559 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:37:07,559 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:37:07,560 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:37:07,560 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:37:07,562 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:37:07,563 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-06 22:37:07,563 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:37:07,563 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:37:07,564 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:37:07,564 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:37:07,565 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-06 22:37:07,565 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:37:07,566 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-06 22:37:07,566 INFO L153 SettingsManager]: * Check absence of signed integer overflows=true [2023-11-06 22:37:07,568 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:37:07,569 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:37:07,569 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-06 22:37:07,570 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:37:07,571 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:37:07,571 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:37:07,571 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:37:07,572 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:37:07,572 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:37:07,573 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:37:07,573 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2023-11-06 22:37:07,573 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:37:07,574 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:37:07,574 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:37:07,574 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-06 22:37:07,574 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:37:07,575 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:37:07,575 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:37:07,575 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_3a52fc78-c62b-421e-b79d-74feb375a331/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_3a52fc78-c62b-421e-b79d-74feb375a331/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 -> 0e9bc4a9a6dcd238ac18925269a0bd7c8c54c2dafb57744151e37b58cf6eab8d [2023-11-06 22:37:07,905 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:37:07,928 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:37:07,931 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:37:07,932 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:37:07,933 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:37:07,934 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-06 22:37:10,974 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:37:11,374 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:37:11,374 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/sv-benchmarks/c/pthread/queue_ok_longest.i [2023-11-06 22:37:11,403 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/data/c3eb74adf/01bd727a0e9f4ff9b805d5ef63ca5215/FLAGbf986651f [2023-11-06 22:37:11,419 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/data/c3eb74adf/01bd727a0e9f4ff9b805d5ef63ca5215 [2023-11-06 22:37:11,422 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:37:11,423 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:37:11,425 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:11,425 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:37:11,434 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:37:11,434 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:11" (1/1) ... [2023-11-06 22:37:11,435 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@17e6df32 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:11, skipping insertion in model container [2023-11-06 22:37:11,436 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:37:11" (1/1) ... [2023-11-06 22:37:11,508 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:37:12,087 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:12,099 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:37:12,147 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:37:12,210 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:37:12,211 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12 WrapperNode [2023-11-06 22:37:12,211 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:37:12,212 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:12,213 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:37:12,213 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:37:12,220 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:37:12" (1/1) ... [2023-11-06 22:37:12,241 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:37:12" (1/1) ... [2023-11-06 22:37:12,290 INFO L138 Inliner]: procedures = 274, calls = 59, calls flagged for inlining = 9, calls inlined = 9, statements flattened = 220 [2023-11-06 22:37:12,291 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:37:12,291 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:37:12,293 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:37:12,293 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:37:12,307 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,307 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,319 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,320 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,344 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,348 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,360 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,362 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,367 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:37:12,372 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:37:12,373 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:37:12,373 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:37:12,374 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (1/1) ... [2023-11-06 22:37:12,380 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:37:12,392 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:12,407 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/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:37:12,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/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:37:12,442 INFO L130 BoogieDeclarations]: Found specification of procedure t1 [2023-11-06 22:37:12,443 INFO L138 BoogieDeclarations]: Found implementation of procedure t1 [2023-11-06 22:37:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure t2 [2023-11-06 22:37:12,443 INFO L138 BoogieDeclarations]: Found implementation of procedure t2 [2023-11-06 22:37:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:37:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:37:12,443 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-06 22:37:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-06 22:37:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure #PthreadsMutexLock [2023-11-06 22:37:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:37:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-06 22:37:12,444 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:37:12,445 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:37:12,446 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:37:12,602 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:37:12,604 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:37:12,987 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:37:12,999 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:37:13,000 INFO L302 CfgBuilder]: Removed 2 assume(true) statements. [2023-11-06 22:37:13,003 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:13 BoogieIcfgContainer [2023-11-06 22:37:13,007 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:37:13,010 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:37:13,010 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:37:13,015 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:37:13,016 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:37:11" (1/3) ... [2023-11-06 22:37:13,017 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4478b1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:13, skipping insertion in model container [2023-11-06 22:37:13,017 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:37:12" (2/3) ... [2023-11-06 22:37:13,018 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@4478b1cd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:37:13, skipping insertion in model container [2023-11-06 22:37:13,018 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:37:13" (3/3) ... [2023-11-06 22:37:13,020 INFO L112 eAbstractionObserver]: Analyzing ICFG queue_ok_longest.i [2023-11-06 22:37:13,030 WARN L145 ceAbstractionStarter]: Switching off computation of Hoare annotation because input is a concurrent program [2023-11-06 22:37:13,043 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:37:13,043 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 12 error locations. [2023-11-06 22:37:13,043 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:37:13,243 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:37:13,300 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 250 places, 258 transitions, 530 flow [2023-11-06 22:37:13,418 INFO L124 PetriNetUnfolderBase]: 15/256 cut-off events. [2023-11-06 22:37:13,418 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:37:13,427 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:37:13,427 INFO L82 GeneralOperation]: Start removeDead. Operand has 250 places, 258 transitions, 530 flow [2023-11-06 22:37:13,436 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 238 places, 246 transitions, 501 flow [2023-11-06 22:37:13,440 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:37:13,450 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 238 places, 246 transitions, 501 flow [2023-11-06 22:37:13,453 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 238 places, 246 transitions, 501 flow [2023-11-06 22:37:13,454 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 238 places, 246 transitions, 501 flow [2023-11-06 22:37:13,525 INFO L124 PetriNetUnfolderBase]: 15/246 cut-off events. [2023-11-06 22:37:13,526 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:37:13,533 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:37:13,544 INFO L119 LiptonReduction]: Number of co-enabled transitions 15300 [2023-11-06 22:37:21,714 INFO L134 LiptonReduction]: Checked pairs total: 32311 [2023-11-06 22:37:21,715 INFO L136 LiptonReduction]: Total number of compositions: 241 [2023-11-06 22:37:21,731 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:37:21,738 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;@1a700a52, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:37:21,739 INFO L358 AbstractCegarLoop]: Starting to check reachability of 26 error locations. [2023-11-06 22:37:21,744 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:37:21,744 INFO L124 PetriNetUnfolderBase]: 1/17 cut-off events. [2023-11-06 22:37:21,744 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:37:21,745 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:21,745 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:21,746 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:37:21,752 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:21,752 INFO L85 PathProgramCache]: Analyzing trace with hash 665727335, now seen corresponding path program 1 times [2023-11-06 22:37:21,761 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:21,761 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741822668] [2023-11-06 22:37:21,761 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:21,762 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:21,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:22,928 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:22,928 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:22,929 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741822668] [2023-11-06 22:37:22,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741822668] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:22,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:22,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:37:22,934 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [453430767] [2023-11-06 22:37:22,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:22,945 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:37:22,951 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:22,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:37:22,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:37:23,320 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 229 out of 499 [2023-11-06 22:37:23,326 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:37:23,326 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:23,327 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 229 of 499 [2023-11-06 22:37:23,328 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:23,869 INFO L124 PetriNetUnfolderBase]: 1510/2487 cut-off events. [2023-11-06 22:37:23,870 INFO L125 PetriNetUnfolderBase]: For 75/75 co-relation queries the response was YES. [2023-11-06 22:37:23,874 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:37:23,893 INFO L140 encePairwiseOnDemand]: 491/499 looper letters, 54 selfloop transitions, 9 changer transitions 0/70 dead transitions. [2023-11-06 22:37:23,894 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 70 transitions, 275 flow [2023-11-06 22:37:23,899 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:23,902 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:37:23,923 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1439 transitions. [2023-11-06 22:37:23,929 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48062792251169006 [2023-11-06 22:37:23,930 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1439 transitions. [2023-11-06 22:37:23,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1439 transitions. [2023-11-06 22:37:23,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:23,939 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1439 transitions. [2023-11-06 22:37:23,950 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:37:23,964 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:23,968 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:23,970 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:37:23,971 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 70 transitions, 275 flow [2023-11-06 22:37:23,977 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:37:23,981 INFO L231 Difference]: Finished difference. Result has 64 places, 66 transitions, 180 flow [2023-11-06 22:37:23,984 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:37:24,031 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 6 predicate places. [2023-11-06 22:37:24,032 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 66 transitions, 180 flow [2023-11-06 22:37:24,033 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:37:24,034 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:24,034 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:24,034 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-06 22:37:24,034 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:37:24,035 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:24,035 INFO L85 PathProgramCache]: Analyzing trace with hash -837658795, now seen corresponding path program 1 times [2023-11-06 22:37:24,036 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:24,036 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825218503] [2023-11-06 22:37:24,036 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:24,036 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:24,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:24,515 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:24,515 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:24,516 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825218503] [2023-11-06 22:37:24,516 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825218503] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:24,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:24,517 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:24,517 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [182146553] [2023-11-06 22:37:24,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:24,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:37:24,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:24,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:24,521 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:24,978 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 223 out of 499 [2023-11-06 22:37:24,980 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 66 transitions, 180 flow. Second operand has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 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:24,981 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:24,981 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 223 of 499 [2023-11-06 22:37:24,981 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:25,703 INFO L124 PetriNetUnfolderBase]: 2247/3738 cut-off events. [2023-11-06 22:37:25,703 INFO L125 PetriNetUnfolderBase]: For 251/251 co-relation queries the response was YES. [2023-11-06 22:37:25,711 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8012 conditions, 3738 events. 2247/3738 cut-off events. For 251/251 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 20655 event pairs, 409 based on Foata normal form. 0/2856 useless extension candidates. Maximal degree in co-relation 6886. Up to 2505 conditions per place. [2023-11-06 22:37:25,736 INFO L140 encePairwiseOnDemand]: 489/499 looper letters, 131 selfloop transitions, 21 changer transitions 0/159 dead transitions. [2023-11-06 22:37:25,736 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 159 transitions, 699 flow [2023-11-06 22:37:25,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:37:25,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:37:25,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1487 transitions. [2023-11-06 22:37:25,744 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.49665998663994654 [2023-11-06 22:37:25,745 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1487 transitions. [2023-11-06 22:37:25,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1487 transitions. [2023-11-06 22:37:25,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:25,747 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1487 transitions. [2023-11-06 22:37:25,752 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 247.83333333333334) internal successors, (1487), 6 states have internal predecessors, (1487), 0 states have call successors, (0), 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:25,760 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:25,764 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:25,764 INFO L175 Difference]: Start difference. First operand has 64 places, 66 transitions, 180 flow. Second operand 6 states and 1487 transitions. [2023-11-06 22:37:25,767 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 159 transitions, 699 flow [2023-11-06 22:37:25,784 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 159 transitions, 699 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-06 22:37:25,789 INFO L231 Difference]: Finished difference. Result has 72 places, 80 transitions, 315 flow [2023-11-06 22:37:25,789 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=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=315, PETRI_PLACES=72, PETRI_TRANSITIONS=80} [2023-11-06 22:37:25,790 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 14 predicate places. [2023-11-06 22:37:25,791 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 80 transitions, 315 flow [2023-11-06 22:37:25,793 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 224.33333333333334) internal successors, (1346), 6 states have internal predecessors, (1346), 0 states have call successors, (0), 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:25,794 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:25,794 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:25,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-06 22:37:25,800 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:25,804 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:25,804 INFO L85 PathProgramCache]: Analyzing trace with hash -836966844, now seen corresponding path program 1 times [2023-11-06 22:37:25,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:25,805 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346074696] [2023-11-06 22:37:25,805 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:25,805 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:26,271 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:26,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:26,271 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346074696] [2023-11-06 22:37:26,272 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346074696] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:26,272 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:26,272 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:26,272 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [462176244] [2023-11-06 22:37:26,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:26,273 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:37:26,273 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:26,273 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:26,274 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:26,513 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 499 [2023-11-06 22:37:26,515 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 80 transitions, 315 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:37:26,516 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:26,516 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 499 [2023-11-06 22:37:26,516 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:27,310 INFO L124 PetriNetUnfolderBase]: 2396/4016 cut-off events. [2023-11-06 22:37:27,311 INFO L125 PetriNetUnfolderBase]: For 1705/1705 co-relation queries the response was YES. [2023-11-06 22:37:27,324 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9727 conditions, 4016 events. 2396/4016 cut-off events. For 1705/1705 co-relation queries the response was YES. Maximal size of possible extension queue 152. Compared 22589 event pairs, 491 based on Foata normal form. 58/3310 useless extension candidates. Maximal degree in co-relation 8473. Up to 2950 conditions per place. [2023-11-06 22:37:27,352 INFO L140 encePairwiseOnDemand]: 491/499 looper letters, 116 selfloop transitions, 19 changer transitions 0/142 dead transitions. [2023-11-06 22:37:27,353 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 142 transitions, 738 flow [2023-11-06 22:37:27,354 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:37:27,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:37:27,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1248 transitions. [2023-11-06 22:37:27,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5002004008016032 [2023-11-06 22:37:27,359 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1248 transitions. [2023-11-06 22:37:27,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1248 transitions. [2023-11-06 22:37:27,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:27,361 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1248 transitions. [2023-11-06 22:37:27,366 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:37:27,373 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:37:27,376 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:37:27,376 INFO L175 Difference]: Start difference. First operand has 72 places, 80 transitions, 315 flow. Second operand 5 states and 1248 transitions. [2023-11-06 22:37:27,376 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 142 transitions, 738 flow [2023-11-06 22:37:27,407 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 142 transitions, 724 flow, removed 7 selfloop flow, removed 0 redundant places. [2023-11-06 22:37:27,410 INFO L231 Difference]: Finished difference. Result has 78 places, 88 transitions, 409 flow [2023-11-06 22:37:27,410 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=297, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=79, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=409, PETRI_PLACES=78, PETRI_TRANSITIONS=88} [2023-11-06 22:37:27,411 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 20 predicate places. [2023-11-06 22:37:27,412 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 88 transitions, 409 flow [2023-11-06 22:37:27,413 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:37:27,413 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:27,413 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:27,414 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-06 22:37:27,414 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:37:27,414 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:27,414 INFO L85 PathProgramCache]: Analyzing trace with hash 548683948, now seen corresponding path program 1 times [2023-11-06 22:37:27,415 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:27,415 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1825899052] [2023-11-06 22:37:27,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:27,415 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:27,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:27,490 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:27,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:27,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1825899052] [2023-11-06 22:37:27,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1825899052] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:27,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:27,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-06 22:37:27,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1729660759] [2023-11-06 22:37:27,493 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:27,493 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:37:27,494 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:27,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:37:27,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:37:27,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 237 out of 499 [2023-11-06 22:37:27,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 88 transitions, 409 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:37:27,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:27,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 237 of 499 [2023-11-06 22:37:27,524 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:28,545 INFO L124 PetriNetUnfolderBase]: 3939/6447 cut-off events. [2023-11-06 22:37:28,545 INFO L125 PetriNetUnfolderBase]: For 6928/7044 co-relation queries the response was YES. [2023-11-06 22:37:28,566 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16548 conditions, 6447 events. 3939/6447 cut-off events. For 6928/7044 co-relation queries the response was YES. Maximal size of possible extension queue 265. Compared 39626 event pairs, 1717 based on Foata normal form. 92/5216 useless extension candidates. Maximal degree in co-relation 14795. Up to 3839 conditions per place. [2023-11-06 22:37:28,616 INFO L140 encePairwiseOnDemand]: 492/499 looper letters, 162 selfloop transitions, 4 changer transitions 0/177 dead transitions. [2023-11-06 22:37:28,616 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 177 transitions, 1139 flow [2023-11-06 22:37:28,616 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:37:28,616 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:37:28,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 1065 transitions. [2023-11-06 22:37:28,621 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5335671342685371 [2023-11-06 22:37:28,621 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 1065 transitions. [2023-11-06 22:37:28,621 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 1065 transitions. [2023-11-06 22:37:28,622 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:28,623 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 1065 transitions. [2023-11-06 22:37:28,627 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:37:28,632 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:37:28,634 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:37:28,634 INFO L175 Difference]: Start difference. First operand has 78 places, 88 transitions, 409 flow. Second operand 4 states and 1065 transitions. [2023-11-06 22:37:28,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 177 transitions, 1139 flow [2023-11-06 22:37:28,656 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 81 places, 177 transitions, 1115 flow, removed 12 selfloop flow, removed 0 redundant places. [2023-11-06 22:37:28,660 INFO L231 Difference]: Finished difference. Result has 83 places, 91 transitions, 433 flow [2023-11-06 22:37:28,660 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=401, PETRI_DIFFERENCE_MINUEND_PLACES=78, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=88, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=84, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=433, PETRI_PLACES=83, PETRI_TRANSITIONS=91} [2023-11-06 22:37:28,661 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 25 predicate places. [2023-11-06 22:37:28,662 INFO L495 AbstractCegarLoop]: Abstraction has has 83 places, 91 transitions, 433 flow [2023-11-06 22:37:28,662 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:37:28,662 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:28,663 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:28,663 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-06 22:37:28,663 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:37:28,664 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:28,664 INFO L85 PathProgramCache]: Analyzing trace with hash -1474196742, now seen corresponding path program 1 times [2023-11-06 22:37:28,664 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:28,664 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [7862308] [2023-11-06 22:37:28,664 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:28,665 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:28,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:29,041 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:29,042 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:29,042 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [7862308] [2023-11-06 22:37:29,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [7862308] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:29,043 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:29,047 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-06 22:37:29,047 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664505479] [2023-11-06 22:37:29,047 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:29,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:37:29,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:29,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:37:29,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:37:29,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 228 out of 499 [2023-11-06 22:37:29,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 83 places, 91 transitions, 433 flow. Second operand has 6 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 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:29,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:29,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 228 of 499 [2023-11-06 22:37:29,428 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:30,742 INFO L124 PetriNetUnfolderBase]: 4113/6952 cut-off events. [2023-11-06 22:37:30,743 INFO L125 PetriNetUnfolderBase]: For 4209/4221 co-relation queries the response was YES. [2023-11-06 22:37:30,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17866 conditions, 6952 events. 4113/6952 cut-off events. For 4209/4221 co-relation queries the response was YES. Maximal size of possible extension queue 264. Compared 43770 event pairs, 2441 based on Foata normal form. 0/5838 useless extension candidates. Maximal degree in co-relation 12853. Up to 6278 conditions per place. [2023-11-06 22:37:30,813 INFO L140 encePairwiseOnDemand]: 487/499 looper letters, 107 selfloop transitions, 16 changer transitions 0/130 dead transitions. [2023-11-06 22:37:30,814 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 89 places, 130 transitions, 797 flow [2023-11-06 22:37:30,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:30,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:37:30,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1693 transitions. [2023-11-06 22:37:30,821 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48468365302032634 [2023-11-06 22:37:30,821 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1693 transitions. [2023-11-06 22:37:30,822 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1693 transitions. [2023-11-06 22:37:30,823 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:30,823 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1693 transitions. [2023-11-06 22:37:30,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 241.85714285714286) internal successors, (1693), 7 states have internal predecessors, (1693), 0 states have call successors, (0), 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:30,837 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:30,838 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:30,838 INFO L175 Difference]: Start difference. First operand has 83 places, 91 transitions, 433 flow. Second operand 7 states and 1693 transitions. [2023-11-06 22:37:30,838 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 89 places, 130 transitions, 797 flow [2023-11-06 22:37:30,856 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 130 transitions, 793 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:37:30,859 INFO L231 Difference]: Finished difference. Result has 90 places, 97 transitions, 511 flow [2023-11-06 22:37:30,860 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=431, PETRI_DIFFERENCE_MINUEND_PLACES=82, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=76, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=511, PETRI_PLACES=90, PETRI_TRANSITIONS=97} [2023-11-06 22:37:30,861 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 32 predicate places. [2023-11-06 22:37:30,861 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 97 transitions, 511 flow [2023-11-06 22:37:30,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 229.66666666666666) internal successors, (1378), 6 states have internal predecessors, (1378), 0 states have call successors, (0), 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:30,862 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:30,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:30,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-06 22:37:30,862 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:37:30,863 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:30,863 INFO L85 PathProgramCache]: Analyzing trace with hash -931432907, now seen corresponding path program 1 times [2023-11-06 22:37:30,863 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:30,863 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480000980] [2023-11-06 22:37:30,864 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:30,864 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:30,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:31,449 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:31,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:31,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480000980] [2023-11-06 22:37:31,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480000980] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:31,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:31,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:37:31,452 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1155699731] [2023-11-06 22:37:31,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:31,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:37:31,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:31,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:37:31,460 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:37:31,820 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 225 out of 499 [2023-11-06 22:37:31,824 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 97 transitions, 511 flow. Second operand has 7 states, 7 states have (on average 226.57142857142858) internal successors, (1586), 7 states have internal predecessors, (1586), 0 states have call successors, (0), 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:31,824 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:31,824 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 225 of 499 [2023-11-06 22:37:31,825 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:33,355 INFO L124 PetriNetUnfolderBase]: 5018/8384 cut-off events. [2023-11-06 22:37:33,356 INFO L125 PetriNetUnfolderBase]: For 5011/5055 co-relation queries the response was YES. [2023-11-06 22:37:33,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 22107 conditions, 8384 events. 5018/8384 cut-off events. For 5011/5055 co-relation queries the response was YES. Maximal size of possible extension queue 294. Compared 53179 event pairs, 938 based on Foata normal form. 199/7572 useless extension candidates. Maximal degree in co-relation 19559. Up to 5350 conditions per place. [2023-11-06 22:37:33,436 INFO L140 encePairwiseOnDemand]: 487/499 looper letters, 182 selfloop transitions, 27 changer transitions 0/216 dead transitions. [2023-11-06 22:37:33,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 216 transitions, 1309 flow [2023-11-06 22:37:33,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:33,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:37:33,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1749 transitions. [2023-11-06 22:37:33,444 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007157171485829 [2023-11-06 22:37:33,444 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1749 transitions. [2023-11-06 22:37:33,445 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1749 transitions. [2023-11-06 22:37:33,446 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:33,446 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1749 transitions. [2023-11-06 22:37:33,451 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 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:33,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:33,459 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:33,459 INFO L175 Difference]: Start difference. First operand has 90 places, 97 transitions, 511 flow. Second operand 7 states and 1749 transitions. [2023-11-06 22:37:33,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 216 transitions, 1309 flow [2023-11-06 22:37:33,556 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 216 transitions, 1284 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-06 22:37:33,562 INFO L231 Difference]: Finished difference. Result has 95 places, 105 transitions, 628 flow [2023-11-06 22:37:33,562 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=492, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=97, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=20, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=628, PETRI_PLACES=95, PETRI_TRANSITIONS=105} [2023-11-06 22:37:33,566 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 37 predicate places. [2023-11-06 22:37:33,566 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 105 transitions, 628 flow [2023-11-06 22:37:33,567 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 226.57142857142858) internal successors, (1586), 7 states have internal predecessors, (1586), 0 states have call successors, (0), 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:33,567 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:33,567 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:33,567 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-06 22:37:33,568 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:33,568 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:33,568 INFO L85 PathProgramCache]: Analyzing trace with hash -1793280667, now seen corresponding path program 2 times [2023-11-06 22:37:33,568 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:33,569 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2016485988] [2023-11-06 22:37:33,569 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:33,569 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:33,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:33,992 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:33,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:33,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2016485988] [2023-11-06 22:37:33,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2016485988] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:33,992 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:33,992 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:37:33,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1920390400] [2023-11-06 22:37:33,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:33,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:37:33,993 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:33,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:37:33,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:37:34,291 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 499 [2023-11-06 22:37:34,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 105 transitions, 628 flow. Second operand has 7 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 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:34,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:34,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 499 [2023-11-06 22:37:34,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:35,591 INFO L124 PetriNetUnfolderBase]: 5331/8981 cut-off events. [2023-11-06 22:37:35,591 INFO L125 PetriNetUnfolderBase]: For 8581/8597 co-relation queries the response was YES. [2023-11-06 22:37:35,629 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25262 conditions, 8981 events. 5331/8981 cut-off events. For 8581/8597 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 58144 event pairs, 1812 based on Foata normal form. 141/8031 useless extension candidates. Maximal degree in co-relation 15356. Up to 5931 conditions per place. [2023-11-06 22:37:35,669 INFO L140 encePairwiseOnDemand]: 487/499 looper letters, 179 selfloop transitions, 35 changer transitions 0/221 dead transitions. [2023-11-06 22:37:35,669 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 221 transitions, 1435 flow [2023-11-06 22:37:35,670 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:35,670 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:37:35,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1749 transitions. [2023-11-06 22:37:35,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5007157171485829 [2023-11-06 22:37:35,677 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1749 transitions. [2023-11-06 22:37:35,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1749 transitions. [2023-11-06 22:37:35,679 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:35,679 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1749 transitions. [2023-11-06 22:37:35,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 249.85714285714286) internal successors, (1749), 7 states have internal predecessors, (1749), 0 states have call successors, (0), 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,787 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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,788 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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,789 INFO L175 Difference]: Start difference. First operand has 95 places, 105 transitions, 628 flow. Second operand 7 states and 1749 transitions. [2023-11-06 22:37:35,789 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 221 transitions, 1435 flow [2023-11-06 22:37:35,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 221 transitions, 1414 flow, removed 1 selfloop flow, removed 3 redundant places. [2023-11-06 22:37:35,900 INFO L231 Difference]: Finished difference. Result has 100 places, 114 transitions, 787 flow [2023-11-06 22:37:35,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=607, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=105, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=27, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=71, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=787, PETRI_PLACES=100, PETRI_TRANSITIONS=114} [2023-11-06 22:37:35,901 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 42 predicate places. [2023-11-06 22:37:35,901 INFO L495 AbstractCegarLoop]: Abstraction has has 100 places, 114 transitions, 787 flow [2023-11-06 22:37:35,902 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 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,903 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:35,903 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:35,903 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-06 22:37:35,903 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting t2Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:35,904 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:35,904 INFO L85 PathProgramCache]: Analyzing trace with hash -995547143, now seen corresponding path program 1 times [2023-11-06 22:37:35,904 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:35,904 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [159590240] [2023-11-06 22:37:35,904 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:35,905 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:35,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:35,973 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:35,973 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:35,974 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [159590240] [2023-11-06 22:37:35,974 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [159590240] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:35,974 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:35,974 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:37:35,974 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093517397] [2023-11-06 22:37:35,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:35,975 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:37:35,975 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:35,976 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:37:35,976 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:37:35,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 240 out of 499 [2023-11-06 22:37:35,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 100 places, 114 transitions, 787 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:35,987 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:35,987 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 240 of 499 [2023-11-06 22:37:35,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:36,328 INFO L124 PetriNetUnfolderBase]: 741/1495 cut-off events. [2023-11-06 22:37:36,328 INFO L125 PetriNetUnfolderBase]: For 1483/1483 co-relation queries the response was YES. [2023-11-06 22:37:36,336 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4000 conditions, 1495 events. 741/1495 cut-off events. For 1483/1483 co-relation queries the response was YES. Maximal size of possible extension queue 71. Compared 8679 event pairs, 471 based on Foata normal form. 74/1422 useless extension candidates. Maximal degree in co-relation 2875. Up to 785 conditions per place. [2023-11-06 22:37:36,344 INFO L140 encePairwiseOnDemand]: 495/499 looper letters, 79 selfloop transitions, 2 changer transitions 6/96 dead transitions. [2023-11-06 22:37:36,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 96 transitions, 732 flow [2023-11-06 22:37:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:37:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:37:36,348 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 780 transitions. [2023-11-06 22:37:36,349 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5210420841683366 [2023-11-06 22:37:36,349 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 780 transitions. [2023-11-06 22:37:36,349 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 780 transitions. [2023-11-06 22:37:36,350 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:36,350 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 780 transitions. [2023-11-06 22:37:36,354 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:36,360 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:36,371 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:36,380 INFO L175 Difference]: Start difference. First operand has 100 places, 114 transitions, 787 flow. Second operand 3 states and 780 transitions. [2023-11-06 22:37:36,380 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 96 transitions, 732 flow [2023-11-06 22:37:36,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 96 transitions, 692 flow, removed 14 selfloop flow, removed 3 redundant places. [2023-11-06 22:37:36,394 INFO L231 Difference]: Finished difference. Result has 99 places, 85 transitions, 489 flow [2023-11-06 22:37:36,395 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=487, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=85, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=489, PETRI_PLACES=99, PETRI_TRANSITIONS=85} [2023-11-06 22:37:36,400 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 41 predicate places. [2023-11-06 22:37:36,400 INFO L495 AbstractCegarLoop]: Abstraction has has 99 places, 85 transitions, 489 flow [2023-11-06 22:37:36,402 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:36,402 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:36,402 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:36,402 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-06 22:37:36,403 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:36,403 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:36,403 INFO L85 PathProgramCache]: Analyzing trace with hash 1544542564, now seen corresponding path program 1 times [2023-11-06 22:37:36,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:36,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210173740] [2023-11-06 22:37:36,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:36,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:36,438 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:36,917 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:36,917 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:36,918 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210173740] [2023-11-06 22:37:36,918 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210173740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:36,920 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:36,921 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:37:36,921 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2116245707] [2023-11-06 22:37:36,921 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:36,922 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-06 22:37:36,923 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:36,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-06 22:37:36,924 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-06 22:37:37,294 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 226 out of 499 [2023-11-06 22:37:37,297 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 99 places, 85 transitions, 489 flow. Second operand has 7 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 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:37,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:37,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 226 of 499 [2023-11-06 22:37:37,298 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:37,805 INFO L124 PetriNetUnfolderBase]: 745/1492 cut-off events. [2023-11-06 22:37:37,805 INFO L125 PetriNetUnfolderBase]: For 1115/1115 co-relation queries the response was YES. [2023-11-06 22:37:37,812 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3939 conditions, 1492 events. 745/1492 cut-off events. For 1115/1115 co-relation queries the response was YES. Maximal size of possible extension queue 73. Compared 8573 event pairs, 235 based on Foata normal form. 21/1380 useless extension candidates. Maximal degree in co-relation 3678. Up to 815 conditions per place. [2023-11-06 22:37:37,819 INFO L140 encePairwiseOnDemand]: 489/499 looper letters, 103 selfloop transitions, 16 changer transitions 0/125 dead transitions. [2023-11-06 22:37:37,819 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 104 places, 125 transitions, 840 flow [2023-11-06 22:37:37,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-06 22:37:37,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-06 22:37:37,825 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 1683 transitions. [2023-11-06 22:37:37,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48182078442599485 [2023-11-06 22:37:37,827 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 1683 transitions. [2023-11-06 22:37:37,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 1683 transitions. [2023-11-06 22:37:37,829 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:37,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 1683 transitions. [2023-11-06 22:37:37,835 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 240.42857142857142) internal successors, (1683), 7 states have internal predecessors, (1683), 0 states have call successors, (0), 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:37,844 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:37,846 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 499.0) internal successors, (3992), 8 states have internal predecessors, (3992), 0 states have call successors, (0), 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:37,846 INFO L175 Difference]: Start difference. First operand has 99 places, 85 transitions, 489 flow. Second operand 7 states and 1683 transitions. [2023-11-06 22:37:37,846 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 104 places, 125 transitions, 840 flow [2023-11-06 22:37:37,855 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 125 transitions, 834 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-06 22:37:37,858 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 536 flow [2023-11-06 22:37:37,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=483, PETRI_DIFFERENCE_MINUEND_PLACES=96, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=536, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2023-11-06 22:37:37,860 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2023-11-06 22:37:37,860 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 536 flow [2023-11-06 22:37:37,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 227.57142857142858) internal successors, (1593), 7 states have internal predecessors, (1593), 0 states have call successors, (0), 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:37,861 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:37,862 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:37,862 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-06 22:37:37,863 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting t1Err5ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:37,864 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:37,864 INFO L85 PathProgramCache]: Analyzing trace with hash 635992630, now seen corresponding path program 1 times [2023-11-06 22:37:37,864 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:37,867 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447118837] [2023-11-06 22:37:37,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:37,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:37,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:37,935 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:37,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:37,935 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447118837] [2023-11-06 22:37:37,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447118837] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:37:37,936 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:37:37,936 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:37:37,936 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368581568] [2023-11-06 22:37:37,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:37:37,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:37:37,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:37,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:37:37,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:37:37,950 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 241 out of 499 [2023-11-06 22:37:37,951 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 536 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:37,951 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:37,952 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 241 of 499 [2023-11-06 22:37:37,952 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:38,303 INFO L124 PetriNetUnfolderBase]: 577/1174 cut-off events. [2023-11-06 22:37:38,303 INFO L125 PetriNetUnfolderBase]: For 1159/1159 co-relation queries the response was YES. [2023-11-06 22:37:38,308 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3237 conditions, 1174 events. 577/1174 cut-off events. For 1159/1159 co-relation queries the response was YES. Maximal size of possible extension queue 52. Compared 6103 event pairs, 432 based on Foata normal form. 8/1075 useless extension candidates. Maximal degree in co-relation 2838. Up to 843 conditions per place. [2023-11-06 22:37:38,313 INFO L140 encePairwiseOnDemand]: 494/499 looper letters, 82 selfloop transitions, 2 changer transitions 0/94 dead transitions. [2023-11-06 22:37:38,313 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 105 places, 94 transitions, 724 flow [2023-11-06 22:37:38,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:37:38,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:37:38,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 787 transitions. [2023-11-06 22:37:38,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5257181028724115 [2023-11-06 22:37:38,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 787 transitions. [2023-11-06 22:37:38,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 787 transitions. [2023-11-06 22:37:38,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:38,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 787 transitions. [2023-11-06 22:37:38,320 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:38,323 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:38,324 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:38,324 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 536 flow. Second operand 3 states and 787 transitions. [2023-11-06 22:37:38,324 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 105 places, 94 transitions, 724 flow [2023-11-06 22:37:38,334 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 102 places, 94 transitions, 698 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-06 22:37:38,337 INFO L231 Difference]: Finished difference. Result has 103 places, 86 transitions, 514 flow [2023-11-06 22:37:38,338 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=498, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=83, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=514, PETRI_PLACES=103, PETRI_TRANSITIONS=86} [2023-11-06 22:37:38,339 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 45 predicate places. [2023-11-06 22:37:38,339 INFO L495 AbstractCegarLoop]: Abstraction has has 103 places, 86 transitions, 514 flow [2023-11-06 22:37:38,340 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:38,340 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:38,340 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:38,340 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-06 22:37:38,341 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:38,341 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:38,341 INFO L85 PathProgramCache]: Analyzing trace with hash 1757219439, now seen corresponding path program 1 times [2023-11-06 22:37:38,341 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:38,342 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [817382016] [2023-11-06 22:37:38,342 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:38,342 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:38,389 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:39,692 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:39,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [817382016] [2023-11-06 22:37:39,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [817382016] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:39,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [727734737] [2023-11-06 22:37:39,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:39,693 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:39,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:39,698 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:39,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-06 22:37:39,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:39,872 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 46 conjunts are in the unsatisfiable core [2023-11-06 22:37:39,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:39,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:39,995 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:40,003 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:40,006 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:40,027 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:40,028 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:40,032 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:40,226 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 68 treesize of output 51 [2023-11-06 22:37:40,504 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 88 treesize of output 67 [2023-11-06 22:37:41,000 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 209 treesize of output 168 [2023-11-06 22:37:41,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:41,282 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 490 treesize of output 413 [2023-11-06 22:37:41,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 508 treesize of output 429 [2023-11-06 22:37:42,412 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:42,413 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:42,667 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_255) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_256) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-06 22:37:43,083 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_256 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_63| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse0 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_63| 1)) .cse1 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| 1))) |c_~#stored_elements~0.base| v_ArrVal_255) |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53|) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_63|) (< (select .cse3 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_256) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-06 22:37:43,851 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:43,852 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [727734737] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:43,852 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:43,852 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 30 [2023-11-06 22:37:43,852 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1490246019] [2023-11-06 22:37:43,853 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:43,853 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2023-11-06 22:37:43,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:43,855 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2023-11-06 22:37:43,855 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=194, Invalid=665, Unknown=19, NotChecked=114, Total=992 [2023-11-06 22:37:44,700 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 188 out of 499 [2023-11-06 22:37:44,706 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 103 places, 86 transitions, 514 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:44,706 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:44,706 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 188 of 499 [2023-11-06 22:37:44,707 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:37:50,493 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:52,522 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,540 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,552 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse2 (+ 3208 |c_~#queue~0.offset|)) (.cse3 (+ |c_~#queue~0.offset| 3204)) (.cse0 (select .cse4 .cse5))) (and (forall ((v_ArrVal_256 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| 1))) |c_~#stored_elements~0.base| v_ArrVal_255) |c_~#queue~0.base|))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_256) .cse2) 2147483647) (< (select .cse1 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| Int)) (or (forall ((v_ArrVal_256 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43| Int) (v_ArrVal_255 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53| 1))) |c_~#stored_elements~0.base| v_ArrVal_255) |c_~#queue~0.base|))) (or (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|) |c_~#queue~0.offset|) v_ArrVal_256) .cse2) 2147483647) (< (select .cse6 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_43|)))) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_53|)))))) is different from false [2023-11-06 22:37:57,549 INFO L124 PetriNetUnfolderBase]: 631/1268 cut-off events. [2023-11-06 22:37:57,550 INFO L125 PetriNetUnfolderBase]: For 1212/1212 co-relation queries the response was YES. [2023-11-06 22:37:57,556 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3574 conditions, 1268 events. 631/1268 cut-off events. For 1212/1212 co-relation queries the response was YES. Maximal size of possible extension queue 58. Compared 6699 event pairs, 442 based on Foata normal form. 2/1164 useless extension candidates. Maximal degree in co-relation 3000. Up to 1115 conditions per place. [2023-11-06 22:37:57,561 INFO L140 encePairwiseOnDemand]: 483/499 looper letters, 75 selfloop transitions, 54 changer transitions 1/136 dead transitions. [2023-11-06 22:37:57,561 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 125 places, 136 transitions, 1092 flow [2023-11-06 22:37:57,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-06 22:37:57,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2023-11-06 22:37:57,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 4435 transitions. [2023-11-06 22:37:57,578 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3864250239609654 [2023-11-06 22:37:57,579 INFO L72 ComplementDD]: Start complementDD. Operand 23 states and 4435 transitions. [2023-11-06 22:37:57,579 INFO L73 IsDeterministic]: Start isDeterministic. Operand 23 states and 4435 transitions. [2023-11-06 22:37:57,582 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:37:57,582 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 23 states and 4435 transitions. [2023-11-06 22:37:57,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 24 states, 23 states have (on average 192.82608695652175) internal successors, (4435), 23 states have internal predecessors, (4435), 0 states have call successors, (0), 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:57,687 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 24 states, 24 states have (on average 499.0) internal successors, (11976), 24 states have internal predecessors, (11976), 0 states have call successors, (0), 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:57,691 INFO L81 ComplementDD]: Finished complementDD. Result has 24 states, 24 states have (on average 499.0) internal successors, (11976), 24 states have internal predecessors, (11976), 0 states have call successors, (0), 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:57,691 INFO L175 Difference]: Start difference. First operand has 103 places, 86 transitions, 514 flow. Second operand 23 states and 4435 transitions. [2023-11-06 22:37:57,691 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 125 places, 136 transitions, 1092 flow [2023-11-06 22:37:57,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 124 places, 136 transitions, 1084 flow, removed 2 selfloop flow, removed 1 redundant places. [2023-11-06 22:37:57,702 INFO L231 Difference]: Finished difference. Result has 131 places, 123 transitions, 946 flow [2023-11-06 22:37:57,703 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=508, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=23, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=23, PETRI_FLOW=946, PETRI_PLACES=131, PETRI_TRANSITIONS=123} [2023-11-06 22:37:57,703 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 73 predicate places. [2023-11-06 22:37:57,703 INFO L495 AbstractCegarLoop]: Abstraction has has 131 places, 123 transitions, 946 flow [2023-11-06 22:37:57,705 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:57,705 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:37:57,706 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:37:57,718 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:37:57,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2023-11-06 22:37:57,911 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:37:57,912 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:37:57,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1757219408, now seen corresponding path program 1 times [2023-11-06 22:37:57,913 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:37:57,913 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1051954361] [2023-11-06 22:37:57,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:57,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:37:57,942 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:58,474 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:58,474 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:37:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1051954361] [2023-11-06 22:37:58,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1051954361] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:37:58,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [936301407] [2023-11-06 22:37:58,475 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:37:58,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:37:58,475 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:37:58,477 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:37:58,495 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-06 22:37:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:37:58,661 INFO L262 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-06 22:37:58,672 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:37:58,825 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:58,914 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:58,964 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:37:58,965 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:59,069 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-06 22:37:59,070 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:59,105 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:59,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:37:59,232 WARN L839 $PredicateComparison]: unable to prove that (forall ((|t1Thread1of1ForFork0_enqueue_#t~mem36#1| Int) (v_ArrVal_312 Int) (v_ArrVal_310 (Array Int Int))) (or (< 0 (+ 2147483650 (select (store (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_310) |c_~#queue~0.base|) (+ |c_~#queue~0.offset| (* |t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4)) v_ArrVal_312) (+ 3208 |c_~#queue~0.offset|)))) (< (+ v_ArrVal_312 2147483648) 0))) is different from false [2023-11-06 22:37:59,353 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:59,354 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:59,369 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:59,370 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:59,380 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:59,407 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:59,418 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:37:59,419 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:59,557 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:59,557 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [936301407] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:37:59,557 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:37:59,558 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 24 [2023-11-06 22:37:59,558 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1986930196] [2023-11-06 22:37:59,558 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:37:59,560 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-06 22:37:59,560 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:37:59,561 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-06 22:37:59,561 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=126, Invalid=476, Unknown=2, NotChecked=46, Total=650 [2023-11-06 22:37:59,664 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:37:59,669 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 131 places, 123 transitions, 946 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:59,669 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:37:59,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:37:59,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:00,888 INFO L124 PetriNetUnfolderBase]: 1093/2153 cut-off events. [2023-11-06 22:38:00,888 INFO L125 PetriNetUnfolderBase]: For 2437/2437 co-relation queries the response was YES. [2023-11-06 22:38:00,897 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6200 conditions, 2153 events. 1093/2153 cut-off events. For 2437/2437 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 13035 event pairs, 374 based on Foata normal form. 10/1966 useless extension candidates. Maximal degree in co-relation 6125. Up to 679 conditions per place. [2023-11-06 22:38:00,906 INFO L140 encePairwiseOnDemand]: 487/499 looper letters, 130 selfloop transitions, 72 changer transitions 0/208 dead transitions. [2023-11-06 22:38:00,906 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 140 places, 208 transitions, 1703 flow [2023-11-06 22:38:00,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-06 22:38:00,907 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-06 22:38:00,915 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 2214 transitions. [2023-11-06 22:38:00,917 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40335215886318093 [2023-11-06 22:38:00,917 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 2214 transitions. [2023-11-06 22:38:00,917 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 2214 transitions. [2023-11-06 22:38:00,919 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:00,919 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 2214 transitions. [2023-11-06 22:38:00,925 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:38:00,936 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:38:00,939 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:38:00,939 INFO L175 Difference]: Start difference. First operand has 131 places, 123 transitions, 946 flow. Second operand 11 states and 2214 transitions. [2023-11-06 22:38:00,939 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 140 places, 208 transitions, 1703 flow [2023-11-06 22:38:00,967 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 133 places, 208 transitions, 1535 flow, removed 72 selfloop flow, removed 7 redundant places. [2023-11-06 22:38:00,972 INFO L231 Difference]: Finished difference. Result has 136 places, 136 transitions, 1096 flow [2023-11-06 22:38:00,972 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=748, PETRI_DIFFERENCE_MINUEND_PLACES=123, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=120, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=56, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=1096, PETRI_PLACES=136, PETRI_TRANSITIONS=136} [2023-11-06 22:38:00,973 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 78 predicate places. [2023-11-06 22:38:00,973 INFO L495 AbstractCegarLoop]: Abstraction has has 136 places, 136 transitions, 1096 flow [2023-11-06 22:38:00,975 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:38:00,976 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:00,976 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:00,990 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:01,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2023-11-06 22:38:01,183 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:38:01,183 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:01,184 INFO L85 PathProgramCache]: Analyzing trace with hash 650863197, now seen corresponding path program 1 times [2023-11-06 22:38:01,184 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:01,184 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [554023265] [2023-11-06 22:38:01,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:01,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:01,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:02,281 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:02,281 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:02,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [554023265] [2023-11-06 22:38:02,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [554023265] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:02,282 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999021764] [2023-11-06 22:38:02,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:02,282 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:02,283 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:02,285 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-06 22:38:02,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:02,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 52 conjunts are in the unsatisfiable core [2023-11-06 22:38:02,434 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:02,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:02,464 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:02,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:02,498 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:38:02,499 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:02,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:02,518 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:02,522 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:02,547 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:38:02,556 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:38:02,556 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:38:02,705 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 50 treesize of output 35 [2023-11-06 22:38:02,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 68 treesize of output 51 [2023-11-06 22:38:03,121 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 88 treesize of output 67 [2023-11-06 22:38:03,558 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 209 treesize of output 168 [2023-11-06 22:38:03,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:03,761 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 490 treesize of output 413 [2023-11-06 22:38:04,072 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 508 treesize of output 429 [2023-11-06 22:38:04,661 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:04,661 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:04,976 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int)) (let ((.cse0 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (< (select .cse0 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (v_ArrVal_379 (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_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< (select .cse2 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (store .cse2 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))))) is different from false [2023-11-06 22:38:06,527 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,527 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1999021764] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:06,527 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:38:06,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 34 [2023-11-06 22:38:06,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [494597593] [2023-11-06 22:38:06,528 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:06,528 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:38:06,529 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:06,530 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:38:06,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=930, Unknown=33, NotChecked=66, Total=1260 [2023-11-06 22:38:06,539 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:38:06,547 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 136 places, 136 transitions, 1096 flow. Second operand has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:06,548 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:06,548 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:38:06,548 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:09,562 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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:11,588 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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:13,723 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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:16,099 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.04s 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:19,911 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:22,035 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:28,247 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.03s 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:30,308 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:32,311 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:36,639 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:37,108 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (select .cse4 .cse5)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse3 (+ 3208 |c_~#queue~0.offset|))) (and (or (= 800 .cse0) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) .cse3) 2147483647))))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int)) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse6 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 .cse5 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< (select .cse6 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select (store .cse6 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) .cse3) 2147483647))))))))) is different from false [2023-11-06 22:38:37,138 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse3 (select .cse5 .cse6))) (let ((.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse4 (+ 3208 |c_~#queue~0.offset|)) (.cse8 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse0 (= 800 .cse3))) (and (or .cse0 (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse1 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse5 .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (< (select (store .cse1 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) .cse4) 2147483647))))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (< (select (store .cse7 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) .cse4) 2147483647) (< (select .cse7 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|)))) .cse0) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56| Int) (v_ArrVal_380 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| Int) (v_ArrVal_379 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 .cse8 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63| 1))) |c_~#stored_elements~0.base| v_ArrVal_379) |c_~#queue~0.base|))) (or (< .cse3 |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_63|) (< (select .cse9 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) (< (select .cse5 .cse8) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_77|) (< (select (store .cse9 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_56|) |c_~#queue~0.offset|) v_ArrVal_380) .cse4) 2147483647)))) .cse0))))) is different from false [2023-11-06 22:38:39,819 INFO L124 PetriNetUnfolderBase]: 1564/3057 cut-off events. [2023-11-06 22:38:39,819 INFO L125 PetriNetUnfolderBase]: For 4233/4233 co-relation queries the response was YES. [2023-11-06 22:38:39,832 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8994 conditions, 3057 events. 1564/3057 cut-off events. For 4233/4233 co-relation queries the response was YES. Maximal size of possible extension queue 134. Compared 19308 event pairs, 481 based on Foata normal form. 14/2812 useless extension candidates. Maximal degree in co-relation 8915. Up to 1675 conditions per place. [2023-11-06 22:38:39,845 INFO L140 encePairwiseOnDemand]: 477/499 looper letters, 189 selfloop transitions, 95 changer transitions 3/293 dead transitions. [2023-11-06 22:38:39,846 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 160 places, 293 transitions, 2246 flow [2023-11-06 22:38:39,846 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:38:39,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-06 22:38:39,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 4803 transitions. [2023-11-06 22:38:39,864 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38501002004008017 [2023-11-06 22:38:39,864 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 4803 transitions. [2023-11-06 22:38:39,864 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 4803 transitions. [2023-11-06 22:38:39,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:39,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 4803 transitions. [2023-11-06 22:38:39,880 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 192.12) internal successors, (4803), 25 states have internal predecessors, (4803), 0 states have call successors, (0), 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:39,904 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:39,908 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:39,908 INFO L175 Difference]: Start difference. First operand has 136 places, 136 transitions, 1096 flow. Second operand 25 states and 4803 transitions. [2023-11-06 22:38:39,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 160 places, 293 transitions, 2246 flow [2023-11-06 22:38:39,945 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 157 places, 293 transitions, 2188 flow, removed 24 selfloop flow, removed 3 redundant places. [2023-11-06 22:38:39,952 INFO L231 Difference]: Finished difference. Result has 166 places, 174 transitions, 1612 flow [2023-11-06 22:38:39,952 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=1050, PETRI_DIFFERENCE_MINUEND_PLACES=133, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=136, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=63, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=1612, PETRI_PLACES=166, PETRI_TRANSITIONS=174} [2023-11-06 22:38:39,953 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 108 predicate places. [2023-11-06 22:38:39,953 INFO L495 AbstractCegarLoop]: Abstraction has has 166 places, 174 transitions, 1612 flow [2023-11-06 22:38:39,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:39,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:39,956 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:39,968 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:40,162 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2023-11-06 22:38:40,164 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting t1Err1ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:38:40,164 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:40,165 INFO L85 PathProgramCache]: Analyzing trace with hash -1361142869, now seen corresponding path program 2 times [2023-11-06 22:38:40,165 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:40,165 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1475373154] [2023-11-06 22:38:40,165 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:40,165 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:40,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:41,254 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:41,254 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1475373154] [2023-11-06 22:38:41,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1475373154] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:41,254 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1582343031] [2023-11-06 22:38:41,255 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:38:41,255 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:41,255 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:41,256 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:41,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-06 22:38:41,402 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:38:41,402 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:38:41,404 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 22:38:41,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:41,433 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:41,435 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:41,436 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:41,471 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:38:41,471 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:41,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:41,520 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:38:41,523 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:41,534 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:41,537 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:41,755 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:41,960 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:42,206 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:42,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:42,345 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:42,463 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:42,671 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:42,970 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:38:42,970 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:38:43,191 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse0 (select (store (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) is different from false [2023-11-06 22:38:43,333 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68| Int)) (let ((.cse1 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse2 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse0 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse1 .cse2 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68| 1))) |c_~#stored_elements~0.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) (+ 3208 |c_~#queue~0.offset|)) 2147483647)))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68|)))) is different from false [2023-11-06 22:38:44,799 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:44,800 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1582343031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:38:44,800 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:38:44,800 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-11-06 22:38:44,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1278028614] [2023-11-06 22:38:44,800 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:38:44,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:38:44,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:38:44,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:38:44,803 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=269, Invalid=838, Unknown=23, NotChecked=130, Total=1260 [2023-11-06 22:38:45,471 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:38:45,475 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 166 places, 174 transitions, 1612 flow. Second operand has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:45,476 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:38:45,476 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:38:45,476 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:38:55,194 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_449 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))))) is different from false [2023-11-06 22:38:55,477 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_449 Int)) (let ((.cse3 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))) (forall ((v_ArrVal_447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68| Int) (v_ArrVal_449 Int)) (let ((.cse5 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse6 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse5 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~post38#1| 1)) .cse6 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68| 1))) |c_~#stored_elements~0.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select .cse5 .cse6) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_68|))))))) is different from false [2023-11-06 22:38:55,550 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 3208 |c_~#queue~0.offset|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse0 (select (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select (store .cse0 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse0 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))) (forall ((v_ArrVal_447 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_448 (Array Int Int)) (v_ArrVal_449 Int)) (let ((.cse3 (select (store (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_447) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_448) |c_~#queue~0.base|))) (or (< (select .cse3 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) (< (select (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63| Int) (v_ArrVal_449 Int)) (let ((.cse4 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select (store .cse4 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|) |c_~#queue~0.offset|) v_ArrVal_449) .cse1) 2147483647) (< (select .cse4 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_63|)))))) is different from false [2023-11-06 22:38:58,194 INFO L124 PetriNetUnfolderBase]: 2227/4336 cut-off events. [2023-11-06 22:38:58,194 INFO L125 PetriNetUnfolderBase]: For 14469/14771 co-relation queries the response was YES. [2023-11-06 22:38:58,218 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18016 conditions, 4336 events. 2227/4336 cut-off events. For 14469/14771 co-relation queries the response was YES. Maximal size of possible extension queue 188. Compared 29463 event pairs, 592 based on Foata normal form. 17/4043 useless extension candidates. Maximal degree in co-relation 17860. Up to 2368 conditions per place. [2023-11-06 22:38:58,240 INFO L140 encePairwiseOnDemand]: 469/499 looper letters, 208 selfloop transitions, 162 changer transitions 3/379 dead transitions. [2023-11-06 22:38:58,240 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 194 places, 379 transitions, 4013 flow [2023-11-06 22:38:58,241 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2023-11-06 22:38:58,241 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2023-11-06 22:38:58,248 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 5567 transitions. [2023-11-06 22:38:58,250 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.38470043535346554 [2023-11-06 22:38:58,250 INFO L72 ComplementDD]: Start complementDD. Operand 29 states and 5567 transitions. [2023-11-06 22:38:58,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 29 states and 5567 transitions. [2023-11-06 22:38:58,254 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:38:58,254 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 29 states and 5567 transitions. [2023-11-06 22:38:58,265 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 30 states, 29 states have (on average 191.9655172413793) internal successors, (5567), 29 states have internal predecessors, (5567), 0 states have call successors, (0), 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:58,280 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 30 states, 30 states have (on average 499.0) internal successors, (14970), 30 states have internal predecessors, (14970), 0 states have call successors, (0), 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:58,284 INFO L81 ComplementDD]: Finished complementDD. Result has 30 states, 30 states have (on average 499.0) internal successors, (14970), 30 states have internal predecessors, (14970), 0 states have call successors, (0), 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:58,284 INFO L175 Difference]: Start difference. First operand has 166 places, 174 transitions, 1612 flow. Second operand 29 states and 5567 transitions. [2023-11-06 22:38:58,284 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 194 places, 379 transitions, 4013 flow [2023-11-06 22:38:58,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 188 places, 379 transitions, 3867 flow, removed 59 selfloop flow, removed 6 redundant places. [2023-11-06 22:38:58,373 INFO L231 Difference]: Finished difference. Result has 202 places, 270 transitions, 2993 flow [2023-11-06 22:38:58,374 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=1508, PETRI_DIFFERENCE_MINUEND_PLACES=160, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=174, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=77, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=29, PETRI_FLOW=2993, PETRI_PLACES=202, PETRI_TRANSITIONS=270} [2023-11-06 22:38:58,375 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 144 predicate places. [2023-11-06 22:38:58,375 INFO L495 AbstractCegarLoop]: Abstraction has has 202 places, 270 transitions, 2993 flow [2023-11-06 22:38:58,376 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:58,377 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:38:58,377 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:38:58,389 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:38:58,589 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2023-11-06 22:38:58,589 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting t1Err0ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:38:58,590 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:38:58,590 INFO L85 PathProgramCache]: Analyzing trace with hash 575732308, now seen corresponding path program 1 times [2023-11-06 22:38:58,590 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:38:58,590 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [299982914] [2023-11-06 22:38:58,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:58,590 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:38:58,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:59,184 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:59,184 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:38:59,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [299982914] [2023-11-06 22:38:59,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [299982914] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:38:59,184 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1288869062] [2023-11-06 22:38:59,185 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:38:59,185 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:38:59,185 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:38:59,186 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:38:59,190 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-06 22:38:59,348 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:38:59,351 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 43 conjunts are in the unsatisfiable core [2023-11-06 22:38:59,354 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:38:59,390 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:38:59,390 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:59,615 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:59,668 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:59,753 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:59,799 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:38:59,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 18 treesize of output 13 [2023-11-06 22:38:59,907 INFO L322 Elim1Store]: treesize reduction 19, result has 36.7 percent of original size [2023-11-06 22:38:59,907 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:59,945 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:59,945 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:00,401 INFO L322 Elim1Store]: treesize reduction 17, result has 66.0 percent of original size [2023-11-06 22:39:00,402 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:39:00,434 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:39:00,434 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:39:00,455 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 271 treesize of output 259 [2023-11-06 22:39:00,480 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:39:00,901 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 270 treesize of output 262 [2023-11-06 22:39:00,930 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:00,932 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:00,944 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:00,945 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:00,966 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 304 treesize of output 292 [2023-11-06 22:39:01,007 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:01,008 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:01,016 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:01,017 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:39:01,034 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 270 treesize of output 262 [2023-11-06 22:39:01,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:01,231 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:39:01,231 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1288869062] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:01,231 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:01,231 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 26 [2023-11-06 22:39:01,231 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [306028639] [2023-11-06 22:39:01,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:01,232 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2023-11-06 22:39:01,232 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:01,233 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2023-11-06 22:39:01,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=596, Unknown=19, NotChecked=0, Total=756 [2023-11-06 22:39:03,314 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 184 out of 499 [2023-11-06 22:39:03,319 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 202 places, 270 transitions, 2993 flow. Second operand has 28 states, 28 states have (on average 185.67857142857142) internal successors, (5199), 28 states have internal predecessors, (5199), 0 states have call successors, (0), 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:03,319 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:03,319 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 184 of 499 [2023-11-06 22:39:03,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:04,844 INFO L124 PetriNetUnfolderBase]: 2334/4548 cut-off events. [2023-11-06 22:39:04,844 INFO L125 PetriNetUnfolderBase]: For 60410/61481 co-relation queries the response was YES. [2023-11-06 22:39:04,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29264 conditions, 4548 events. 2334/4548 cut-off events. For 60410/61481 co-relation queries the response was YES. Maximal size of possible extension queue 192. Compared 30925 event pairs, 1175 based on Foata normal form. 42/4251 useless extension candidates. Maximal degree in co-relation 28982. Up to 2519 conditions per place. [2023-11-06 22:39:04,908 INFO L140 encePairwiseOnDemand]: 489/499 looper letters, 222 selfloop transitions, 75 changer transitions 0/303 dead transitions. [2023-11-06 22:39:04,908 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 203 places, 303 transitions, 3852 flow [2023-11-06 22:39:04,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:39:04,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:39:04,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1188 transitions. [2023-11-06 22:39:04,912 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3967935871743487 [2023-11-06 22:39:04,912 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1188 transitions. [2023-11-06 22:39:04,912 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1188 transitions. [2023-11-06 22:39:04,913 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:04,913 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1188 transitions. [2023-11-06 22:39:04,915 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 198.0) internal successors, (1188), 6 states have internal predecessors, (1188), 0 states have call successors, (0), 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:04,919 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:39:04,919 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:39:04,920 INFO L175 Difference]: Start difference. First operand has 202 places, 270 transitions, 2993 flow. Second operand 6 states and 1188 transitions. [2023-11-06 22:39:04,920 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 203 places, 303 transitions, 3852 flow [2023-11-06 22:39:05,203 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 197 places, 303 transitions, 3515 flow, removed 129 selfloop flow, removed 6 redundant places. [2023-11-06 22:39:05,211 INFO L231 Difference]: Finished difference. Result has 198 places, 267 transitions, 2810 flow [2023-11-06 22:39:05,211 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=2617, PETRI_DIFFERENCE_MINUEND_PLACES=192, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=74, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=191, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=2810, PETRI_PLACES=198, PETRI_TRANSITIONS=267} [2023-11-06 22:39:05,213 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 140 predicate places. [2023-11-06 22:39:05,213 INFO L495 AbstractCegarLoop]: Abstraction has has 198 places, 267 transitions, 2810 flow [2023-11-06 22:39:05,214 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 28 states have (on average 185.67857142857142) internal successors, (5199), 28 states have internal predecessors, (5199), 0 states have call successors, (0), 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,214 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:05,215 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:05,227 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:05,421 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2023-11-06 22:39:05,421 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:39:05,423 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:05,423 INFO L85 PathProgramCache]: Analyzing trace with hash -1360770869, now seen corresponding path program 3 times [2023-11-06 22:39:05,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:05,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1187173435] [2023-11-06 22:39:05,424 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:05,424 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:05,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:06,628 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:39:06,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1187173435] [2023-11-06 22:39:06,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1187173435] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:06,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [793357171] [2023-11-06 22:39:06,628 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:39:06,629 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:06,629 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:06,631 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:06,658 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-06 22:39:06,837 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-06 22:39:06,837 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:39:06,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-06 22:39:06,844 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:06,868 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:06,869 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:06,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:06,905 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:39:06,906 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:06,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:06,923 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:06,928 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:06,972 INFO L322 Elim1Store]: treesize reduction 13, result has 48.0 percent of original size [2023-11-06 22:39:06,972 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:39:07,211 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 68 treesize of output 51 [2023-11-06 22:39:07,439 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 88 treesize of output 67 [2023-11-06 22:39:07,777 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 209 treesize of output 168 [2023-11-06 22:39:07,982 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:07,983 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 490 treesize of output 413 [2023-11-06 22:39:08,302 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 508 treesize of output 429 [2023-11-06 22:39:08,824 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 2095 treesize of output 1782 [2023-11-06 22:39:09,366 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:39:09,366 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:11,811 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 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_578 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_577))) (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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |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:39:11,855 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |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_577))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|)))))) is different from false [2023-11-06 22:39:11,891 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse1 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_577))) (let ((.cse0 (select .cse1 |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|)))))) is different from false [2023-11-06 22:39:11,931 WARN L839 $PredicateComparison]: unable to prove that (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| Int) (v_ArrVal_573 Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| Int) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse2 (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_573)) (.cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 .cse3 (+ |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98| 1)) .cse4 (+ |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78| 1))) |c_~#stored_elements~0.base| v_ArrVal_577))) (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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647) (< (select .cse2 .cse3) |v_t1Thread1of1ForFork0_enqueue_#t~post38#1_98|) (< (select .cse2 .cse4) |v_t1Thread1of1ForFork0_enqueue_#t~mem40#1_78|) (< (select .cse1 (+ |c_~#queue~0.offset| 3204)) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|)))))) is different from false [2023-11-06 22:39:12,452 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2023-11-06 22:39:12,453 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [793357171] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:12,453 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:12,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 11, 11] total 34 [2023-11-06 22:39:12,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023387036] [2023-11-06 22:39:12,453 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:12,454 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-06 22:39:12,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:12,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-06 22:39:12,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=253, Invalid=741, Unknown=14, NotChecked=252, Total=1260 [2023-11-06 22:39:12,731 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 183 out of 499 [2023-11-06 22:39:12,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 198 places, 267 transitions, 2810 flow. Second operand has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:12,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:12,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 183 of 499 [2023-11-06 22:39:12,737 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:16,822 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result VALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-06 22:39:23,170 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204)) (.cse2 (+ 3208 |c_~#queue~0.offset|))) (and (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 .cse1) |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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) .cse2) 2147483647)))) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_577 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse4 (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_577))) (let ((.cse3 (select .cse4 |c_~#queue~0.base|))) (or (< (select .cse3 .cse1) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) (< (select (select (store (store .cse4 |c_~#queue~0.base| (store .cse3 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76|) |c_~#queue~0.offset|) v_ArrVal_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) .cse2) 2147483647))))))) is different from false [2023-11-06 22:39:24,438 WARN L839 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_580 (Array Int Int)) (v_ArrVal_578 Int)) (< (select (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) 2147483647)) (forall ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_76| Int) (v_ArrVal_580 (Array Int Int)) (v_ArrVal_578 Int)) (let ((.cse0 (select |c_#memory_int| |c_~#queue~0.base|))) (or (< (select .cse0 (+ |c_~#queue~0.offset| 3204)) |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_578)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_580) |c_~#queue~0.base|) (+ 3208 |c_~#queue~0.offset|)) 2147483647))))) is different from false [2023-11-06 22:39:26,108 INFO L124 PetriNetUnfolderBase]: 3273/6325 cut-off events. [2023-11-06 22:39:26,108 INFO L125 PetriNetUnfolderBase]: For 83088/84036 co-relation queries the response was YES. [2023-11-06 22:39:26,161 INFO L83 FinitePrefix]: Finished finitePrefix Result has 39354 conditions, 6325 events. 3273/6325 cut-off events. For 83088/84036 co-relation queries the response was YES. Maximal size of possible extension queue 262. Compared 45664 event pairs, 815 based on Foata normal form. 45/5924 useless extension candidates. Maximal degree in co-relation 39074. Up to 3334 conditions per place. [2023-11-06 22:39:26,194 INFO L140 encePairwiseOnDemand]: 477/499 looper letters, 304 selfloop transitions, 163 changer transitions 3/476 dead transitions. [2023-11-06 22:39:26,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 218 places, 476 transitions, 6443 flow [2023-11-06 22:39:26,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-06 22:39:26,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2023-11-06 22:39:26,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 4059 transitions. [2023-11-06 22:39:26,202 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3873461208130547 [2023-11-06 22:39:26,203 INFO L72 ComplementDD]: Start complementDD. Operand 21 states and 4059 transitions. [2023-11-06 22:39:26,203 INFO L73 IsDeterministic]: Start isDeterministic. Operand 21 states and 4059 transitions. [2023-11-06 22:39:26,204 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:39:26,205 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 21 states and 4059 transitions. [2023-11-06 22:39:26,212 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 22 states, 21 states have (on average 193.28571428571428) internal successors, (4059), 21 states have internal predecessors, (4059), 0 states have call successors, (0), 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:26,222 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 22 states, 22 states have (on average 499.0) internal successors, (10978), 22 states have internal predecessors, (10978), 0 states have call successors, (0), 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:26,224 INFO L81 ComplementDD]: Finished complementDD. Result has 22 states, 22 states have (on average 499.0) internal successors, (10978), 22 states have internal predecessors, (10978), 0 states have call successors, (0), 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:26,225 INFO L175 Difference]: Start difference. First operand has 198 places, 267 transitions, 2810 flow. Second operand 21 states and 4059 transitions. [2023-11-06 22:39:26,225 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 218 places, 476 transitions, 6443 flow [2023-11-06 22:39:26,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 215 places, 476 transitions, 6147 flow, removed 75 selfloop flow, removed 3 redundant places. [2023-11-06 22:39:26,388 INFO L231 Difference]: Finished difference. Result has 224 places, 361 transitions, 4499 flow [2023-11-06 22:39:26,388 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=2678, PETRI_DIFFERENCE_MINUEND_PLACES=195, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=266, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=120, PETRI_DIFFERENCE_SUBTRAHEND_STATES=21, PETRI_FLOW=4499, PETRI_PLACES=224, PETRI_TRANSITIONS=361} [2023-11-06 22:39:26,388 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 166 predicate places. [2023-11-06 22:39:26,388 INFO L495 AbstractCegarLoop]: Abstraction has has 224 places, 361 transitions, 4499 flow [2023-11-06 22:39:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 36 states have (on average 184.33333333333334) internal successors, (6636), 36 states have internal predecessors, (6636), 0 states have call successors, (0), 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:26,389 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:26,389 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:39:26,396 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:39:26,596 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2023-11-06 22:39:26,597 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:39:26,597 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:26,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2031248015, now seen corresponding path program 1 times [2023-11-06 22:39:26,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:39:26,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224651553] [2023-11-06 22:39:26,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:26,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:39:26,621 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:27,394 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:27,394 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:39:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224651553] [2023-11-06 22:39:27,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224651553] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:39:27,394 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1198458590] [2023-11-06 22:39:27,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:27,395 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:39:27,395 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:27,399 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:39:27,418 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-06 22:39:27,570 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:27,573 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-06 22:39:27,576 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:27,598 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:27,599 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:27,600 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:27,612 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-06 22:39:27,612 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:39:27,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:27,627 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:39:27,635 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:27,638 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:27,811 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 62 treesize of output 45 [2023-11-06 22:39:27,907 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 69 treesize of output 50 [2023-11-06 22:39:30,119 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 71 treesize of output 50 [2023-11-06 22:39:34,287 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:34,288 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 130 treesize of output 101 [2023-11-06 22:39:40,461 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 149 treesize of output 116 [2023-11-06 22:39:46,722 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 384 treesize of output 299 [2023-11-06 22:39:55,132 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:55,132 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:39:55,311 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_646 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ |c_t1Thread1of1ForFork0_enqueue_#t~mem40#1| 1))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_646)) .cse1)) 2147483647)) is different from false [2023-11-06 22:39:55,322 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_646 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|))) (store .cse0 (+ |c_~#queue~0.offset| (* (select .cse0 .cse1) 4)) v_ArrVal_646)) .cse1)) 2147483647)) is different from false [2023-11-06 22:39:55,423 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (forall ((v_ArrVal_645 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_646 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|))) (store .cse0 (+ (* 4 (select .cse0 .cse1)) |c_~#queue~0.offset|) v_ArrVal_646)) .cse1)) 2147483647)) (= 800 .cse4)))) is different from false [2023-11-06 22:39:55,466 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_642 Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_646 Int)) (let ((.cse2 (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_642)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse4 (select .cse2 .cse3))) (or (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store (store .cse2 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse3 (+ .cse4 1))) |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_646)) .cse1)) 2147483647) (= .cse4 800))))) is different from false [2023-11-06 22:39:55,600 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:39:55,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1198458590] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:39:55,601 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:39:55,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 8, 10] total 27 [2023-11-06 22:39:55,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [646132550] [2023-11-06 22:39:55,601 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:39:55,605 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2023-11-06 22:39:55,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:39:55,612 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2023-11-06 22:39:55,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=159, Invalid=439, Unknown=18, NotChecked=196, Total=812 [2023-11-06 22:39:55,728 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 194 out of 499 [2023-11-06 22:39:55,733 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 224 places, 361 transitions, 4499 flow. Second operand has 29 states, 29 states have (on average 195.86206896551724) internal successors, (5680), 29 states have internal predecessors, (5680), 0 states have call successors, (0), 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:55,733 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:55,734 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 194 of 499 [2023-11-06 22:39:55,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:39:57,949 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (and (forall ((v_ArrVal_645 (Array Int Int)) (v_ArrVal_646 Int)) (< (select (let ((.cse0 (select (store |c_#memory_int| |c_~#stored_elements~0.base| v_ArrVal_645) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_646)) .cse1) 2147483647)) (forall ((v_ArrVal_646 Int)) (< (select (let ((.cse2 (select |c_#memory_int| |c_~#queue~0.base|))) (store .cse2 (+ (* (select .cse2 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_646)) .cse1) 2147483647)))) is different from false [2023-11-06 22:40:00,363 INFO L124 PetriNetUnfolderBase]: 4116/8029 cut-off events. [2023-11-06 22:40:00,363 INFO L125 PetriNetUnfolderBase]: For 143573/144064 co-relation queries the response was YES. [2023-11-06 22:40:00,452 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54668 conditions, 8029 events. 4116/8029 cut-off events. For 143573/144064 co-relation queries the response was YES. Maximal size of possible extension queue 319. Compared 61243 event pairs, 2167 based on Foata normal form. 130/7651 useless extension candidates. Maximal degree in co-relation 54480. Up to 5704 conditions per place. [2023-11-06 22:40:00,501 INFO L140 encePairwiseOnDemand]: 478/499 looper letters, 418 selfloop transitions, 128 changer transitions 1/553 dead transitions. [2023-11-06 22:40:00,501 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 247 places, 553 transitions, 8045 flow [2023-11-06 22:40:00,502 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2023-11-06 22:40:00,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2023-11-06 22:40:00,508 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 5044 transitions. [2023-11-06 22:40:00,511 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40432865731462925 [2023-11-06 22:40:00,511 INFO L72 ComplementDD]: Start complementDD. Operand 25 states and 5044 transitions. [2023-11-06 22:40:00,511 INFO L73 IsDeterministic]: Start isDeterministic. Operand 25 states and 5044 transitions. [2023-11-06 22:40:00,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:00,513 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 25 states and 5044 transitions. [2023-11-06 22:40:00,522 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 26 states, 25 states have (on average 201.76) internal successors, (5044), 25 states have internal predecessors, (5044), 0 states have call successors, (0), 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:40:00,534 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:40:00,537 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:40:00,537 INFO L175 Difference]: Start difference. First operand has 224 places, 361 transitions, 4499 flow. Second operand 25 states and 5044 transitions. [2023-11-06 22:40:00,537 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 247 places, 553 transitions, 8045 flow [2023-11-06 22:40:00,884 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 236 places, 553 transitions, 7646 flow, removed 161 selfloop flow, removed 11 redundant places. [2023-11-06 22:40:00,896 INFO L231 Difference]: Finished difference. Result has 247 places, 415 transitions, 5489 flow [2023-11-06 22:40:00,896 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4107, PETRI_DIFFERENCE_MINUEND_PLACES=212, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=354, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=68, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=232, PETRI_DIFFERENCE_SUBTRAHEND_STATES=25, PETRI_FLOW=5489, PETRI_PLACES=247, PETRI_TRANSITIONS=415} [2023-11-06 22:40:00,897 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 189 predicate places. [2023-11-06 22:40:00,897 INFO L495 AbstractCegarLoop]: Abstraction has has 247 places, 415 transitions, 5489 flow [2023-11-06 22:40:00,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 195.86206896551724) internal successors, (5680), 29 states have internal predecessors, (5680), 0 states have call successors, (0), 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:40:00,898 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:00,899 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:00,911 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-06 22:40:01,105 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2023-11-06 22:40:01,106 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:40:01,106 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:01,106 INFO L85 PathProgramCache]: Analyzing trace with hash -2031248038, now seen corresponding path program 1 times [2023-11-06 22:40:01,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:01,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [413961481] [2023-11-06 22:40:01,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:01,107 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:01,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:01,641 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:40:01,641 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [413961481] [2023-11-06 22:40:01,641 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [413961481] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:40:01,641 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1463152005] [2023-11-06 22:40:01,641 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:01,642 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:01,642 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:01,643 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,662 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-06 22:40:01,801 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:01,803 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 39 conjunts are in the unsatisfiable core [2023-11-06 22:40:01,810 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:02,052 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:40:02,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,114 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:40:02,242 INFO L322 Elim1Store]: treesize reduction 23, result has 23.3 percent of original size [2023-11-06 22:40:02,242 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:40:02,315 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:40:02,342 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:40:02,342 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:02,676 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:02,676 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:40:02,690 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:02,691 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:40:02,700 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:40:02,723 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:40:02,752 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:40:02,752 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:40:02,879 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:40:02,879 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1463152005] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:02,880 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:40:02,880 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 8, 8] total 22 [2023-11-06 22:40:02,880 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786025142] [2023-11-06 22:40:02,880 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:02,880 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:40:02,881 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:02,881 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:40:02,882 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=459, Unknown=2, NotChecked=0, Total=552 [2023-11-06 22:40:04,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 193 out of 499 [2023-11-06 22:40:04,102 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 247 places, 415 transitions, 5489 flow. Second operand has 24 states, 24 states have (on average 195.20833333333334) internal successors, (4685), 24 states have internal predecessors, (4685), 0 states have call successors, (0), 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:40:04,102 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:04,102 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 193 of 499 [2023-11-06 22:40:04,102 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:08,616 INFO L124 PetriNetUnfolderBase]: 5800/11131 cut-off events. [2023-11-06 22:40:08,616 INFO L125 PetriNetUnfolderBase]: For 262304/263964 co-relation queries the response was YES. [2023-11-06 22:40:08,779 INFO L83 FinitePrefix]: Finished finitePrefix Result has 80539 conditions, 11131 events. 5800/11131 cut-off events. For 262304/263964 co-relation queries the response was YES. Maximal size of possible extension queue 438. Compared 89947 event pairs, 1563 based on Foata normal form. 220/10569 useless extension candidates. Maximal degree in co-relation 79522. Up to 5748 conditions per place. [2023-11-06 22:40:09,130 INFO L140 encePairwiseOnDemand]: 483/499 looper letters, 479 selfloop transitions, 229 changer transitions 0/714 dead transitions. [2023-11-06 22:40:09,130 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 264 places, 714 transitions, 10914 flow [2023-11-06 22:40:09,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-06 22:40:09,133 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2023-11-06 22:40:09,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 3685 transitions. [2023-11-06 22:40:09,138 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4102649743932309 [2023-11-06 22:40:09,139 INFO L72 ComplementDD]: Start complementDD. Operand 18 states and 3685 transitions. [2023-11-06 22:40:09,139 INFO L73 IsDeterministic]: Start isDeterministic. Operand 18 states and 3685 transitions. [2023-11-06 22:40:09,140 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:09,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 18 states and 3685 transitions. [2023-11-06 22:40:09,146 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:40:09,155 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:40:09,156 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:40:09,157 INFO L175 Difference]: Start difference. First operand has 247 places, 415 transitions, 5489 flow. Second operand 18 states and 3685 transitions. [2023-11-06 22:40:09,157 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 264 places, 714 transitions, 10914 flow [2023-11-06 22:40:09,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 250 places, 714 transitions, 10553 flow, removed 98 selfloop flow, removed 14 redundant places. [2023-11-06 22:40:09,884 INFO L231 Difference]: Finished difference. Result has 256 places, 478 transitions, 6706 flow [2023-11-06 22:40:09,884 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=4962, PETRI_DIFFERENCE_MINUEND_PLACES=233, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=404, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=161, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=233, PETRI_DIFFERENCE_SUBTRAHEND_STATES=18, PETRI_FLOW=6706, PETRI_PLACES=256, PETRI_TRANSITIONS=478} [2023-11-06 22:40:09,885 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 198 predicate places. [2023-11-06 22:40:09,885 INFO L495 AbstractCegarLoop]: Abstraction has has 256 places, 478 transitions, 6706 flow [2023-11-06 22:40:09,886 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 195.20833333333334) internal successors, (4685), 24 states have internal predecessors, (4685), 0 states have call successors, (0), 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:40:09,886 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:09,886 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:09,891 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:10,086 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2023-11-06 22:40:10,087 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting t1Err3ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:40:10,087 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:10,087 INFO L85 PathProgramCache]: Analyzing trace with hash -1425808933, now seen corresponding path program 1 times [2023-11-06 22:40:10,087 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:10,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1439318416] [2023-11-06 22:40:10,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:10,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:10,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:11,232 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:40:11,232 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1439318416] [2023-11-06 22:40:11,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1439318416] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:40:11,232 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35201151] [2023-11-06 22:40:11,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:11,233 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:11,233 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:11,234 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:40:11,246 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-06 22:40:11,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:11,424 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-06 22:40:11,429 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:11,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:11,452 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:40:11,467 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:11,489 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:40:11,490 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:40:11,504 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:11,505 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:11,512 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:40:11,533 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:11,539 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:40:11,539 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:40:11,746 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 61 treesize of output 46 [2023-11-06 22:40:11,885 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 68 treesize of output 51 [2023-11-06 22:40:12,042 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 61 treesize of output 44 [2023-11-06 22:40:12,196 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 51 [2023-11-06 22:40:16,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:16,338 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 144 treesize of output 115 [2023-11-06 22:40:20,522 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 163 treesize of output 130 [2023-11-06 22:40:28,781 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 434 treesize of output 349 [2023-11-06 22:40:39,089 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:40:39,089 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:39,319 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) is different from false [2023-11-06 22:40:39,329 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) is different from false [2023-11-06 22:40:39,445 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) (= 800 (select .cse4 .cse3)))) is different from false [2023-11-06 22:40:39,474 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_773 Int) (v_ArrVal_778 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_779 Int)) (let ((.cse1 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|)) (.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_773))) (or (= (select .cse0 .cse1) 800) (< (let ((.cse3 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse2 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse0 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 .cse1 (+ (select .cse4 .cse1) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse2 (+ |c_~#queue~0.offset| (* (select .cse2 .cse3) 4)) v_ArrVal_779)) .cse3)) 2147483647)))) is different from false [2023-11-06 22:40:39,671 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-06 22:40:39,671 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35201151] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:39,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:40:39,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 11] total 29 [2023-11-06 22:40:39,672 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032151737] [2023-11-06 22:40:39,672 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:39,672 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-06 22:40:39,673 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:39,673 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-06 22:40:39,674 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=157, Invalid=541, Unknown=20, NotChecked=212, Total=930 [2023-11-06 22:40:39,843 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:40:39,847 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 256 places, 478 transitions, 6706 flow. Second operand has 31 states, 31 states have (on average 190.83870967741936) internal successors, (5916), 31 states have internal predecessors, (5916), 0 states have call successors, (0), 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:40:39,847 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:39,847 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:40:39,848 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:42,067 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_int| |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204)) (.cse10 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse6 (select .cse10 .cse5)) (.cse0 (select .cse14 .cse2))) (and (<= .cse0 1) (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (select (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse2) 2147483647)) (= 800 .cse6)) (= |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| .cse6) (not (= |c_~#queue~0.base| |c_~#stored_elements~0.base|)) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_773 Int) (v_ArrVal_778 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_779 Int)) (let ((.cse7 (store .cse10 (+ (* |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 4) |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) v_ArrVal_773))) (or (= (select .cse7 .cse5) 800) (< (select (let ((.cse8 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse9 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse7 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse9 .cse5 (+ (select .cse9 .cse5) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse8 (+ |c_~#queue~0.offset| (* (select .cse8 .cse2) 4)) v_ArrVal_779)) .cse2) 2147483647)))) (<= |c_t1Thread1of1ForFork0_enqueue_#t~mem36#1| 1) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_773 Int) (v_ArrVal_778 (Array Int Int)) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98| Int) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_779 Int)) (let ((.cse13 (store .cse14 (+ (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) |c_~#queue~0.offset|) v_ArrVal_773))) (or (< .cse0 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_98|) (< (select (let ((.cse11 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_~#queue~0.base| (let ((.cse12 (select (store (store |c_#memory_int| |c_~#queue~0.base| (store .cse13 (+ 3208 |c_~#queue~0.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_~#queue~0.base|))) (store .cse12 .cse2 (+ (select .cse12 .cse2) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse11 (+ |c_~#queue~0.offset| (* (select .cse11 .cse2) 4)) v_ArrVal_779)) .cse2) 2147483647) (= (select .cse13 .cse2) 800))))))) is different from false [2023-11-06 22:40:42,828 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse3 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select .cse4 .cse3))) (and (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse2 (select (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (store .cse4 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|))) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776) |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse2 .cse3 (+ (select .cse2 .cse3) 1)))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) (= 800 .cse5)) (<= .cse5 1)))) is different from false [2023-11-06 22:40:44,007 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| 5))) (let ((.cse5 (select .cse7 3204))) (and (let ((.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) (= 800 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4)))) (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= .cse5 800)) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_DerPreprocessor_87 Int)) (let ((.cse10 ((as const (Array Int Int)) 0)) (.cse12 (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))) (let ((.cse11 (store (store (store .cse10 3200 (select .cse7 3200)) 3208 (select .cse7 3208)) .cse12 (select .cse7 .cse12)))) (let ((.cse8 (store .cse11 3204 .cse5))) (let ((.cse6 (select (store (store (store (store .cse10 3200 (select .cse11 3200)) 3204 v_DerPreprocessor_87) 3208 (select .cse11 3208)) .cse12 (select .cse8 .cse12)) 3204))) (and (<= .cse6 0) (= .cse7 (let ((.cse9 (* .cse5 4))) (store .cse8 .cse9 (select .cse7 .cse9)))) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| .cse6) (= .cse5 (+ .cse6 1)))))))) (not (= .cse5 802))))) is different from false [2023-11-06 22:40:44,520 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4))) (and (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) (= 800 .cse5)) (<= .cse5 1)))) is different from false [2023-11-06 22:40:44,571 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_int| 5))) (let ((.cse0 (select .cse7 3204))) (and (= |c_t1Thread1of1ForFork0_enqueue_~q#1.offset| 0) (not (= .cse0 800)) (= 5 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse5 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store .cse4 .cse5 (+ (select .cse4 .cse5) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse2)) 2147483647)) (exists ((|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| Int) (v_DerPreprocessor_87 Int)) (let ((.cse10 ((as const (Array Int Int)) 0)) (.cse12 (* 4 |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93|))) (let ((.cse11 (store (store (store .cse10 3200 (select .cse7 3200)) 3208 (select .cse7 3208)) .cse12 (select .cse7 .cse12)))) (let ((.cse8 (store .cse11 3204 .cse0))) (let ((.cse6 (select (store (store (store (store .cse10 3200 (select .cse11 3200)) 3204 v_DerPreprocessor_87) 3208 (select .cse11 3208)) .cse12 (select .cse8 .cse12)) 3204))) (and (<= .cse6 0) (= .cse7 (let ((.cse9 (* .cse0 4))) (store .cse8 .cse9 (select .cse7 .cse9)))) (<= |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_93| .cse6) (= .cse0 (+ .cse6 1)))))))) (not (= .cse0 802))))) is different from false [2023-11-06 22:40:44,886 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (and (<= (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse0) 1) (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse2 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse1 (select (store (let ((.cse3 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse4 (select .cse3 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse4 .cse0 (+ (select .cse4 .cse0) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse1 (+ (* (select .cse1 .cse2) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse2)) 2147483647)))) is different from false [2023-11-06 22:40:44,921 WARN L839 $PredicateComparison]: unable to prove that (let ((.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (let ((.cse5 (select (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|) .cse4))) (and (or (forall ((v_ArrVal_776 (Array Int Int)) (v_ArrVal_778 (Array Int Int)) (v_ArrVal_779 Int)) (< (let ((.cse1 (+ |c_~#queue~0.offset| 3204))) (select (let ((.cse0 (select (store (let ((.cse2 (store |c_#memory_int| |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_776))) (store .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select .cse2 |c_t1Thread1of1ForFork0_enqueue_~q#1.base|))) (store .cse3 .cse4 (+ (select .cse3 .cse4) 1))))) |c_~#stored_elements~0.base| v_ArrVal_778) |c_~#queue~0.base|))) (store .cse0 (+ (* (select .cse0 .cse1) 4) |c_~#queue~0.offset|) v_ArrVal_779)) .cse1)) 2147483647)) (= 800 .cse5)) (< .cse5 2147483647)))) is different from false [2023-11-06 22:40:49,587 INFO L124 PetriNetUnfolderBase]: 6465/12517 cut-off events. [2023-11-06 22:40:49,587 INFO L125 PetriNetUnfolderBase]: For 307738/309775 co-relation queries the response was YES. [2023-11-06 22:40:49,741 INFO L83 FinitePrefix]: Finished finitePrefix Result has 93981 conditions, 12517 events. 6465/12517 cut-off events. For 307738/309775 co-relation queries the response was YES. Maximal size of possible extension queue 494. Compared 103313 event pairs, 1759 based on Foata normal form. 321/12006 useless extension candidates. Maximal degree in co-relation 93380. Up to 7978 conditions per place. [2023-11-06 22:40:49,817 INFO L140 encePairwiseOnDemand]: 475/499 looper letters, 601 selfloop transitions, 207 changer transitions 3/817 dead transitions. [2023-11-06 22:40:49,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 289 places, 817 transitions, 13534 flow [2023-11-06 22:40:49,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 34 states. [2023-11-06 22:40:49,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2023-11-06 22:40:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 6721 transitions. [2023-11-06 22:40:49,826 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3961452316397501 [2023-11-06 22:40:49,826 INFO L72 ComplementDD]: Start complementDD. Operand 34 states and 6721 transitions. [2023-11-06 22:40:49,826 INFO L73 IsDeterministic]: Start isDeterministic. Operand 34 states and 6721 transitions. [2023-11-06 22:40:49,828 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:49,829 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 34 states and 6721 transitions. [2023-11-06 22:40:49,839 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 35 states, 34 states have (on average 197.6764705882353) internal successors, (6721), 34 states have internal predecessors, (6721), 0 states have call successors, (0), 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:40:49,855 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 35 states, 35 states have (on average 499.0) internal successors, (17465), 35 states have internal predecessors, (17465), 0 states have call successors, (0), 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:40:49,858 INFO L81 ComplementDD]: Finished complementDD. Result has 35 states, 35 states have (on average 499.0) internal successors, (17465), 35 states have internal predecessors, (17465), 0 states have call successors, (0), 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:40:49,858 INFO L175 Difference]: Start difference. First operand has 256 places, 478 transitions, 6706 flow. Second operand 34 states and 6721 transitions. [2023-11-06 22:40:49,858 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 289 places, 817 transitions, 13534 flow [2023-11-06 22:40:50,732 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 285 places, 817 transitions, 13216 flow, removed 134 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:50,746 INFO L231 Difference]: Finished difference. Result has 307 places, 585 transitions, 9160 flow [2023-11-06 22:40:50,747 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=499, PETRI_DIFFERENCE_MINUEND_FLOW=6202, PETRI_DIFFERENCE_MINUEND_PLACES=252, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=463, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=92, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=302, PETRI_DIFFERENCE_SUBTRAHEND_STATES=34, PETRI_FLOW=9160, PETRI_PLACES=307, PETRI_TRANSITIONS=585} [2023-11-06 22:40:50,748 INFO L281 CegarLoopForPetriNet]: 58 programPoint places, 249 predicate places. [2023-11-06 22:40:50,748 INFO L495 AbstractCegarLoop]: Abstraction has has 307 places, 585 transitions, 9160 flow [2023-11-06 22:40:50,748 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 31 states, 31 states have (on average 190.83870967741936) internal successors, (5916), 31 states have internal predecessors, (5916), 0 states have call successors, (0), 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:40:50,748 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:50,749 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:50,754 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:50,949 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:50,949 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting t1Err2ASSERT_VIOLATIONINTEGER_OVERFLOW === [ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES, ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (and 24 more)] === [2023-11-06 22:40:50,950 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:50,950 INFO L85 PathProgramCache]: Analyzing trace with hash 1472164222, now seen corresponding path program 1 times [2023-11-06 22:40:50,950 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-06 22:40:50,950 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1447406022] [2023-11-06 22:40:50,950 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:50,950 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-06 22:40:50,975 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:51,697 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:40:51,698 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-06 22:40:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1447406022] [2023-11-06 22:40:51,698 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1447406022] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-06 22:40:51,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1385098736] [2023-11-06 22:40:51,698 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:51,698 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-06 22:40:51,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:40:51,699 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-06 22:40:51,715 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_3a52fc78-c62b-421e-b79d-74feb375a331/bin/uautomizer-verify-WvqO1wxjHP/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-06 22:40:51,863 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:51,865 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 50 conjunts are in the unsatisfiable core [2023-11-06 22:40:51,873 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:51,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:51,903 INFO L322 Elim1Store]: treesize reduction 9, result has 47.1 percent of original size [2023-11-06 22:40:51,903 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:40:51,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:51,911 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:40:51,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:51,922 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:51,926 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:40:51,939 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-06 22:40:51,943 INFO L322 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-06 22:40:51,943 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:40:52,105 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:40:52,211 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:40:52,405 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 52 treesize of output 39 [2023-11-06 22:40:52,481 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:52,481 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 76 treesize of output 59 [2023-11-06 22:40:52,640 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 94 treesize of output 75 [2023-11-06 22:40:52,886 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 336 treesize of output 271 [2023-11-06 22:40:53,141 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 343 treesize of output 278 [2023-11-06 22:40:53,581 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:40:53,581 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:54,165 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (select |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base|)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_851))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ 2147483650 (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_854) |c_~#queue~0.base|) .cse2))) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|))))) is different from false [2023-11-06 22:40:54,199 WARN L839 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_854 (Array Int Int)) (|t1Thread1of1ForFork0_enqueue_#t~post38#1| Int) (|v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| Int) (v_ArrVal_848 Int) (v_ArrVal_851 (Array Int Int)) (v_ArrVal_853 Int)) (let ((.cse0 (store (store |c_#memory_int| |c_t1Thread1of1ForFork0_enqueue_~q#1.base| (let ((.cse3 (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_848)) (.cse4 (+ 3204 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|))) (store (store .cse3 (+ 3208 |c_t1Thread1of1ForFork0_enqueue_~q#1.offset|) (+ 1 |t1Thread1of1ForFork0_enqueue_#t~post38#1|)) .cse4 (+ (select .cse3 .cse4) 1)))) |c_~#stored_elements~0.base| v_ArrVal_851))) (let ((.cse1 (select .cse0 |c_~#queue~0.base|)) (.cse2 (+ |c_~#queue~0.offset| 3204))) (or (< 0 (+ (select (select (store (store .cse0 |c_~#queue~0.base| (store .cse1 (+ (* |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102| 4) |c_~#queue~0.offset|) v_ArrVal_853)) |c_ULTIMATE.start_main_~#id2~0#1.base| v_ArrVal_854) |c_~#queue~0.base|) .cse2) 2147483650)) (< (select .cse1 .cse2) |v_t1Thread1of1ForFork0_enqueue_#t~mem36#1_102|))))) is different from false [2023-11-06 22:40:54,441 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:40:54,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1385098736] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:54,442 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-06 22:40:54,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 10] total 28 [2023-11-06 22:40:54,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598658069] [2023-11-06 22:40:54,442 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:54,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2023-11-06 22:40:54,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-06 22:40:54,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2023-11-06 22:40:54,444 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=141, Invalid=596, Unknown=27, NotChecked=106, Total=870 [2023-11-06 22:40:54,663 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 189 out of 499 [2023-11-06 22:40:54,668 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 307 places, 585 transitions, 9160 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:40:54,668 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:54,668 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 189 of 499 [2023-11-06 22:40:54,668 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand