./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version cf1a7837 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_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:14:47,391 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:14:47,481 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-12 02:14:47,486 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:14:47,487 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:14:47,519 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:14:47,520 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:14:47,521 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:14:47,521 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:14:47,522 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:14:47,523 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:14:47,524 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:14:47,524 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:14:47,525 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:14:47,525 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:14:47,526 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:14:47,527 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:14:47,527 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:14:47,528 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-12 02:14:47,528 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-12 02:14:47,529 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-12 02:14:47,530 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:14:47,530 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-12 02:14:47,531 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-12 02:14:47,532 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:14:47,532 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:14:47,533 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:14:47,533 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:14:47,534 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:14:47,535 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:47,535 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:14:47,536 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:14:47,536 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:14:47,537 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:14:47,537 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:14:47,537 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:14:47,538 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:14:47,538 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:14:47,539 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_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/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_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 773055aaa90ff8ec223993b190a157a4b1c15a4828ef014894ca730726d954aa [2023-11-12 02:14:47,866 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:14:47,895 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:14:47,898 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:14:47,900 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:14:47,901 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:14:47,916 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:14:51,046 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:14:51,348 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:14:51,349 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/sv-benchmarks/c/pthread-wmm/mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:14:51,371 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/data/e7cb2d06e/9d7645cab01f4613a8d2f206af91d0c6/FLAGdc4f524fe [2023-11-12 02:14:51,389 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/data/e7cb2d06e/9d7645cab01f4613a8d2f206af91d0c6 [2023-11-12 02:14:51,398 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:14:51,404 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:14:51,405 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:51,409 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:14:51,416 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:14:51,418 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:51" (1/1) ... [2023-11-12 02:14:51,421 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46394ddf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:51, skipping insertion in model container [2023-11-12 02:14:51,421 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:14:51" (1/1) ... [2023-11-12 02:14:51,515 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:14:52,058 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:52,079 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:14:52,148 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:14:52,191 WARN L672 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:52,194 WARN L672 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-12 02:14:52,202 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:14:52,202 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52 WrapperNode [2023-11-12 02:14:52,203 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:14:52,204 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:52,204 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:14:52,204 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:14:52,213 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,237 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,272 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 150 [2023-11-12 02:14:52,273 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:14:52,273 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:14:52,274 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:14:52,274 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:14:52,284 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,284 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,289 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,289 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,302 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,305 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,308 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,311 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,316 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:14:52,317 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:14:52,325 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:14:52,325 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:14:52,326 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (1/1) ... [2023-11-12 02:14:52,334 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:14:52,350 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:14:52,375 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:14:52,409 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_7bb6ccea-1ec5-493d-9cc4-7302e1efb7d6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:14:52,422 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:14:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-12 02:14:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:14:52,423 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:14:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:14:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-12 02:14:52,424 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-12 02:14:52,424 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-12 02:14:52,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-12 02:14:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-12 02:14:52,426 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-12 02:14:52,426 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-12 02:14:52,427 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-12 02:14:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:14:52,427 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-12 02:14:52,429 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:14:52,429 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:14:52,431 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-12 02:14:52,665 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:14:52,669 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:14:53,219 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:14:53,411 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:14:53,412 INFO L302 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-12 02:14:53,415 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:53 BoogieIcfgContainer [2023-11-12 02:14:53,416 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:14:53,421 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:14:53,421 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:14:53,425 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:14:53,425 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:14:51" (1/3) ... [2023-11-12 02:14:53,426 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc15a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:53, skipping insertion in model container [2023-11-12 02:14:53,426 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:14:52" (2/3) ... [2023-11-12 02:14:53,429 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1dc15a79 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:14:53, skipping insertion in model container [2023-11-12 02:14:53,430 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:14:53" (3/3) ... [2023-11-12 02:14:53,431 INFO L112 eAbstractionObserver]: Analyzing ICFG mix008_power.oepc_pso.oepc_rmo.oepc.i [2023-11-12 02:14:53,447 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:14:53,448 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-12 02:14:53,448 INFO L521 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-12 02:14:53,523 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-12 02:14:53,576 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 162 places, 152 transitions, 320 flow [2023-11-12 02:14:53,650 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-12 02:14:53,651 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:53,661 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-12 02:14:53,661 INFO L82 GeneralOperation]: Start removeDead. Operand has 162 places, 152 transitions, 320 flow [2023-11-12 02:14:53,679 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 158 places, 148 transitions, 308 flow [2023-11-12 02:14:53,683 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-12 02:14:53,700 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-12 02:14:53,703 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 158 places, 148 transitions, 308 flow [2023-11-12 02:14:53,704 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 158 places, 148 transitions, 308 flow [2023-11-12 02:14:53,759 INFO L124 PetriNetUnfolderBase]: 3/148 cut-off events. [2023-11-12 02:14:53,763 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:14:53,766 INFO L83 FinitePrefix]: Finished finitePrefix Result has 161 conditions, 148 events. 3/148 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 4. Compared 119 event pairs, 0 based on Foata normal form. 0/134 useless extension candidates. Maximal degree in co-relation 107. Up to 2 conditions per place. [2023-11-12 02:14:53,771 INFO L119 LiptonReduction]: Number of co-enabled transitions 4214 [2023-11-12 02:15:00,078 INFO L134 LiptonReduction]: Checked pairs total: 12344 [2023-11-12 02:15:00,078 INFO L136 LiptonReduction]: Total number of compositions: 139 [2023-11-12 02:15:00,108 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:15:00,124 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=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7ac90b00, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:15:00,124 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-12 02:15:00,126 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-12 02:15:00,126 INFO L124 PetriNetUnfolderBase]: 0/0 cut-off events. [2023-11-12 02:15:00,127 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:00,127 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:00,128 INFO L208 CegarLoopForPetriNet]: trace histogram [1] [2023-11-12 02:15:00,128 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:00,136 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:00,137 INFO L85 PathProgramCache]: Analyzing trace with hash 652, now seen corresponding path program 1 times [2023-11-12 02:15:00,148 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:00,149 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1065499534] [2023-11-12 02:15:00,149 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:00,150 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:00,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:00,305 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-12 02:15:00,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:00,307 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1065499534] [2023-11-12 02:15:00,308 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1065499534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:00,308 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:00,308 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [0] imperfect sequences [] total 0 [2023-11-12 02:15:00,311 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1903472715] [2023-11-12 02:15:00,312 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:00,322 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2023-11-12 02:15:00,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:00,359 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2023-11-12 02:15:00,360 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2023-11-12 02:15:00,364 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 136 out of 291 [2023-11-12 02:15:00,369 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 42 transitions, 96 flow. Second operand has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:00,369 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:00,369 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 136 of 291 [2023-11-12 02:15:00,370 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:02,770 INFO L124 PetriNetUnfolderBase]: 8719/11889 cut-off events. [2023-11-12 02:15:02,770 INFO L125 PetriNetUnfolderBase]: For 52/52 co-relation queries the response was YES. [2023-11-12 02:15:02,814 INFO L83 FinitePrefix]: Finished finitePrefix Result has 23837 conditions, 11889 events. 8719/11889 cut-off events. For 52/52 co-relation queries the response was YES. Maximal size of possible extension queue 592. Compared 63774 event pairs, 8719 based on Foata normal form. 0/10380 useless extension candidates. Maximal degree in co-relation 23825. Up to 11731 conditions per place. [2023-11-12 02:15:02,928 INFO L140 encePairwiseOnDemand]: 282/291 looper letters, 28 selfloop transitions, 0 changer transitions 0/33 dead transitions. [2023-11-12 02:15:02,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 33 transitions, 134 flow [2023-11-12 02:15:02,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2023-11-12 02:15:02,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2023-11-12 02:15:02,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 309 transitions. [2023-11-12 02:15:02,956 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5309278350515464 [2023-11-12 02:15:02,957 INFO L72 ComplementDD]: Start complementDD. Operand 2 states and 309 transitions. [2023-11-12 02:15:02,957 INFO L73 IsDeterministic]: Start isDeterministic. Operand 2 states and 309 transitions. [2023-11-12 02:15:02,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:02,965 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 2 states and 309 transitions. [2023-11-12 02:15:02,973 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 3 states, 2 states have (on average 154.5) internal successors, (309), 2 states have internal predecessors, (309), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:02,980 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:02,981 INFO L81 ComplementDD]: Finished complementDD. Result has 3 states, 3 states have (on average 291.0) internal successors, (873), 3 states have internal predecessors, (873), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:02,984 INFO L175 Difference]: Start difference. First operand has 54 places, 42 transitions, 96 flow. Second operand 2 states and 309 transitions. [2023-11-12 02:15:02,985 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 33 transitions, 134 flow [2023-11-12 02:15:02,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:15:02,998 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 74 flow [2023-11-12 02:15:03,000 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=74, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=0, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=2, PETRI_FLOW=74, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-12 02:15:03,006 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -11 predicate places. [2023-11-12 02:15:03,006 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 74 flow [2023-11-12 02:15:03,007 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 136.5) internal successors, (273), 2 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:03,007 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:03,007 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-12 02:15:03,008 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:15:03,008 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:03,009 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:03,009 INFO L85 PathProgramCache]: Analyzing trace with hash 640939, now seen corresponding path program 1 times [2023-11-12 02:15:03,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:03,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551889632] [2023-11-12 02:15:03,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:03,011 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:03,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:03,387 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-12 02:15:03,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:03,388 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551889632] [2023-11-12 02:15:03,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551889632] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:03,388 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:03,389 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:03,389 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1176738787] [2023-11-12 02:15:03,389 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:03,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:03,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:03,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:03,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:03,400 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 135 out of 291 [2023-11-12 02:15:03,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:03,402 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:03,403 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 135 of 291 [2023-11-12 02:15:03,403 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:05,332 INFO L124 PetriNetUnfolderBase]: 6855/9898 cut-off events. [2023-11-12 02:15:05,332 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-12 02:15:05,365 INFO L83 FinitePrefix]: Finished finitePrefix Result has 19335 conditions, 9898 events. 6855/9898 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 511. Compared 61817 event pairs, 1263 based on Foata normal form. 0/9233 useless extension candidates. Maximal degree in co-relation 19332. Up to 7399 conditions per place. [2023-11-12 02:15:05,443 INFO L140 encePairwiseOnDemand]: 288/291 looper letters, 45 selfloop transitions, 2 changer transitions 2/54 dead transitions. [2023-11-12 02:15:05,444 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 54 transitions, 220 flow [2023-11-12 02:15:05,445 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:05,445 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:05,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 455 transitions. [2023-11-12 02:15:05,449 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5211912943871707 [2023-11-12 02:15:05,449 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 455 transitions. [2023-11-12 02:15:05,449 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 455 transitions. [2023-11-12 02:15:05,450 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:05,450 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 455 transitions. [2023-11-12 02:15:05,453 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 151.66666666666666) internal successors, (455), 3 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:05,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:05,465 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:05,466 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 74 flow. Second operand 3 states and 455 transitions. [2023-11-12 02:15:05,466 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 54 transitions, 220 flow [2023-11-12 02:15:05,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 54 transitions, 220 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:15:05,470 INFO L231 Difference]: Finished difference. Result has 44 places, 31 transitions, 74 flow [2023-11-12 02:15:05,471 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=72, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=32, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=74, PETRI_PLACES=44, PETRI_TRANSITIONS=31} [2023-11-12 02:15:05,473 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -10 predicate places. [2023-11-12 02:15:05,473 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 31 transitions, 74 flow [2023-11-12 02:15:05,474 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 136.0) internal successors, (408), 3 states have internal predecessors, (408), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:05,482 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:05,483 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:05,483 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:15:05,483 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:05,485 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:05,485 INFO L85 PathProgramCache]: Analyzing trace with hash 668078519, now seen corresponding path program 1 times [2023-11-12 02:15:05,485 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:05,486 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [539539171] [2023-11-12 02:15:05,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:05,487 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:05,597 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:05,930 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-12 02:15:05,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:05,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [539539171] [2023-11-12 02:15:05,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [539539171] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:05,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:05,935 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-12 02:15:05,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [131247994] [2023-11-12 02:15:05,936 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:05,937 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:15:05,937 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:05,938 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:15:05,939 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:15:05,976 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-12 02:15:05,977 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 31 transitions, 74 flow. Second operand has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:05,978 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:05,978 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-12 02:15:05,978 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:11,825 INFO L124 PetriNetUnfolderBase]: 31165/41738 cut-off events. [2023-11-12 02:15:11,825 INFO L125 PetriNetUnfolderBase]: For 1931/1931 co-relation queries the response was YES. [2023-11-12 02:15:11,925 INFO L83 FinitePrefix]: Finished finitePrefix Result has 85997 conditions, 41738 events. 31165/41738 cut-off events. For 1931/1931 co-relation queries the response was YES. Maximal size of possible extension queue 1254. Compared 230924 event pairs, 11139 based on Foata normal form. 0/40878 useless extension candidates. Maximal degree in co-relation 85993. Up to 23916 conditions per place. [2023-11-12 02:15:12,133 INFO L140 encePairwiseOnDemand]: 280/291 looper letters, 47 selfloop transitions, 10 changer transitions 0/57 dead transitions. [2023-11-12 02:15:12,133 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 57 transitions, 246 flow [2023-11-12 02:15:12,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:15:12,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-12 02:15:12,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 427 transitions. [2023-11-12 02:15:12,136 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48911798396334477 [2023-11-12 02:15:12,136 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 427 transitions. [2023-11-12 02:15:12,137 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 427 transitions. [2023-11-12 02:15:12,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:12,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 427 transitions. [2023-11-12 02:15:12,140 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 142.33333333333334) internal successors, (427), 3 states have internal predecessors, (427), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:12,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:12,144 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 291.0) internal successors, (1164), 4 states have internal predecessors, (1164), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:12,144 INFO L175 Difference]: Start difference. First operand has 44 places, 31 transitions, 74 flow. Second operand 3 states and 427 transitions. [2023-11-12 02:15:12,145 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 57 transitions, 246 flow [2023-11-12 02:15:12,147 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 57 transitions, 240 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:12,149 INFO L231 Difference]: Finished difference. Result has 45 places, 40 transitions, 148 flow [2023-11-12 02:15:12,149 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=70, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=31, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=21, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=148, PETRI_PLACES=45, PETRI_TRANSITIONS=40} [2023-11-12 02:15:12,150 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -9 predicate places. [2023-11-12 02:15:12,151 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 40 transitions, 148 flow [2023-11-12 02:15:12,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 126.66666666666667) internal successors, (380), 3 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:12,152 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:12,152 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:12,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-12 02:15:12,157 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:12,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:12,157 INFO L85 PathProgramCache]: Analyzing trace with hash -764403525, now seen corresponding path program 1 times [2023-11-12 02:15:12,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:12,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [514982068] [2023-11-12 02:15:12,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:12,159 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:12,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:12,486 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-12 02:15:12,487 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:12,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [514982068] [2023-11-12 02:15:12,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [514982068] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:12,488 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:12,488 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:12,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808087708] [2023-11-12 02:15:12,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:12,489 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:12,489 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:12,491 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:12,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:12,521 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-12 02:15:12,523 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 40 transitions, 148 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:12,523 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:12,523 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-12 02:15:12,523 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:17,096 INFO L124 PetriNetUnfolderBase]: 29699/39766 cut-off events. [2023-11-12 02:15:17,096 INFO L125 PetriNetUnfolderBase]: For 19036/19036 co-relation queries the response was YES. [2023-11-12 02:15:17,176 INFO L83 FinitePrefix]: Finished finitePrefix Result has 103289 conditions, 39766 events. 29699/39766 cut-off events. For 19036/19036 co-relation queries the response was YES. Maximal size of possible extension queue 1175. Compared 217779 event pairs, 6005 based on Foata normal form. 260/40026 useless extension candidates. Maximal degree in co-relation 103284. Up to 17001 conditions per place. [2023-11-12 02:15:17,338 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 70 selfloop transitions, 10 changer transitions 0/80 dead transitions. [2023-11-12 02:15:17,339 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 80 transitions, 428 flow [2023-11-12 02:15:17,339 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:17,339 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:17,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 565 transitions. [2023-11-12 02:15:17,342 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4853951890034364 [2023-11-12 02:15:17,342 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 565 transitions. [2023-11-12 02:15:17,343 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 565 transitions. [2023-11-12 02:15:17,343 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:17,343 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 565 transitions. [2023-11-12 02:15:17,345 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.25) internal successors, (565), 4 states have internal predecessors, (565), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:17,348 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:17,349 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:17,350 INFO L175 Difference]: Start difference. First operand has 45 places, 40 transitions, 148 flow. Second operand 4 states and 565 transitions. [2023-11-12 02:15:17,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 80 transitions, 428 flow [2023-11-12 02:15:17,550 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 80 transitions, 396 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-12 02:15:17,553 INFO L231 Difference]: Finished difference. Result has 49 places, 46 transitions, 206 flow [2023-11-12 02:15:17,553 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=30, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=206, PETRI_PLACES=49, PETRI_TRANSITIONS=46} [2023-11-12 02:15:17,555 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, -5 predicate places. [2023-11-12 02:15:17,555 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 46 transitions, 206 flow [2023-11-12 02:15:17,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:17,556 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:17,556 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:17,556 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-12 02:15:17,556 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:17,557 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:17,557 INFO L85 PathProgramCache]: Analyzing trace with hash -764401422, now seen corresponding path program 1 times [2023-11-12 02:15:17,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:17,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [589938984] [2023-11-12 02:15:17,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:17,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:17,614 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:18,489 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-12 02:15:18,489 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:18,490 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [589938984] [2023-11-12 02:15:18,490 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [589938984] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:18,490 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:18,490 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:15:18,491 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [840238165] [2023-11-12 02:15:18,491 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:18,491 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:15:18,491 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:18,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:15:18,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:18,868 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 118 out of 291 [2023-11-12 02:15:18,870 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 46 transitions, 206 flow. Second operand has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:18,870 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:18,870 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 118 of 291 [2023-11-12 02:15:18,870 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:20,392 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,393 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 186#true, 117#L829true, 65#L809true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-12 02:15:20,393 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,393 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,394 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 65#L809true, Black: 172#true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,395 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,395 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,395 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,395 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,396 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,396 INFO L294 olderBase$Statistics]: this new event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,396 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,396 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,397 INFO L297 olderBase$Statistics]: existing Event has 19 ancestors and is cut-off event [2023-11-12 02:15:20,894 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 119#L826true, Black: 172#true, 65#L809true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,894 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,894 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,895 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,895 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,896 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,896 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,896 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,896 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [139#L887true, 111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 186#true, 117#L829true, 65#L809true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 121#L773true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-12 02:15:20,897 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,897 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,897 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,897 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,898 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,899 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,899 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,899 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,899 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,900 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 63#L3true, 186#true, 117#L829true, 65#L809true, 136#P0EXITtrue, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 178#true, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,900 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,900 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,900 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,900 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,902 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,902 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,902 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,903 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,903 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,903 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 145#$Ultimate##0true, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 136#P0EXITtrue, Black: 172#true, 65#L809true, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:20,904 INFO L294 olderBase$Statistics]: this new event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,904 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,904 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:20,904 INFO L297 olderBase$Statistics]: existing Event has 20 ancestors and is cut-off event [2023-11-12 02:15:21,473 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([614] L887-->L871-2: Formula: (and (= (ite (= (ite (not (and (= 2 v_~__unbuffered_p2_EAX~0_22) (= 0 v_~__unbuffered_p3_EBX~0_28) (= v_~__unbuffered_p2_EBX~0_20 0) (= v_~__unbuffered_p3_EAX~0_20 1) (= v_~x~0_25 2) (= v_~y~0_26 2))) 1 0) 0) 0 1) v_~main$tmp_guard1~0_26) (= |v_#valid_196| (store |v_#valid_197| |v_ULTIMATE.start_main_~#t209~0#1.base_42| 0)) (= |v_ULTIMATE.start_main_#res#1_28| 0) (not (= (mod v_~main$tmp_guard1~0_26 256) 0))) InVars {~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, #valid=|v_#valid_197|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ULTIMATE.start_main_~#t209~0#1.base=|v_ULTIMATE.start_main_~#t209~0#1.base_42|, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} OutVars{ULTIMATE.start___VERIFIER_assert_~expression#1=|v_ULTIMATE.start___VERIFIER_assert_~expression#1_48|, ~__unbuffered_p2_EBX~0=v_~__unbuffered_p2_EBX~0_20, ULTIMATE.start_main_#res#1=|v_ULTIMATE.start_main_#res#1_28|, ULTIMATE.start_main_~#t209~0#1.offset=|v_ULTIMATE.start_main_~#t209~0#1.offset_32|, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_26, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_28, ULTIMATE.start___VERIFIER_assert_#in~expression#1=|v_ULTIMATE.start___VERIFIER_assert_#in~expression#1_36|, #valid=|v_#valid_196|, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_20, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_22, ~y~0=v_~y~0_26, ~x~0=v_~x~0_25} AuxVars[] AssignedVars[ULTIMATE.start___VERIFIER_assert_~expression#1, ULTIMATE.start___VERIFIER_assert_#in~expression#1, ULTIMATE.start_main_#res#1, ULTIMATE.start_main_~#t209~0#1.offset, #valid, ~main$tmp_guard1~0, ULTIMATE.start_main_~#t209~0#1.base][55], [111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 192#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (= (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|)), 125#L871-2true, 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:21,474 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,474 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,474 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,474 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,474 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([456] L786-->L793: Formula: (let ((.cse1 (not (= 0 (mod v_~a$r_buff1_thd2~0_16 256)))) (.cse5 (not (= (mod v_~a$r_buff0_thd2~0_18 256) 0))) (.cse0 (not (= (mod v_~a$w_buff0_used~0_111 256) 0)))) (let ((.cse3 (and .cse5 .cse0)) (.cse2 (and (not (= (mod v_~a$w_buff0_used~0_112 256) 0)) .cse5)) (.cse4 (and .cse1 (not (= (mod v_~a$w_buff1_used~0_103 256) 0))))) (and (= v_~a$r_buff1_thd2~0_15 (ite (or (and (not (= (mod v_~a$r_buff0_thd2~0_17 256) 0)) .cse0) (and (not (= (mod v_~a$w_buff1_used~0_102 256) 0)) .cse1)) 0 v_~a$r_buff1_thd2~0_16)) (= (ite .cse2 0 v_~a$w_buff0_used~0_112) v_~a$w_buff0_used~0_111) (= (ite (or .cse3 .cse4) 0 v_~a$w_buff1_used~0_103) v_~a$w_buff1_used~0_102) (= v_~a$r_buff0_thd2~0_17 (ite .cse3 0 v_~a$r_buff0_thd2~0_18)) (= v_~a~0_50 (ite .cse2 v_~a$w_buff0~0_34 (ite .cse4 v_~a$w_buff1~0_31 v_~a~0_51)))))) InVars {~a~0=v_~a~0_51, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_16, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_18, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_112, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_103} OutVars{~a~0=v_~a~0_50, ~a$w_buff1~0=v_~a$w_buff1~0_31, ~a$w_buff0~0=v_~a$w_buff0~0_34, ~a$r_buff1_thd2~0=v_~a$r_buff1_thd2~0_15, ~a$r_buff0_thd2~0=v_~a$r_buff0_thd2~0_17, ~a$w_buff0_used~0=v_~a$w_buff0_used~0_111, ~a$w_buff1_used~0=v_~a$w_buff1_used~0_102} AuxVars[] AssignedVars[~a~0, ~a$r_buff1_thd2~0, ~a$r_buff0_thd2~0, ~a$w_buff0_used~0, ~a$w_buff1_used~0][35], [139#L887true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 191#(and (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= |ULTIMATE.start_main_~#t210~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t210~0#1.base| 0) |ULTIMATE.start_main_~#t212~0#1.base| 0) |ULTIMATE.start_main_~#t209~0#1.base| 0) |ULTIMATE.start_main_~#t211~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t210~0#1.base|)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= |ULTIMATE.start_main_~#t211~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t211~0#1.base|)) (not (= |ULTIMATE.start_main_~#t212~0#1.base| |ULTIMATE.start_main_~#t209~0#1.base|))), 119#L826true, Black: 172#true, 65#L809true, 136#P0EXITtrue, 74#L793true, 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), Black: 178#true, P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse]) [2023-11-12 02:15:21,475 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L826-->L829: Formula: (= v_~__unbuffered_p3_EAX~0_1 v_~z~0_3) InVars {~z~0=v_~z~0_3} OutVars{~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_1, ~z~0=v_~z~0_3} AuxVars[] AssignedVars[~__unbuffered_p3_EAX~0][61], [139#L887true, 111#L786true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 186#true, 117#L829true, 65#L809true, 136#P0EXITtrue, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-12 02:15:21,475 INFO L294 olderBase$Statistics]: this new event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,475 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:21,476 INFO L297 olderBase$Statistics]: existing Event has 21 ancestors and is cut-off event [2023-11-12 02:15:22,164 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([546] $Ultimate##0-->L783: Formula: (and (= v_P1Thread1of1ForFork2_~arg.offset_5 |v_P1Thread1of1ForFork2_#in~arg.offset_5|) (= 2 v_~x~0_7) (= v_P1Thread1of1ForFork2_~arg.base_5 |v_P1Thread1of1ForFork2_#in~arg.base_5|)) InVars {P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|} OutVars{P1Thread1of1ForFork2_#in~arg.base=|v_P1Thread1of1ForFork2_#in~arg.base_5|, P1Thread1of1ForFork2_~arg.offset=v_P1Thread1of1ForFork2_~arg.offset_5, P1Thread1of1ForFork2_~arg.base=v_P1Thread1of1ForFork2_~arg.base_5, P1Thread1of1ForFork2_#in~arg.offset=|v_P1Thread1of1ForFork2_#in~arg.offset_5|, ~x~0=v_~x~0_7} AuxVars[] AssignedVars[P1Thread1of1ForFork2_~arg.offset, P1Thread1of1ForFork2_~arg.base, ~x~0][60], [130#L806true, P1Thread1of1ForFork2InUse, P3Thread1of1ForFork3InUse, 80#P3EXITtrue, 186#true, 57#L766true, Black: 174#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 106#ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAKtrue, Black: 181#(or (not (= 2 ~y~0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= ~__unbuffered_p2_EBX~0 0)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= 2 ~__unbuffered_p2_EAX~0))), 165#true, Black: 180#(<= ~__unbuffered_p2_EAX~0 0), P0Thread1of1ForFork0InUse, 92#L783true, P2Thread1of1ForFork1InUse, 178#true]) [2023-11-12 02:15:22,164 INFO L294 olderBase$Statistics]: this new event has 22 ancestors and is cut-off event [2023-11-12 02:15:22,164 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:15:22,164 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:15:22,164 INFO L297 olderBase$Statistics]: existing Event has 22 ancestors and is cut-off event [2023-11-12 02:15:23,272 INFO L124 PetriNetUnfolderBase]: 22680/31858 cut-off events. [2023-11-12 02:15:23,272 INFO L125 PetriNetUnfolderBase]: For 18827/20225 co-relation queries the response was YES. [2023-11-12 02:15:23,366 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82154 conditions, 31858 events. 22680/31858 cut-off events. For 18827/20225 co-relation queries the response was YES. Maximal size of possible extension queue 1291. Compared 198480 event pairs, 3101 based on Foata normal form. 1714/32370 useless extension candidates. Maximal degree in co-relation 82147. Up to 19909 conditions per place. [2023-11-12 02:15:23,490 INFO L140 encePairwiseOnDemand]: 283/291 looper letters, 64 selfloop transitions, 7 changer transitions 24/105 dead transitions. [2023-11-12 02:15:23,491 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 105 transitions, 602 flow [2023-11-12 02:15:23,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:15:23,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:15:23,499 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 899 transitions. [2023-11-12 02:15:23,502 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4413352970054001 [2023-11-12 02:15:23,502 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 899 transitions. [2023-11-12 02:15:23,502 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 899 transitions. [2023-11-12 02:15:23,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:23,506 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 899 transitions. [2023-11-12 02:15:23,512 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 128.42857142857142) internal successors, (899), 7 states have internal predecessors, (899), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,519 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,522 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,522 INFO L175 Difference]: Start difference. First operand has 49 places, 46 transitions, 206 flow. Second operand 7 states and 899 transitions. [2023-11-12 02:15:23,522 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 105 transitions, 602 flow [2023-11-12 02:15:23,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 105 transitions, 599 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-12 02:15:23,826 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 231 flow [2023-11-12 02:15:23,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=203, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=231, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-12 02:15:23,826 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 2 predicate places. [2023-11-12 02:15:23,827 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 231 flow [2023-11-12 02:15:23,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 119.71428571428571) internal successors, (838), 7 states have internal predecessors, (838), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:23,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:23,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:23,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-12 02:15:23,828 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:23,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:23,829 INFO L85 PathProgramCache]: Analyzing trace with hash -201701862, now seen corresponding path program 1 times [2023-11-12 02:15:23,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:23,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [893919875] [2023-11-12 02:15:23,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:23,829 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:23,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:24,594 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-12 02:15:24,595 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:24,595 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [893919875] [2023-11-12 02:15:24,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [893919875] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:24,595 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:24,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-12 02:15:24,596 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578283511] [2023-11-12 02:15:24,596 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:24,596 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-12 02:15:24,597 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:24,598 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-12 02:15:24,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-12 02:15:24,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 116 out of 291 [2023-11-12 02:15:24,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 231 flow. Second operand has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:24,926 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:24,926 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 116 of 291 [2023-11-12 02:15:24,926 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:28,203 INFO L124 PetriNetUnfolderBase]: 15869/22260 cut-off events. [2023-11-12 02:15:28,203 INFO L125 PetriNetUnfolderBase]: For 19864/20592 co-relation queries the response was YES. [2023-11-12 02:15:28,284 INFO L83 FinitePrefix]: Finished finitePrefix Result has 59503 conditions, 22260 events. 15869/22260 cut-off events. For 19864/20592 co-relation queries the response was YES. Maximal size of possible extension queue 953. Compared 133265 event pairs, 5036 based on Foata normal form. 1056/22318 useless extension candidates. Maximal degree in co-relation 59493. Up to 15732 conditions per place. [2023-11-12 02:15:28,366 INFO L140 encePairwiseOnDemand]: 285/291 looper letters, 46 selfloop transitions, 4 changer transitions 20/83 dead transitions. [2023-11-12 02:15:28,367 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 83 transitions, 491 flow [2023-11-12 02:15:28,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-12 02:15:28,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-12 02:15:28,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 868 transitions. [2023-11-12 02:15:28,371 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4261168384879725 [2023-11-12 02:15:28,371 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 868 transitions. [2023-11-12 02:15:28,371 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 868 transitions. [2023-11-12 02:15:28,372 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:28,372 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 868 transitions. [2023-11-12 02:15:28,375 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 124.0) internal successors, (868), 7 states have internal predecessors, (868), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,380 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,381 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 291.0) internal successors, (2328), 8 states have internal predecessors, (2328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,381 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 231 flow. Second operand 7 states and 868 transitions. [2023-11-12 02:15:28,382 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 83 transitions, 491 flow [2023-11-12 02:15:28,499 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 83 transitions, 477 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-12 02:15:28,500 INFO L231 Difference]: Finished difference. Result has 55 places, 42 transitions, 197 flow [2023-11-12 02:15:28,501 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=213, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=197, PETRI_PLACES=55, PETRI_TRANSITIONS=42} [2023-11-12 02:15:28,501 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 1 predicate places. [2023-11-12 02:15:28,502 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 42 transitions, 197 flow [2023-11-12 02:15:28,502 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 117.85714285714286) internal successors, (825), 7 states have internal predecessors, (825), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,502 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:28,503 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:28,503 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-12 02:15:28,503 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:28,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:28,503 INFO L85 PathProgramCache]: Analyzing trace with hash -1957883382, now seen corresponding path program 1 times [2023-11-12 02:15:28,504 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:28,504 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1392674673] [2023-11-12 02:15:28,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:28,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:28,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:28,699 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-12 02:15:28,700 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:28,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1392674673] [2023-11-12 02:15:28,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1392674673] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:28,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:28,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-12 02:15:28,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1603792746] [2023-11-12 02:15:28,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:28,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:28,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:28,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:28,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:28,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 123 out of 291 [2023-11-12 02:15:28,726 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 42 transitions, 197 flow. Second operand has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:28,726 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:28,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 123 of 291 [2023-11-12 02:15:28,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:31,539 INFO L124 PetriNetUnfolderBase]: 17095/23194 cut-off events. [2023-11-12 02:15:31,539 INFO L125 PetriNetUnfolderBase]: For 16909/16909 co-relation queries the response was YES. [2023-11-12 02:15:31,610 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63986 conditions, 23194 events. 17095/23194 cut-off events. For 16909/16909 co-relation queries the response was YES. Maximal size of possible extension queue 670. Compared 122824 event pairs, 2719 based on Foata normal form. 32/23226 useless extension candidates. Maximal degree in co-relation 63976. Up to 13129 conditions per place. [2023-11-12 02:15:31,718 INFO L140 encePairwiseOnDemand]: 281/291 looper letters, 65 selfloop transitions, 19 changer transitions 0/84 dead transitions. [2023-11-12 02:15:31,718 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 84 transitions, 510 flow [2023-11-12 02:15:31,719 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:15:31,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-12 02:15:31,722 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 567 transitions. [2023-11-12 02:15:31,722 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.48711340206185566 [2023-11-12 02:15:31,723 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 567 transitions. [2023-11-12 02:15:31,723 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 567 transitions. [2023-11-12 02:15:31,723 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:31,724 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 567 transitions. [2023-11-12 02:15:31,726 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 141.75) internal successors, (567), 4 states have internal predecessors, (567), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,729 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,730 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 291.0) internal successors, (1455), 5 states have internal predecessors, (1455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,730 INFO L175 Difference]: Start difference. First operand has 55 places, 42 transitions, 197 flow. Second operand 4 states and 567 transitions. [2023-11-12 02:15:31,730 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 84 transitions, 510 flow [2023-11-12 02:15:31,769 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 84 transitions, 495 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-12 02:15:31,772 INFO L231 Difference]: Finished difference. Result has 54 places, 49 transitions, 299 flow [2023-11-12 02:15:31,773 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=26, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=299, PETRI_PLACES=54, PETRI_TRANSITIONS=49} [2023-11-12 02:15:31,774 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 0 predicate places. [2023-11-12 02:15:31,774 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 49 transitions, 299 flow [2023-11-12 02:15:31,775 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 126.75) internal successors, (507), 4 states have internal predecessors, (507), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:31,775 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:31,775 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:31,775 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-12 02:15:31,776 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:31,776 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:31,776 INFO L85 PathProgramCache]: Analyzing trace with hash -494658592, now seen corresponding path program 1 times [2023-11-12 02:15:31,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:31,777 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1319907391] [2023-11-12 02:15:31,777 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:31,777 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:31,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:32,011 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-12 02:15:32,012 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:32,012 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1319907391] [2023-11-12 02:15:32,012 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1319907391] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:32,013 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:32,013 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:32,013 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1576772140] [2023-11-12 02:15:32,013 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:32,014 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:32,014 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:32,014 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:32,015 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:32,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 126 out of 291 [2023-11-12 02:15:32,039 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 49 transitions, 299 flow. Second operand has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:32,039 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:32,039 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 126 of 291 [2023-11-12 02:15:32,039 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-12 02:15:34,400 INFO L124 PetriNetUnfolderBase]: 10478/15605 cut-off events. [2023-11-12 02:15:34,401 INFO L125 PetriNetUnfolderBase]: For 15930/16996 co-relation queries the response was YES. [2023-11-12 02:15:34,462 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42499 conditions, 15605 events. 10478/15605 cut-off events. For 15930/16996 co-relation queries the response was YES. Maximal size of possible extension queue 815. Compared 101342 event pairs, 1659 based on Foata normal form. 1660/16806 useless extension candidates. Maximal degree in co-relation 42487. Up to 9162 conditions per place. [2023-11-12 02:15:34,522 INFO L140 encePairwiseOnDemand]: 284/291 looper letters, 88 selfloop transitions, 10 changer transitions 0/115 dead transitions. [2023-11-12 02:15:34,522 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 58 places, 115 transitions, 796 flow [2023-11-12 02:15:34,523 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-12 02:15:34,523 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-12 02:15:34,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 702 transitions. [2023-11-12 02:15:34,526 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4824742268041237 [2023-11-12 02:15:34,526 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 702 transitions. [2023-11-12 02:15:34,527 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 702 transitions. [2023-11-12 02:15:34,527 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-12 02:15:34,528 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 702 transitions. [2023-11-12 02:15:34,531 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 140.4) internal successors, (702), 5 states have internal predecessors, (702), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,534 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,535 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 291.0) internal successors, (1746), 6 states have internal predecessors, (1746), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,535 INFO L175 Difference]: Start difference. First operand has 54 places, 49 transitions, 299 flow. Second operand 5 states and 702 transitions. [2023-11-12 02:15:34,535 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 58 places, 115 transitions, 796 flow [2023-11-12 02:15:34,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 115 transitions, 796 flow, removed 0 selfloop flow, removed 0 redundant places. [2023-11-12 02:15:34,568 INFO L231 Difference]: Finished difference. Result has 61 places, 58 transitions, 374 flow [2023-11-12 02:15:34,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=291, PETRI_DIFFERENCE_MINUEND_FLOW=299, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=374, PETRI_PLACES=61, PETRI_TRANSITIONS=58} [2023-11-12 02:15:34,572 INFO L281 CegarLoopForPetriNet]: 54 programPoint places, 7 predicate places. [2023-11-12 02:15:34,573 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 58 transitions, 374 flow [2023-11-12 02:15:34,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 129.5) internal successors, (518), 4 states have internal predecessors, (518), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-12 02:15:34,574 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:15:34,574 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-12 02:15:34,574 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-12 02:15:34,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:15:34,574 INFO L85 PathProgramCache]: Analyzing trace with hash -2080381509, now seen corresponding path program 1 times [2023-11-12 02:15:34,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:15:34,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781754366] [2023-11-12 02:15:34,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:15:34,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:15:34,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:15:34,844 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-12 02:15:34,845 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:15:34,845 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781754366] [2023-11-12 02:15:34,845 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781754366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:15:34,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:15:34,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:15:34,846 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [885061432] [2023-11-12 02:15:34,846 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:15:34,847 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:15:34,847 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:15:34,848 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:15:34,848 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:15:34,874 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 121 out of 291 [2023-11-12 02:15:34,875 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 58 transitions, 374 flow. Second operand has 4 states, 4 states have (on average 126.0) internal successors, (504), 4 states have internal predecessors, (504), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-12 02:15:34,875 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-12 02:15:34,875 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 121 of 291 [2023-11-12 02:15:34,876 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand