./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme --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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:49:46,815 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:49:46,928 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:49:46,940 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:49:46,941 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:49:46,980 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:49:46,981 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:49:46,982 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:49:46,983 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:49:46,988 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:49:46,989 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:49:46,990 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:49:46,991 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:49:46,993 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:49:46,993 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:49:46,994 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:49:46,994 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:49:46,995 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:49:46,995 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:49:46,996 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:49:46,996 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:49:46,997 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:49:46,997 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:49:46,998 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:49:46,998 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:49:46,999 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:49:46,999 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:49:47,000 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:49:47,001 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:49:47,002 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:49:47,003 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:49:47,004 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:49:47,004 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:49:47,004 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:49:47,005 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:49:47,005 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:49:47,005 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:49:47,005 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:49:47,006 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:49:47,006 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:49:47,006 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:49:47,007 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_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/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_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme 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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2023-11-26 11:49:47,328 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:49:47,359 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:49:47,361 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:49:47,363 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:49:47,363 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:49:47,365 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-26 11:49:50,489 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:49:50,810 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:49:50,811 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-26 11:49:50,832 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/3932c529d/7d98132807e74976822403326a7d9af6/FLAGd0d26a57f [2023-11-26 11:49:50,858 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/3932c529d/7d98132807e74976822403326a7d9af6 [2023-11-26 11:49:50,860 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:49:50,862 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:49:50,863 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:50,864 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:49:50,869 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:49:50,870 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:50" (1/1) ... [2023-11-26 11:49:50,872 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@40f28dc6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:50, skipping insertion in model container [2023-11-26 11:49:50,872 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:49:50" (1/1) ... [2023-11-26 11:49:50,924 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:49:51,467 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:51,480 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:49:51,550 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:49:51,614 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:51,614 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:49:51,623 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:49:51,624 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51 WrapperNode [2023-11-26 11:49:51,625 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:49:51,626 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:51,627 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:49:51,627 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:49:51,637 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,679 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,733 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 156 [2023-11-26 11:49:51,738 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:49:51,739 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:49:51,739 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:49:51,739 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:49:51,752 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,752 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,769 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,803 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 11:49:51,803 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,804 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,818 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,832 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,835 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,845 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,849 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:49:51,854 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:49:51,855 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:49:51,855 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:49:51,856 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (1/1) ... [2023-11-26 11:49:51,863 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:49:51,875 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:49:51,887 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:49:51,918 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:49:51,930 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:49:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:49:51,931 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:49:51,932 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:49:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-26 11:49:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:49:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:49:51,933 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:49:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:49:51,934 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:49:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:49:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:49:51,936 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:49:51,936 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:49:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:49:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 11:49:51,937 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 11:49:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:49:51,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:49:51,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:49:51,939 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:49:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-26 11:49:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:49:51,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:49:51,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:49:51,942 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:49:52,147 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:49:52,149 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:49:52,555 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:49:52,922 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:49:52,923 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:49:52,924 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:52 BoogieIcfgContainer [2023-11-26 11:49:52,924 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:49:52,927 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:49:52,927 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:49:52,931 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:49:52,931 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:49:50" (1/3) ... [2023-11-26 11:49:52,932 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1a6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:52, skipping insertion in model container [2023-11-26 11:49:52,932 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:49:51" (2/3) ... [2023-11-26 11:49:52,934 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3ba1a6ce and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:49:52, skipping insertion in model container [2023-11-26 11:49:52,935 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:52" (3/3) ... [2023-11-26 11:49:52,936 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-11-26 11:49:52,957 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:49:52,957 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-26 11:49:52,957 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:49:53,021 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:49:53,067 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-26 11:49:53,122 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-26 11:49:53,122 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:53,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 138 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-26 11:49:53,127 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-26 11:49:53,135 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-26 11:49:53,151 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:49:53,160 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;@66b18d5e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:49:53,161 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-26 11:49:53,166 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:49:53,166 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:49:53,167 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:49:53,167 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:53,167 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:49:53,168 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:53,175 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:53,175 INFO L85 PathProgramCache]: Analyzing trace with hash 13512, now seen corresponding path program 1 times [2023-11-26 11:49:53,186 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:53,186 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1631701451] [2023-11-26 11:49:53,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:53,187 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:53,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:53,520 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-26 11:49:53,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:53,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1631701451] [2023-11-26 11:49:53,522 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1631701451] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:53,522 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:53,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:53,524 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1213939209] [2023-11-26 11:49:53,525 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:53,535 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:53,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:53,570 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:53,570 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:53,595 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:49:53,598 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:53,598 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:53,599 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:49:53,600 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:54,194 INFO L124 PetriNetUnfolderBase]: 1175/2199 cut-off events. [2023-11-26 11:49:54,195 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:49:54,209 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 2199 events. 1175/2199 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16933 event pairs, 879 based on Foata normal form. 120/2134 useless extension candidates. Maximal degree in co-relation 3921. Up to 1277 conditions per place. [2023-11-26 11:49:54,257 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-26 11:49:54,257 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 210 flow [2023-11-26 11:49:54,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:54,261 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:54,271 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:49:54,273 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:49:54,274 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:49:54,275 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:49:54,276 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:54,279 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:49:54,285 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,291 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,291 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,293 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:49:54,294 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 210 flow [2023-11-26 11:49:54,301 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:49:54,304 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-26 11:49:54,307 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-26 11:49:54,312 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-26 11:49:54,312 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-26 11:49:54,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,312 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:54,313 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:49:54,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:49:54,314 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:54,314 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:54,314 INFO L85 PathProgramCache]: Analyzing trace with hash 13513, now seen corresponding path program 1 times [2023-11-26 11:49:54,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:54,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840657742] [2023-11-26 11:49:54,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:54,315 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:54,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:54,481 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-26 11:49:54,481 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:54,481 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840657742] [2023-11-26 11:49:54,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840657742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:54,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:54,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:54,483 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [827246211] [2023-11-26 11:49:54,483 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:54,484 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:54,484 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:54,485 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:54,485 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:54,505 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:49:54,506 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:54,506 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:54,506 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:49:54,506 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:54,968 INFO L124 PetriNetUnfolderBase]: 1175/2198 cut-off events. [2023-11-26 11:49:54,969 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:49:54,976 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 2198 events. 1175/2198 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16965 event pairs, 879 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 3981. Up to 1276 conditions per place. [2023-11-26 11:49:54,995 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-26 11:49:54,995 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 206 flow [2023-11-26 11:49:54,997 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:54,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:55,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:49:55,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:49:55,003 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:49:55,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:49:55,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:55,008 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:49:55,011 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,012 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,012 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,013 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:49:55,013 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 206 flow [2023-11-26 11:49:55,020 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:55,022 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-26 11:49:55,022 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-26 11:49:55,029 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-26 11:49:55,029 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-26 11:49:55,029 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,030 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:55,030 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:49:55,030 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:49:55,030 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:55,031 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:55,031 INFO L85 PathProgramCache]: Analyzing trace with hash 402950132, now seen corresponding path program 1 times [2023-11-26 11:49:55,031 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:55,031 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2092022248] [2023-11-26 11:49:55,031 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:55,033 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:55,068 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:55,152 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-26 11:49:55,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:55,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2092022248] [2023-11-26 11:49:55,153 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2092022248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:55,153 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:55,153 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:55,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [250574085] [2023-11-26 11:49:55,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:55,154 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:55,154 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:55,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:55,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:55,173 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:49:55,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:55,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:49:55,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:55,597 INFO L124 PetriNetUnfolderBase]: 1176/2196 cut-off events. [2023-11-26 11:49:55,597 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:49:55,606 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2196 events. 1176/2196 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17095 event pairs, 879 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3982. Up to 1276 conditions per place. [2023-11-26 11:49:55,626 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-26 11:49:55,626 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 206 flow [2023-11-26 11:49:55,627 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:55,627 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:55,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-26 11:49:55,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-26 11:49:55,629 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-26 11:49:55,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-26 11:49:55,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:55,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-26 11:49:55,631 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,633 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,633 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,634 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 150 transitions. [2023-11-26 11:49:55,634 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 206 flow [2023-11-26 11:49:55,639 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:55,641 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-26 11:49:55,641 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-26 11:49:55,643 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-26 11:49:55,643 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-26 11:49:55,643 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,644 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:55,644 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:49:55,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:49:55,644 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:55,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:55,645 INFO L85 PathProgramCache]: Analyzing trace with hash 402950133, now seen corresponding path program 1 times [2023-11-26 11:49:55,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:55,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988959910] [2023-11-26 11:49:55,646 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:55,646 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:55,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:55,775 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-26 11:49:55,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:55,775 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988959910] [2023-11-26 11:49:55,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988959910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:55,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:55,776 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:55,780 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1152300951] [2023-11-26 11:49:55,781 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:55,781 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:55,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:55,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:55,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:55,806 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:49:55,807 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:55,807 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:55,807 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:49:55,807 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:56,176 INFO L124 PetriNetUnfolderBase]: 1175/2194 cut-off events. [2023-11-26 11:49:56,176 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-26 11:49:56,185 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 2194 events. 1175/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16932 event pairs, 742 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 3979. Up to 1273 conditions per place. [2023-11-26 11:49:56,204 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-26 11:49:56,204 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-26 11:49:56,204 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:56,205 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:56,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:49:56,206 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:49:56,206 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:49:56,206 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:49:56,206 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:56,206 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:49:56,207 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,208 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,209 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,209 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:49:56,209 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-26 11:49:56,211 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:56,213 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-26 11:49:56,213 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-26 11:49:56,214 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-26 11:49:56,215 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-26 11:49:56,215 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,215 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:56,215 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:56,215 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:49:56,216 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:56,216 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:56,216 INFO L85 PathProgramCache]: Analyzing trace with hash -145791733, now seen corresponding path program 1 times [2023-11-26 11:49:56,217 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:56,217 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [44924392] [2023-11-26 11:49:56,217 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:56,217 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:56,232 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:56,274 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-26 11:49:56,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:56,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [44924392] [2023-11-26 11:49:56,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [44924392] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:56,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:56,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:56,275 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [403855100] [2023-11-26 11:49:56,275 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:56,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:56,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:56,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:56,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:56,296 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:49:56,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,297 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:56,297 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:49:56,297 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:56,664 INFO L124 PetriNetUnfolderBase]: 1179/2191 cut-off events. [2023-11-26 11:49:56,664 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-26 11:49:56,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3994 conditions, 2191 events. 1179/2191 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 17214 event pairs, 880 based on Foata normal form. 0/2022 useless extension candidates. Maximal degree in co-relation 3984. Up to 1272 conditions per place. [2023-11-26 11:49:56,691 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-26 11:49:56,692 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 63 transitions, 202 flow [2023-11-26 11:49:56,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:56,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:56,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-26 11:49:56,693 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-26 11:49:56,693 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-26 11:49:56,694 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-26 11:49:56,694 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:56,694 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-26 11:49:56,695 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,695 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,696 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,696 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 150 transitions. [2023-11-26 11:49:56,696 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 63 transitions, 202 flow [2023-11-26 11:49:56,699 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 63 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:56,701 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-26 11:49:56,701 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=122, PETRI_PLACES=66, PETRI_TRANSITIONS=55} [2023-11-26 11:49:56,702 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-26 11:49:56,702 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-26 11:49:56,703 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,703 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:56,703 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:56,703 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:49:56,704 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:56,704 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:56,704 INFO L85 PathProgramCache]: Analyzing trace with hash -145791732, now seen corresponding path program 1 times [2023-11-26 11:49:56,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:56,705 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [899535043] [2023-11-26 11:49:56,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:56,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:56,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:56,797 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-26 11:49:56,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:56,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [899535043] [2023-11-26 11:49:56,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [899535043] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:56,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:56,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:56,799 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [917765244] [2023-11-26 11:49:56,799 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:56,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:56,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:56,800 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:56,800 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:56,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:49:56,827 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:56,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:56,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:49:56,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:57,229 INFO L124 PetriNetUnfolderBase]: 1175/2186 cut-off events. [2023-11-26 11:49:57,229 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-26 11:49:57,236 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3983 conditions, 2186 events. 1175/2186 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16652 event pairs, 611 based on Foata normal form. 4/2020 useless extension candidates. Maximal degree in co-relation 3973. Up to 1264 conditions per place. [2023-11-26 11:49:57,249 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-26 11:49:57,249 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 62 transitions, 198 flow [2023-11-26 11:49:57,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:57,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:57,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:49:57,251 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:49:57,251 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:49:57,251 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:49:57,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:57,252 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:49:57,252 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,253 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,254 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,254 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:49:57,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 62 transitions, 198 flow [2023-11-26 11:49:57,257 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 62 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:57,258 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-26 11:49:57,259 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=116, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=65, PETRI_TRANSITIONS=54} [2023-11-26 11:49:57,261 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-26 11:49:57,262 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-26 11:49:57,262 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.0) internal successors, (126), 3 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,262 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:57,262 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:57,262 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:49:57,262 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:57,263 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:57,263 INFO L85 PathProgramCache]: Analyzing trace with hash -1069165829, now seen corresponding path program 1 times [2023-11-26 11:49:57,263 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:57,263 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1164178456] [2023-11-26 11:49:57,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:57,264 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:57,285 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:57,354 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-26 11:49:57,354 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:57,355 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1164178456] [2023-11-26 11:49:57,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1164178456] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:57,355 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:57,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:57,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [9052807] [2023-11-26 11:49:57,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:57,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:57,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:57,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:57,357 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:57,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:49:57,375 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,375 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:57,375 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:49:57,375 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:57,755 INFO L124 PetriNetUnfolderBase]: 1195/2176 cut-off events. [2023-11-26 11:49:57,755 INFO L125 PetriNetUnfolderBase]: For 62/62 co-relation queries the response was YES. [2023-11-26 11:49:57,762 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4005 conditions, 2176 events. 1195/2176 cut-off events. For 62/62 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 16261 event pairs, 777 based on Foata normal form. 0/2031 useless extension candidates. Maximal degree in co-relation 3995. Up to 1264 conditions per place. [2023-11-26 11:49:57,775 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-26 11:49:57,775 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 61 transitions, 198 flow [2023-11-26 11:49:57,776 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:57,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:57,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-26 11:49:57,778 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-26 11:49:57,778 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-26 11:49:57,778 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-26 11:49:57,778 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:57,778 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-26 11:49:57,779 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,781 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 150 transitions. [2023-11-26 11:49:57,781 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 61 transitions, 198 flow [2023-11-26 11:49:57,783 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 61 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:57,784 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-26 11:49:57,784 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-26 11:49:57,785 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-26 11:49:57,785 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-26 11:49:57,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.666666666666664) internal successors, (125), 3 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,786 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:57,786 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:57,786 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:49:57,786 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:57,787 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:57,787 INFO L85 PathProgramCache]: Analyzing trace with hash -1069165828, now seen corresponding path program 1 times [2023-11-26 11:49:57,787 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:57,787 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2077421315] [2023-11-26 11:49:57,787 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:57,788 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:57,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:57,870 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-26 11:49:57,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:57,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2077421315] [2023-11-26 11:49:57,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2077421315] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:57,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:57,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:49:57,871 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1198637153] [2023-11-26 11:49:57,871 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:57,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:57,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:57,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:57,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:57,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:49:57,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:57,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:57,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:49:57,890 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:58,260 INFO L124 PetriNetUnfolderBase]: 1175/2140 cut-off events. [2023-11-26 11:49:58,261 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-26 11:49:58,268 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3945 conditions, 2140 events. 1175/2140 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16156 event pairs, 763 based on Foata normal form. 12/2009 useless extension candidates. Maximal degree in co-relation 3935. Up to 1232 conditions per place. [2023-11-26 11:49:58,280 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-26 11:49:58,281 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 60 transitions, 194 flow [2023-11-26 11:49:58,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:58,281 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:58,282 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:49:58,282 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:49:58,283 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:49:58,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:49:58,283 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:58,283 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:49:58,284 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,285 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,285 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,285 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:49:58,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 60 transitions, 194 flow [2023-11-26 11:49:58,287 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 60 transitions, 190 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:58,288 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-26 11:49:58,289 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-26 11:49:58,290 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-26 11:49:58,290 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-26 11:49:58,290 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 42.666666666666664) internal successors, (128), 3 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,290 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:58,290 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:58,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:49:58,291 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting P3Err0ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:58,291 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:58,291 INFO L85 PathProgramCache]: Analyzing trace with hash -41323090, now seen corresponding path program 1 times [2023-11-26 11:49:58,292 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:58,292 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1857117789] [2023-11-26 11:49:58,292 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:58,292 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:58,315 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:58,431 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-26 11:49:58,431 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:58,431 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1857117789] [2023-11-26 11:49:58,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1857117789] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:58,432 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:58,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:49:58,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081581884] [2023-11-26 11:49:58,432 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:58,433 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:49:58,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:58,433 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:49:58,434 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:49:58,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 41 out of 67 [2023-11-26 11:49:58,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,435 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:49:58,435 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 41 of 67 [2023-11-26 11:49:58,435 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:49:58,775 INFO L124 PetriNetUnfolderBase]: 931/1870 cut-off events. [2023-11-26 11:49:58,775 INFO L125 PetriNetUnfolderBase]: For 56/56 co-relation queries the response was YES. [2023-11-26 11:49:58,782 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3323 conditions, 1870 events. 931/1870 cut-off events. For 56/56 co-relation queries the response was YES. Maximal size of possible extension queue 154. Compared 14108 event pairs, 199 based on Foata normal form. 0/1853 useless extension candidates. Maximal degree in co-relation 3313. Up to 1021 conditions per place. [2023-11-26 11:49:58,791 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 2/62 dead transitions. [2023-11-26 11:49:58,791 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 62 transitions, 204 flow [2023-11-26 11:49:58,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:49:58,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:49:58,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 157 transitions. [2023-11-26 11:49:58,793 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7810945273631841 [2023-11-26 11:49:58,793 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 157 transitions. [2023-11-26 11:49:58,793 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 157 transitions. [2023-11-26 11:49:58,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:49:58,794 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 157 transitions. [2023-11-26 11:49:58,795 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 52.333333333333336) internal successors, (157), 3 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,795 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,796 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,796 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 157 transitions. [2023-11-26 11:49:58,796 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 62 transitions, 204 flow [2023-11-26 11:49:58,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:49:58,798 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 112 flow [2023-11-26 11:49:58,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=112, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-26 11:49:58,799 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-26 11:49:58,800 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 112 flow [2023-11-26 11:49:58,800 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 44.0) internal successors, (132), 3 states have internal predecessors, (132), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:49:58,800 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:49:58,800 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:49:58,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:49:58,801 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:49:58,801 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:49:58,801 INFO L85 PathProgramCache]: Analyzing trace with hash -2131147341, now seen corresponding path program 1 times [2023-11-26 11:49:58,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:49:58,802 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [601129874] [2023-11-26 11:49:58,802 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:49:58,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:49:58,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:49:59,849 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-26 11:49:59,850 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:49:59,850 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [601129874] [2023-11-26 11:49:59,850 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [601129874] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:49:59,850 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:49:59,850 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:49:59,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830204784] [2023-11-26 11:49:59,851 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:49:59,851 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-26 11:49:59,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:49:59,852 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-26 11:49:59,852 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-26 11:50:00,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-26 11:50:00,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:00,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:00,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-26 11:50:00,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:01,049 INFO L124 PetriNetUnfolderBase]: 1032/1827 cut-off events. [2023-11-26 11:50:01,049 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-26 11:50:01,055 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3449 conditions, 1827 events. 1032/1827 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 160. Compared 13009 event pairs, 60 based on Foata normal form. 60/1869 useless extension candidates. Maximal degree in co-relation 3437. Up to 756 conditions per place. [2023-11-26 11:50:01,064 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 35 selfloop transitions, 5 changer transitions 10/74 dead transitions. [2023-11-26 11:50:01,064 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 74 transitions, 262 flow [2023-11-26 11:50:01,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-26 11:50:01,064 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-26 11:50:01,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 339 transitions. [2023-11-26 11:50:01,066 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6324626865671642 [2023-11-26 11:50:01,066 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 339 transitions. [2023-11-26 11:50:01,066 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 339 transitions. [2023-11-26 11:50:01,067 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:01,067 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 339 transitions. [2023-11-26 11:50:01,068 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.375) internal successors, (339), 8 states have internal predecessors, (339), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:01,069 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:01,070 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:01,070 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 112 flow. Second operand 8 states and 339 transitions. [2023-11-26 11:50:01,070 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 74 transitions, 262 flow [2023-11-26 11:50:01,071 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 74 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:01,073 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-26 11:50:01,073 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-26 11:50:01,073 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-26 11:50:01,074 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-26 11:50:01,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 37.63636363636363) internal successors, (414), 11 states have internal predecessors, (414), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:01,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:01,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:01,074 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:50:01,075 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:01,075 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:01,075 INFO L85 PathProgramCache]: Analyzing trace with hash -2131145897, now seen corresponding path program 1 times [2023-11-26 11:50:01,075 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:01,075 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341126201] [2023-11-26 11:50:01,076 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:01,076 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:01,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:01,240 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-26 11:50:01,240 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:01,240 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341126201] [2023-11-26 11:50:01,240 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341126201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:01,240 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:01,240 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:50:01,241 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1556816981] [2023-11-26 11:50:01,241 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:01,241 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:01,241 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:01,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:01,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:01,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-26 11:50:01,252 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:01,252 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:01,252 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-26 11:50:01,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:02,019 INFO L124 PetriNetUnfolderBase]: 3857/6084 cut-off events. [2023-11-26 11:50:02,019 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:50:02,043 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11600 conditions, 6084 events. 3857/6084 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 404. Compared 42474 event pairs, 536 based on Foata normal form. 180/6251 useless extension candidates. Maximal degree in co-relation 11589. Up to 3346 conditions per place. [2023-11-26 11:50:02,073 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 44 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-26 11:50:02,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 280 flow [2023-11-26 11:50:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:50:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:50:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 197 transitions. [2023-11-26 11:50:02,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7350746268656716 [2023-11-26 11:50:02,075 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 197 transitions. [2023-11-26 11:50:02,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 197 transitions. [2023-11-26 11:50:02,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:02,075 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 197 transitions. [2023-11-26 11:50:02,076 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 49.25) internal successors, (197), 4 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,077 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,077 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,077 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 4 states and 197 transitions. [2023-11-26 11:50:02,078 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 280 flow [2023-11-26 11:50:02,078 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 74 transitions, 265 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-26 11:50:02,080 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 147 flow [2023-11-26 11:50:02,080 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-26 11:50:02,081 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-26 11:50:02,081 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 147 flow [2023-11-26 11:50:02,081 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 39.5) internal successors, (158), 4 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,081 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:02,081 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:02,082 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:50:02,082 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:02,082 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:02,082 INFO L85 PathProgramCache]: Analyzing trace with hash -1334456882, now seen corresponding path program 1 times [2023-11-26 11:50:02,082 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:02,083 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [79651005] [2023-11-26 11:50:02,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:02,083 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:02,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:02,327 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-26 11:50:02,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:02,327 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [79651005] [2023-11-26 11:50:02,327 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [79651005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:02,327 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:02,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:02,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896791077] [2023-11-26 11:50:02,328 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:02,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:02,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:02,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:02,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:02,340 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-26 11:50:02,341 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:02,341 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:02,341 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-26 11:50:02,341 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:03,122 INFO L124 PetriNetUnfolderBase]: 3272/5187 cut-off events. [2023-11-26 11:50:03,123 INFO L125 PetriNetUnfolderBase]: For 1395/1395 co-relation queries the response was YES. [2023-11-26 11:50:03,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11820 conditions, 5187 events. 3272/5187 cut-off events. For 1395/1395 co-relation queries the response was YES. Maximal size of possible extension queue 354. Compared 35036 event pairs, 192 based on Foata normal form. 174/5350 useless extension candidates. Maximal degree in co-relation 11807. Up to 2581 conditions per place. [2023-11-26 11:50:03,180 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 56 selfloop transitions, 10 changer transitions 1/90 dead transitions. [2023-11-26 11:50:03,181 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 90 transitions, 386 flow [2023-11-26 11:50:03,181 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:03,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:03,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 249 transitions. [2023-11-26 11:50:03,183 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7432835820895523 [2023-11-26 11:50:03,183 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 249 transitions. [2023-11-26 11:50:03,183 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 249 transitions. [2023-11-26 11:50:03,184 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:03,184 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 249 transitions. [2023-11-26 11:50:03,185 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.8) internal successors, (249), 5 states have internal predecessors, (249), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:03,186 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:03,188 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:03,188 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 147 flow. Second operand 5 states and 249 transitions. [2023-11-26 11:50:03,188 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 90 transitions, 386 flow [2023-11-26 11:50:03,191 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 90 transitions, 375 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:03,193 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 199 flow [2023-11-26 11:50:03,193 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-26 11:50:03,195 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-26 11:50:03,195 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 199 flow [2023-11-26 11:50:03,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.0) internal successors, (195), 5 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:03,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:03,196 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:03,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:50:03,196 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:03,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:03,197 INFO L85 PathProgramCache]: Analyzing trace with hash 541770429, now seen corresponding path program 1 times [2023-11-26 11:50:03,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:03,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1471366466] [2023-11-26 11:50:03,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:03,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:03,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:03,412 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-26 11:50:03,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:03,412 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1471366466] [2023-11-26 11:50:03,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1471366466] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:03,413 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:03,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:03,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1289604459] [2023-11-26 11:50:03,413 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:03,413 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:03,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:03,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:03,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:03,419 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-26 11:50:03,420 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:03,420 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:03,420 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-26 11:50:03,420 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:03,993 INFO L124 PetriNetUnfolderBase]: 2201/3470 cut-off events. [2023-11-26 11:50:03,993 INFO L125 PetriNetUnfolderBase]: For 2772/2772 co-relation queries the response was YES. [2023-11-26 11:50:04,004 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8974 conditions, 3470 events. 2201/3470 cut-off events. For 2772/2772 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20572 event pairs, 69 based on Foata normal form. 140/3599 useless extension candidates. Maximal degree in co-relation 8959. Up to 1221 conditions per place. [2023-11-26 11:50:04,021 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 66 selfloop transitions, 14 changer transitions 1/104 dead transitions. [2023-11-26 11:50:04,021 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 104 transitions, 505 flow [2023-11-26 11:50:04,021 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:04,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:04,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 299 transitions. [2023-11-26 11:50:04,023 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7437810945273632 [2023-11-26 11:50:04,023 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 299 transitions. [2023-11-26 11:50:04,023 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 299 transitions. [2023-11-26 11:50:04,024 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:04,024 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 299 transitions. [2023-11-26 11:50:04,025 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.833333333333336) internal successors, (299), 6 states have internal predecessors, (299), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,026 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,026 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,027 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 199 flow. Second operand 6 states and 299 transitions. [2023-11-26 11:50:04,027 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 104 transitions, 505 flow [2023-11-26 11:50:04,033 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 104 transitions, 475 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:04,035 INFO L231 Difference]: Finished difference. Result has 70 places, 60 transitions, 249 flow [2023-11-26 11:50:04,035 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=70, PETRI_TRANSITIONS=60} [2023-11-26 11:50:04,036 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-26 11:50:04,036 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 60 transitions, 249 flow [2023-11-26 11:50:04,037 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,037 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:04,037 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:04,037 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:50:04,037 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:04,038 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:04,038 INFO L85 PathProgramCache]: Analyzing trace with hash 444438878, now seen corresponding path program 1 times [2023-11-26 11:50:04,038 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:04,038 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1611565927] [2023-11-26 11:50:04,038 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:04,039 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:04,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:04,280 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-26 11:50:04,280 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:04,280 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1611565927] [2023-11-26 11:50:04,280 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1611565927] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:04,280 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:04,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:04,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [111571086] [2023-11-26 11:50:04,281 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:04,281 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-26 11:50:04,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:04,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-26 11:50:04,282 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-26 11:50:04,288 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-26 11:50:04,289 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 60 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,289 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:04,289 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-26 11:50:04,289 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:04,695 INFO L124 PetriNetUnfolderBase]: 1353/2050 cut-off events. [2023-11-26 11:50:04,695 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2023-11-26 11:50:04,701 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6063 conditions, 2050 events. 1353/2050 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 109. Compared 10090 event pairs, 39 based on Foata normal form. 72/2111 useless extension candidates. Maximal degree in co-relation 6047. Up to 668 conditions per place. [2023-11-26 11:50:04,712 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 60 selfloop transitions, 18 changer transitions 1/102 dead transitions. [2023-11-26 11:50:04,713 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 102 transitions, 507 flow [2023-11-26 11:50:04,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:50:04,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:50:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 333 transitions. [2023-11-26 11:50:04,715 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7100213219616205 [2023-11-26 11:50:04,715 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 333 transitions. [2023-11-26 11:50:04,715 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 333 transitions. [2023-11-26 11:50:04,716 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:04,716 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 333 transitions. [2023-11-26 11:50:04,717 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 47.57142857142857) internal successors, (333), 7 states have internal predecessors, (333), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,719 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,719 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,719 INFO L175 Difference]: Start difference. First operand has 70 places, 60 transitions, 249 flow. Second operand 7 states and 333 transitions. [2023-11-26 11:50:04,720 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 102 transitions, 507 flow [2023-11-26 11:50:04,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 102 transitions, 461 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-26 11:50:04,737 INFO L231 Difference]: Finished difference. Result has 73 places, 60 transitions, 259 flow [2023-11-26 11:50:04,738 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=206, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=259, PETRI_PLACES=73, PETRI_TRANSITIONS=60} [2023-11-26 11:50:04,738 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -1 predicate places. [2023-11-26 11:50:04,739 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 60 transitions, 259 flow [2023-11-26 11:50:04,739 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 38.57142857142857) internal successors, (270), 7 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:04,739 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:04,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:04,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:50:04,740 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:04,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:04,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1447646622, now seen corresponding path program 1 times [2023-11-26 11:50:04,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:04,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88812248] [2023-11-26 11:50:04,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:04,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:04,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:05,078 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-26 11:50:05,078 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:05,078 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88812248] [2023-11-26 11:50:05,079 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88812248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:05,079 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:05,079 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:05,079 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353403986] [2023-11-26 11:50:05,079 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:05,080 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:05,080 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:05,081 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:05,081 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:05,105 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-26 11:50:05,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 60 transitions, 259 flow. Second operand has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:05,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:05,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-26 11:50:05,106 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:05,948 INFO L124 PetriNetUnfolderBase]: 4354/7095 cut-off events. [2023-11-26 11:50:05,949 INFO L125 PetriNetUnfolderBase]: For 2413/2530 co-relation queries the response was YES. [2023-11-26 11:50:05,991 INFO L83 FinitePrefix]: Finished finitePrefix Result has 16022 conditions, 7095 events. 4354/7095 cut-off events. For 2413/2530 co-relation queries the response was YES. Maximal size of possible extension queue 417. Compared 48352 event pairs, 1525 based on Foata normal form. 16/6646 useless extension candidates. Maximal degree in co-relation 16005. Up to 3288 conditions per place. [2023-11-26 11:50:06,022 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 37 selfloop transitions, 8 changer transitions 12/90 dead transitions. [2023-11-26 11:50:06,022 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 90 transitions, 448 flow [2023-11-26 11:50:06,022 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:06,023 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:06,024 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 228 transitions. [2023-11-26 11:50:06,024 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6805970149253732 [2023-11-26 11:50:06,024 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 228 transitions. [2023-11-26 11:50:06,024 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 228 transitions. [2023-11-26 11:50:06,025 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:06,025 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 228 transitions. [2023-11-26 11:50:06,026 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 45.6) internal successors, (228), 5 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,027 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,027 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,027 INFO L175 Difference]: Start difference. First operand has 73 places, 60 transitions, 259 flow. Second operand 5 states and 228 transitions. [2023-11-26 11:50:06,028 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 90 transitions, 448 flow [2023-11-26 11:50:06,079 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 90 transitions, 342 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-26 11:50:06,081 INFO L231 Difference]: Finished difference. Result has 71 places, 67 transitions, 230 flow [2023-11-26 11:50:06,081 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=163, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=230, PETRI_PLACES=71, PETRI_TRANSITIONS=67} [2023-11-26 11:50:06,081 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-26 11:50:06,082 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 67 transitions, 230 flow [2023-11-26 11:50:06,082 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 38.6) internal successors, (193), 5 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,082 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:06,082 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:06,083 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:50:06,083 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:06,083 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:06,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1587455988, now seen corresponding path program 2 times [2023-11-26 11:50:06,083 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:06,084 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039878903] [2023-11-26 11:50:06,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:06,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:06,130 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:06,407 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-26 11:50:06,408 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:06,408 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039878903] [2023-11-26 11:50:06,408 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039878903] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:06,408 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:06,408 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:06,409 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534135233] [2023-11-26 11:50:06,409 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:06,409 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:06,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:06,410 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:06,410 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:06,431 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-26 11:50:06,431 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 67 transitions, 230 flow. Second operand has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:06,431 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:06,432 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-26 11:50:06,432 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:07,794 INFO L124 PetriNetUnfolderBase]: 6576/10595 cut-off events. [2023-11-26 11:50:07,794 INFO L125 PetriNetUnfolderBase]: For 3897/3897 co-relation queries the response was YES. [2023-11-26 11:50:07,839 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25825 conditions, 10595 events. 6576/10595 cut-off events. For 3897/3897 co-relation queries the response was YES. Maximal size of possible extension queue 595. Compared 73427 event pairs, 1125 based on Foata normal form. 16/10147 useless extension candidates. Maximal degree in co-relation 25809. Up to 4112 conditions per place. [2023-11-26 11:50:07,878 INFO L140 encePairwiseOnDemand]: 55/67 looper letters, 66 selfloop transitions, 19 changer transitions 12/129 dead transitions. [2023-11-26 11:50:07,879 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 129 transitions, 616 flow [2023-11-26 11:50:07,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-26 11:50:07,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-26 11:50:07,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 324 transitions. [2023-11-26 11:50:07,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6908315565031983 [2023-11-26 11:50:07,881 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 324 transitions. [2023-11-26 11:50:07,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 324 transitions. [2023-11-26 11:50:07,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:07,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 324 transitions. [2023-11-26 11:50:07,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.285714285714285) internal successors, (324), 7 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,885 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,885 INFO L175 Difference]: Start difference. First operand has 71 places, 67 transitions, 230 flow. Second operand 7 states and 324 transitions. [2023-11-26 11:50:07,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 129 transitions, 616 flow [2023-11-26 11:50:07,895 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 129 transitions, 578 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:07,897 INFO L231 Difference]: Finished difference. Result has 76 places, 80 transitions, 349 flow [2023-11-26 11:50:07,897 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=210, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=349, PETRI_PLACES=76, PETRI_TRANSITIONS=80} [2023-11-26 11:50:07,898 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 2 predicate places. [2023-11-26 11:50:07,898 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 80 transitions, 349 flow [2023-11-26 11:50:07,898 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.0) internal successors, (222), 6 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:07,899 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:07,899 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:07,899 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:50:07,899 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:07,900 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:07,900 INFO L85 PathProgramCache]: Analyzing trace with hash 1479686024, now seen corresponding path program 3 times [2023-11-26 11:50:07,900 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:07,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1455199188] [2023-11-26 11:50:07,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:07,901 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:07,945 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:08,183 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-26 11:50:08,183 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:08,183 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1455199188] [2023-11-26 11:50:08,184 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1455199188] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:08,184 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:08,184 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:08,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001086255] [2023-11-26 11:50:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:08,185 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:08,185 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:08,185 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:08,186 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:08,199 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-26 11:50:08,199 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 80 transitions, 349 flow. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:08,199 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:08,200 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-26 11:50:08,200 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:09,813 INFO L124 PetriNetUnfolderBase]: 8950/14750 cut-off events. [2023-11-26 11:50:09,814 INFO L125 PetriNetUnfolderBase]: For 10128/10136 co-relation queries the response was YES. [2023-11-26 11:50:09,901 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38903 conditions, 14750 events. 8950/14750 cut-off events. For 10128/10136 co-relation queries the response was YES. Maximal size of possible extension queue 876. Compared 112280 event pairs, 2265 based on Foata normal form. 24/13783 useless extension candidates. Maximal degree in co-relation 38884. Up to 5399 conditions per place. [2023-11-26 11:50:09,929 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 61 selfloop transitions, 15 changer transitions 23/133 dead transitions. [2023-11-26 11:50:09,929 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 133 transitions, 747 flow [2023-11-26 11:50:09,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:09,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:09,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 282 transitions. [2023-11-26 11:50:09,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7014925373134329 [2023-11-26 11:50:09,932 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 282 transitions. [2023-11-26 11:50:09,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 282 transitions. [2023-11-26 11:50:09,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:09,933 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 282 transitions. [2023-11-26 11:50:09,934 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.0) internal successors, (282), 6 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,935 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,936 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,936 INFO L175 Difference]: Start difference. First operand has 76 places, 80 transitions, 349 flow. Second operand 6 states and 282 transitions. [2023-11-26 11:50:09,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 133 transitions, 747 flow [2023-11-26 11:50:09,980 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 133 transitions, 741 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:09,982 INFO L231 Difference]: Finished difference. Result has 81 places, 81 transitions, 422 flow [2023-11-26 11:50:09,983 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=345, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=80, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=422, PETRI_PLACES=81, PETRI_TRANSITIONS=81} [2023-11-26 11:50:09,983 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 7 predicate places. [2023-11-26 11:50:09,984 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 81 transitions, 422 flow [2023-11-26 11:50:09,984 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:09,984 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:09,984 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:09,985 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-26 11:50:09,985 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:09,985 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:09,985 INFO L85 PathProgramCache]: Analyzing trace with hash -2112588002, now seen corresponding path program 4 times [2023-11-26 11:50:09,986 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:09,986 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [361651798] [2023-11-26 11:50:09,986 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:09,986 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:10,040 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:10,534 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-26 11:50:10,535 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:10,535 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [361651798] [2023-11-26 11:50:10,535 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [361651798] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:10,535 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:10,535 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-26 11:50:10,536 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311025816] [2023-11-26 11:50:10,536 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:10,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:50:10,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:10,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:50:10,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:50:10,573 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-26 11:50:10,574 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 81 transitions, 422 flow. Second operand has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:10,574 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:10,574 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-26 11:50:10,574 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:14,239 INFO L124 PetriNetUnfolderBase]: 14527/24529 cut-off events. [2023-11-26 11:50:14,239 INFO L125 PetriNetUnfolderBase]: For 31580/31580 co-relation queries the response was YES. [2023-11-26 11:50:14,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 67681 conditions, 24529 events. 14527/24529 cut-off events. For 31580/31580 co-relation queries the response was YES. Maximal size of possible extension queue 1714. Compared 207552 event pairs, 2803 based on Foata normal form. 32/23315 useless extension candidates. Maximal degree in co-relation 67658. Up to 6521 conditions per place. [2023-11-26 11:50:14,433 INFO L140 encePairwiseOnDemand]: 53/67 looper letters, 109 selfloop transitions, 41 changer transitions 29/211 dead transitions. [2023-11-26 11:50:14,434 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 211 transitions, 1507 flow [2023-11-26 11:50:14,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-26 11:50:14,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13 states. [2023-11-26 11:50:14,436 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13 states to 13 states and 565 transitions. [2023-11-26 11:50:14,437 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6486796785304249 [2023-11-26 11:50:14,437 INFO L72 ComplementDD]: Start complementDD. Operand 13 states and 565 transitions. [2023-11-26 11:50:14,437 INFO L73 IsDeterministic]: Start isDeterministic. Operand 13 states and 565 transitions. [2023-11-26 11:50:14,438 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:14,438 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 13 states and 565 transitions. [2023-11-26 11:50:14,441 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 14 states, 13 states have (on average 43.46153846153846) internal successors, (565), 13 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-26 11:50:14,443 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 14 states, 14 states have (on average 67.0) internal successors, (938), 14 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:14,444 INFO L81 ComplementDD]: Finished complementDD. Result has 14 states, 14 states have (on average 67.0) internal successors, (938), 14 states have internal predecessors, (938), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:14,444 INFO L175 Difference]: Start difference. First operand has 81 places, 81 transitions, 422 flow. Second operand 13 states and 565 transitions. [2023-11-26 11:50:14,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 211 transitions, 1507 flow [2023-11-26 11:50:14,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 88 places, 211 transitions, 1479 flow, removed 12 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:14,617 INFO L231 Difference]: Finished difference. Result has 98 places, 114 transitions, 921 flow [2023-11-26 11:50:14,618 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=408, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=13, PETRI_FLOW=921, PETRI_PLACES=98, PETRI_TRANSITIONS=114} [2023-11-26 11:50:14,619 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 24 predicate places. [2023-11-26 11:50:14,619 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 114 transitions, 921 flow [2023-11-26 11:50:14,619 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 35.666666666666664) internal successors, (321), 9 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:14,619 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:14,620 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:14,620 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-26 11:50:14,620 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:14,620 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:14,621 INFO L85 PathProgramCache]: Analyzing trace with hash -354382788, now seen corresponding path program 5 times [2023-11-26 11:50:14,621 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:14,621 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [710157825] [2023-11-26 11:50:14,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:14,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:14,686 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:14,958 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-26 11:50:14,959 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:14,959 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [710157825] [2023-11-26 11:50:14,959 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [710157825] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:14,959 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:14,959 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:14,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2102227842] [2023-11-26 11:50:14,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:14,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:14,963 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:14,963 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:14,964 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:14,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-26 11:50:14,975 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 98 places, 114 transitions, 921 flow. Second operand has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:14,975 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:14,975 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-26 11:50:14,975 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:18,489 INFO L124 PetriNetUnfolderBase]: 12910/23662 cut-off events. [2023-11-26 11:50:18,489 INFO L125 PetriNetUnfolderBase]: For 38586/40860 co-relation queries the response was YES. [2023-11-26 11:50:18,640 INFO L83 FinitePrefix]: Finished finitePrefix Result has 65209 conditions, 23662 events. 12910/23662 cut-off events. For 38586/40860 co-relation queries the response was YES. Maximal size of possible extension queue 1703. Compared 221894 event pairs, 3364 based on Foata normal form. 562/22310 useless extension candidates. Maximal degree in co-relation 65177. Up to 10088 conditions per place. [2023-11-26 11:50:18,660 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 27 selfloop transitions, 1 changer transitions 74/146 dead transitions. [2023-11-26 11:50:18,660 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 146 transitions, 1206 flow [2023-11-26 11:50:18,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:18,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:18,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 284 transitions. [2023-11-26 11:50:18,667 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7064676616915423 [2023-11-26 11:50:18,667 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 284 transitions. [2023-11-26 11:50:18,667 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 284 transitions. [2023-11-26 11:50:18,668 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:18,668 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 284 transitions. [2023-11-26 11:50:18,669 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.333333333333336) internal successors, (284), 6 states have internal predecessors, (284), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:18,670 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:18,670 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:18,671 INFO L175 Difference]: Start difference. First operand has 98 places, 114 transitions, 921 flow. Second operand 6 states and 284 transitions. [2023-11-26 11:50:18,671 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 146 transitions, 1206 flow [2023-11-26 11:50:18,905 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 146 transitions, 1186 flow, removed 6 selfloop flow, removed 6 redundant places. [2023-11-26 11:50:18,908 INFO L231 Difference]: Finished difference. Result has 96 places, 69 transitions, 360 flow [2023-11-26 11:50:18,908 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=905, PETRI_DIFFERENCE_MINUEND_PLACES=88, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=114, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=113, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=360, PETRI_PLACES=96, PETRI_TRANSITIONS=69} [2023-11-26 11:50:18,908 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 22 predicate places. [2023-11-26 11:50:18,909 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 69 transitions, 360 flow [2023-11-26 11:50:18,909 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 41.166666666666664) internal successors, (247), 6 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:18,909 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:18,909 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:18,910 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-26 11:50:18,910 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:18,910 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:18,910 INFO L85 PathProgramCache]: Analyzing trace with hash -770771048, now seen corresponding path program 6 times [2023-11-26 11:50:18,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:18,911 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [310809000] [2023-11-26 11:50:18,911 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:18,911 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:18,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:19,404 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-26 11:50:19,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:19,405 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [310809000] [2023-11-26 11:50:19,405 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [310809000] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:19,405 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:19,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:19,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942020194] [2023-11-26 11:50:19,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:19,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:19,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:19,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:19,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:19,421 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-26 11:50:19,422 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 96 places, 69 transitions, 360 flow. Second operand has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:19,422 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:19,422 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-26 11:50:19,422 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:20,836 INFO L124 PetriNetUnfolderBase]: 6175/11042 cut-off events. [2023-11-26 11:50:20,836 INFO L125 PetriNetUnfolderBase]: For 20693/20717 co-relation queries the response was YES. [2023-11-26 11:50:20,889 INFO L83 FinitePrefix]: Finished finitePrefix Result has 30765 conditions, 11042 events. 6175/11042 cut-off events. For 20693/20717 co-relation queries the response was YES. Maximal size of possible extension queue 716. Compared 90277 event pairs, 2040 based on Foata normal form. 16/10126 useless extension candidates. Maximal degree in co-relation 30746. Up to 4027 conditions per place. [2023-11-26 11:50:20,898 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 31 selfloop transitions, 7 changer transitions 33/104 dead transitions. [2023-11-26 11:50:20,898 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 104 transitions, 638 flow [2023-11-26 11:50:20,898 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:20,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:20,899 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-26 11:50:20,899 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6741293532338308 [2023-11-26 11:50:20,900 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-26 11:50:20,900 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-26 11:50:20,900 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:20,900 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-26 11:50:20,901 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:20,902 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:20,902 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:20,903 INFO L175 Difference]: Start difference. First operand has 96 places, 69 transitions, 360 flow. Second operand 6 states and 271 transitions. [2023-11-26 11:50:20,903 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 104 transitions, 638 flow [2023-11-26 11:50:20,947 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 104 transitions, 565 flow, removed 14 selfloop flow, removed 10 redundant places. [2023-11-26 11:50:20,949 INFO L231 Difference]: Finished difference. Result has 87 places, 62 transitions, 272 flow [2023-11-26 11:50:20,949 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=307, PETRI_DIFFERENCE_MINUEND_PLACES=79, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=7, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=272, PETRI_PLACES=87, PETRI_TRANSITIONS=62} [2023-11-26 11:50:20,950 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-11-26 11:50:20,950 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 62 transitions, 272 flow [2023-11-26 11:50:20,950 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.833333333333336) internal successors, (227), 6 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:20,950 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:20,951 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:20,951 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-26 11:50:20,951 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:20,951 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:20,952 INFO L85 PathProgramCache]: Analyzing trace with hash -1317119498, now seen corresponding path program 7 times [2023-11-26 11:50:20,952 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:20,952 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [782600436] [2023-11-26 11:50:20,952 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:20,952 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:20,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:20,989 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:21,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:21,063 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:21,063 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:50:21,065 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-26 11:50:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-26 11:50:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-26 11:50:21,067 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-26 11:50:21,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-26 11:50:21,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-26 11:50:21,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-26 11:50:21,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-26 11:50:21,068 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-26 11:50:21,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-26 11:50:21,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-26 11:50:21,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-26 11:50:21,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-26 11:50:21,069 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-26 11:50:21,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-26 11:50:21,070 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-26 11:50:21,070 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-26 11:50:21,070 INFO L445 BasicCegarLoop]: Path program histogram: [7, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:21,077 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:50:21,077 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:50:21,256 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:50:21,260 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:50:21,261 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:50:21,264 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-26 11:50:21,291 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:21,302 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:21,316 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:50:21 BasicIcfg [2023-11-26 11:50:21,323 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:50:21,323 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:50:21,323 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:50:21,324 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:50:21,324 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:49:52" (3/4) ... [2023-11-26 11:50:21,326 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:50:21,327 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:50:21,328 INFO L158 Benchmark]: Toolchain (without parser) took 30466.16ms. Allocated memory was 151.0MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 106.9MB in the beginning and 4.4GB in the end (delta: -4.3GB). Peak memory consumption was 527.0MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,328 INFO L158 Benchmark]: CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:21,329 INFO L158 Benchmark]: CACSL2BoogieTranslator took 761.67ms. Allocated memory is still 151.0MB. Free memory was 106.5MB in the beginning and 82.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,329 INFO L158 Benchmark]: Boogie Procedure Inliner took 112.01ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 80.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,329 INFO L158 Benchmark]: Boogie Preprocessor took 114.93ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 76.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,330 INFO L158 Benchmark]: RCFGBuilder took 1069.95ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 76.7MB in the beginning and 140.7MB in the end (delta: -64.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,330 INFO L158 Benchmark]: TraceAbstraction took 28396.05ms. Allocated memory was 195.0MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 140.7MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 802.0MB. Max. memory is 16.1GB. [2023-11-26 11:50:21,331 INFO L158 Benchmark]: Witness Printer took 4.19ms. Allocated memory is still 4.9GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:21,332 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.27ms. Allocated memory is still 151.0MB. Free memory is still 121.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 761.67ms. Allocated memory is still 151.0MB. Free memory was 106.5MB in the beginning and 82.9MB in the end (delta: 23.5MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 112.01ms. Allocated memory is still 151.0MB. Free memory was 82.9MB in the beginning and 80.1MB in the end (delta: 2.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 114.93ms. Allocated memory is still 151.0MB. Free memory was 80.1MB in the beginning and 76.7MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1069.95ms. Allocated memory was 151.0MB in the beginning and 195.0MB in the end (delta: 44.0MB). Free memory was 76.7MB in the beginning and 140.7MB in the end (delta: -64.0MB). Peak memory consumption was 37.5MB. Max. memory is 16.1GB. * TraceAbstraction took 28396.05ms. Allocated memory was 195.0MB in the beginning and 4.9GB in the end (delta: 4.8GB). Free memory was 140.7MB in the beginning and 4.4GB in the end (delta: -4.2GB). Peak memory consumption was 802.0MB. Max. memory is 16.1GB. * Witness Printer took 4.19ms. Allocated memory is still 4.9GB. Free memory is still 4.4GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int __unbuffered_p3_EBX = 0; [L718] 0 int a = 0; [L720] 0 int b = 0; [L721] 0 _Bool main$tmp_guard0; [L722] 0 _Bool main$tmp_guard1; [L724] 0 int x = 0; [L726] 0 int y = 0; [L728] 0 int z = 0; [L729] 0 _Bool z$flush_delayed; [L730] 0 int z$mem_tmp; [L731] 0 _Bool z$r_buff0_thd0; [L732] 0 _Bool z$r_buff0_thd1; [L733] 0 _Bool z$r_buff0_thd2; [L734] 0 _Bool z$r_buff0_thd3; [L735] 0 _Bool z$r_buff0_thd4; [L736] 0 _Bool z$r_buff1_thd0; [L737] 0 _Bool z$r_buff1_thd1; [L738] 0 _Bool z$r_buff1_thd2; [L739] 0 _Bool z$r_buff1_thd3; [L740] 0 _Bool z$r_buff1_thd4; [L741] 0 _Bool z$read_delayed; [L742] 0 int *z$read_delayed_var; [L743] 0 int z$w_buff0; [L744] 0 _Bool z$w_buff0_used; [L745] 0 int z$w_buff1; [L746] 0 _Bool z$w_buff1_used; [L747] 0 _Bool weak$$choice0; [L748] 0 _Bool weak$$choice2; [L854] 0 pthread_t t1061; [L855] FCALL, FORK 0 pthread_create(&t1061, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L856] 0 pthread_t t1062; [L857] FCALL, FORK 0 pthread_create(&t1062, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L858] 0 pthread_t t1063; [L859] FCALL, FORK 0 pthread_create(&t1063, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L860] 0 pthread_t t1064; [L861] FCALL, FORK 0 pthread_create(&t1064, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=0, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=0, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=0] [L810] 4 z$w_buff1 = z$w_buff0 [L811] 4 z$w_buff0 = 1 [L812] 4 z$w_buff1_used = z$w_buff0_used [L813] 4 z$w_buff0_used = (_Bool)1 [L814] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L814] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L815] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L816] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L817] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L818] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L819] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L820] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L823] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L826] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L829] 4 __unbuffered_p3_EBX = b VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L752] 1 b = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L755] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L767] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L770] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L782] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L785] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L786] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L787] 3 z$flush_delayed = weak$$choice2 [L788] 3 z$mem_tmp = z [L789] 3 z = !z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff1) [L790] 3 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff0 : z$w_buff0)) [L791] 3 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd3 ? z$w_buff1 : z$w_buff1)) [L792] 3 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$w_buff0_used)) [L793] 3 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L794] 3 z$r_buff0_thd3 = weak$$choice2 ? z$r_buff0_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff0_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : z$r_buff0_thd3)) [L795] 3 z$r_buff1_thd3 = weak$$choice2 ? z$r_buff1_thd3 : (!z$w_buff0_used || !z$r_buff0_thd3 && !z$w_buff1_used || !z$r_buff0_thd3 && !z$r_buff1_thd3 ? z$r_buff1_thd3 : (z$w_buff0_used && z$r_buff0_thd3 ? (_Bool)0 : (_Bool)0)) [L796] 3 __unbuffered_p2_EAX = z [L797] 3 z = z$flush_delayed ? z$mem_tmp : z [L798] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=1, z$w_buff1=0, z$w_buff1_used=0, z=0] [L832] 4 z = z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd4 ? z$w_buff1 : z) [L833] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L834] 4 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$w_buff1_used [L835] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L836] 4 z$r_buff1_thd4 = z$w_buff0_used && z$r_buff0_thd4 || z$w_buff1_used && z$r_buff1_thd4 ? (_Bool)0 : z$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L803] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L760] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L775] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L839] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L863] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L865] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L865] RET 0 assume_abort_if_not(main$tmp_guard0) [L867] 0 z = z$w_buff0_used && z$r_buff0_thd0 ? z$w_buff0 : (z$w_buff1_used && z$r_buff1_thd0 ? z$w_buff1 : z) [L868] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L869] 0 z$w_buff1_used = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$w_buff1_used [L870] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L871] 0 z$r_buff1_thd0 = z$w_buff0_used && z$r_buff0_thd0 || z$w_buff1_used && z$r_buff1_thd0 ? (_Bool)0 : z$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L874] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t1061={5:0}, t1062={6:0}, t1063={7:0}, t1064={3:0}, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L876] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix040.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=2, z$flush_delayed=0, z$mem_tmp=0, z$r_buff0_thd0=0, z$r_buff0_thd1=0, z$r_buff0_thd2=0, z$r_buff0_thd3=0, z$r_buff0_thd4=1, z$r_buff1_thd0=0, z$r_buff1_thd1=0, z$r_buff1_thd2=0, z$r_buff1_thd3=0, z$r_buff1_thd4=0, z$read_delayed=0, z$read_delayed_var={0:0}, z$w_buff0=1, z$w_buff0_used=0, z$w_buff1=0, z$w_buff1_used=0, z=1] - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: -1]: Unable to prove that pointer dereference always succeeds Unable to prove that pointer dereference always succeeds Reason: Not analyzed. - UnprovableResult [Line: 852]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 859]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 855]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 861]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - UnprovableResult [Line: 857]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.0s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 7, EmptinessCheckTime: 0.0s, AutomataDifference: 22.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1219 SdHoareTripleChecker+Valid, 3.6s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1021 mSDsluCounter, 418 SdHoareTripleChecker+Invalid, 2.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 344 mSDsCounter, 74 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3025 IncrementalHoareTripleChecker+Invalid, 3099 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 74 mSolverCounterUnsat, 74 mSDtfsCounter, 3025 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 113 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=921occurred in iteration=18, InterpolantAutomatonStates: 100, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 4.5s InterpolantComputationTime, 502 NumberOfCodeBlocks, 502 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 439 ConstructedInterpolants, 0 QuantifiedInterpolants, 2748 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:50:21,379 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix040.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme --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 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:24,182 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:24,281 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:50:24,294 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:24,295 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:24,350 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:24,351 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:24,351 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:24,353 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:24,361 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:24,362 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:24,363 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:24,363 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:24,364 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:24,364 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:24,365 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:24,366 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:24,366 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:24,367 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:24,368 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:24,368 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:50:24,369 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:50:24,369 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:50:24,370 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:24,370 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:50:24,371 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:50:24,371 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:50:24,372 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:50:24,372 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:24,372 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:24,374 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:24,375 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:24,375 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:24,375 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:24,376 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:24,376 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:24,377 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:24,377 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:50:24,378 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:50:24,378 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:24,378 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:24,379 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:24,379 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:24,379 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:50:24,380 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_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/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_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme 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 -> 9adb0e975425d9a1b173bce1a766592f39d0541cd50cefd6e228e1140c2f9f3e [2023-11-26 11:50:24,831 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:24,854 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:24,856 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:24,858 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:24,858 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:24,860 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-26 11:50:28,107 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:28,432 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:28,433 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/sv-benchmarks/c/pthread-wmm/mix040.opt.i [2023-11-26 11:50:28,452 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/478f54af1/7409ab35623545af920ca43851e3158e/FLAG8b8905a35 [2023-11-26 11:50:28,477 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/data/478f54af1/7409ab35623545af920ca43851e3158e [2023-11-26 11:50:28,480 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:28,482 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:28,483 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:28,483 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:28,489 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:28,490 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:28" (1/1) ... [2023-11-26 11:50:28,492 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@88853c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:28, skipping insertion in model container [2023-11-26 11:50:28,492 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:28" (1/1) ... [2023-11-26 11:50:28,552 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:29,175 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:29,196 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:29,265 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:29,304 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:29,304 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:29,313 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:29,313 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29 WrapperNode [2023-11-26 11:50:29,314 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:29,315 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:29,315 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:29,316 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:29,324 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,360 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,409 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 157 [2023-11-26 11:50:29,410 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:29,411 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:29,412 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:29,412 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:29,424 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,425 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,442 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,469 INFO L175 MemorySlicer]: Split 6 memory accesses to 5 slices as follows [2, 1, 1, 1, 1]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0, 0]. The 4 writes are split as follows [0, 1, 1, 1, 1]. [2023-11-26 11:50:29,469 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,470 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,482 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,491 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,495 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,511 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,517 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:29,518 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:29,518 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:29,518 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:29,519 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (1/1) ... [2023-11-26 11:50:29,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:29,557 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:29,588 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:29,629 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:50:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:29,646 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:50:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:50:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:50:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:50:29,647 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:50:29,649 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:50:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-26 11:50:29,650 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:50:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:50:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:50:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:50:29,651 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-26 11:50:29,652 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:50:29,652 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:50:29,653 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:50:29,654 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:50:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:50:29,655 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:50:29,655 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-26 11:50:29,656 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-26 11:50:29,656 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:50:29,657 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:29,657 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:29,659 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:50:29,877 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:29,880 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:30,396 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:30,718 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:30,718 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:50:30,719 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:30 BoogieIcfgContainer [2023-11-26 11:50:30,719 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:30,722 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:30,722 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:30,725 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:30,726 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:28" (1/3) ... [2023-11-26 11:50:30,727 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587e55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:30, skipping insertion in model container [2023-11-26 11:50:30,727 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:29" (2/3) ... [2023-11-26 11:50:30,728 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@587e55f3 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:30, skipping insertion in model container [2023-11-26 11:50:30,728 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:30" (3/3) ... [2023-11-26 11:50:30,736 INFO L112 eAbstractionObserver]: Analyzing ICFG mix040.opt.i [2023-11-26 11:50:30,757 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:30,758 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-26 11:50:30,758 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:50:30,842 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:50:30,889 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-26 11:50:30,944 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-26 11:50:30,944 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:30,948 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 132 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-26 11:50:30,949 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-26 11:50:30,956 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-26 11:50:30,975 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:30,983 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;@d0a3b97, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:30,983 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-26 11:50:30,988 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:50:30,989 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:50:30,989 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:30,989 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:30,990 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:30,991 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:30,996 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:30,996 INFO L85 PathProgramCache]: Analyzing trace with hash 13576, now seen corresponding path program 1 times [2023-11-26 11:50:31,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:31,013 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [330548543] [2023-11-26 11:50:31,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:31,014 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:31,014 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:31,021 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:31,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:50:31,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:31,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:31,178 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:31,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:31,272 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-26 11:50:31,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:31,274 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:31,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [330548543] [2023-11-26 11:50:31,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [330548543] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:31,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:31,276 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:31,279 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280450997] [2023-11-26 11:50:31,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:31,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:31,295 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:31,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:31,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:31,381 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:50:31,385 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:31,385 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:31,386 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:50:31,387 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:32,083 INFO L124 PetriNetUnfolderBase]: 1175/2199 cut-off events. [2023-11-26 11:50:32,083 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:50:32,093 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3936 conditions, 2199 events. 1175/2199 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16972 event pairs, 879 based on Foata normal form. 120/2134 useless extension candidates. Maximal degree in co-relation 3921. Up to 1277 conditions per place. [2023-11-26 11:50:32,115 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-26 11:50:32,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 67 transitions, 210 flow [2023-11-26 11:50:32,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:32,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:32,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:50:32,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:50:32,130 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:50:32,131 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:50:32,132 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:32,135 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:50:32,138 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,142 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,143 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,145 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:50:32,146 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 67 transitions, 210 flow [2023-11-26 11:50:32,150 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 67 transitions, 206 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:32,153 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-26 11:50:32,155 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-26 11:50:32,159 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-26 11:50:32,160 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-26 11:50:32,160 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,160 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:32,160 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:32,170 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 11:50:32,363 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:32,363 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:32,364 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:32,364 INFO L85 PathProgramCache]: Analyzing trace with hash 13577, now seen corresponding path program 1 times [2023-11-26 11:50:32,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:32,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1340172942] [2023-11-26 11:50:32,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:32,365 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:32,365 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:32,367 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:32,368 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:50:32,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:32,510 INFO L262 TraceCheckSpWp]: Trace formula consists of 55 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:32,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:32,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:32,532 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-26 11:50:32,533 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:32,533 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:32,533 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1340172942] [2023-11-26 11:50:32,534 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1340172942] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:32,534 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:32,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:32,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1237152904] [2023-11-26 11:50:32,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:32,536 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:32,536 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:32,537 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:32,537 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:32,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:50:32,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 flow. Second operand has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:32,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:32,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:50:32,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:33,096 INFO L124 PetriNetUnfolderBase]: 1175/2198 cut-off events. [2023-11-26 11:50:33,096 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:50:33,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3992 conditions, 2198 events. 1175/2198 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16991 event pairs, 879 based on Foata normal form. 1/2014 useless extension candidates. Maximal degree in co-relation 3981. Up to 1276 conditions per place. [2023-11-26 11:50:33,156 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-26 11:50:33,156 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 66 transitions, 206 flow [2023-11-26 11:50:33,157 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:33,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:33,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:50:33,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:50:33,159 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:50:33,159 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:50:33,160 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:33,160 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:50:33,161 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:33,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:33,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:33,163 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:50:33,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 66 transitions, 206 flow [2023-11-26 11:50:33,167 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 66 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:33,169 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-26 11:50:33,169 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-26 11:50:33,170 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-26 11:50:33,171 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-26 11:50:33,171 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.666666666666664) internal successors, (122), 3 states have internal predecessors, (122), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:33,171 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:33,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:33,179 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:33,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:33,374 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:33,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:33,375 INFO L85 PathProgramCache]: Analyzing trace with hash 404860664, now seen corresponding path program 1 times [2023-11-26 11:50:33,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:33,376 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [832553939] [2023-11-26 11:50:33,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:33,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:33,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:33,377 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:33,384 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:50:33,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:33,492 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:33,494 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:33,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:33,510 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-26 11:50:33,511 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:33,511 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:33,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [832553939] [2023-11-26 11:50:33,512 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [832553939] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:33,512 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:33,513 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:33,513 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [910574297] [2023-11-26 11:50:33,513 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:33,517 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:33,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:33,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:33,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:33,558 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:50:33,559 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:33,559 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:33,559 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:50:33,559 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:34,041 INFO L124 PetriNetUnfolderBase]: 1176/2196 cut-off events. [2023-11-26 11:50:34,042 INFO L125 PetriNetUnfolderBase]: For 60/60 co-relation queries the response was YES. [2023-11-26 11:50:34,050 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3993 conditions, 2196 events. 1176/2196 cut-off events. For 60/60 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16970 event pairs, 879 based on Foata normal form. 0/2015 useless extension candidates. Maximal degree in co-relation 3982. Up to 1276 conditions per place. [2023-11-26 11:50:34,069 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 30 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-26 11:50:34,070 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 65 transitions, 206 flow [2023-11-26 11:50:34,070 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:34,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:34,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 150 transitions. [2023-11-26 11:50:34,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.746268656716418 [2023-11-26 11:50:34,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 150 transitions. [2023-11-26 11:50:34,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 150 transitions. [2023-11-26 11:50:34,075 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:34,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 150 transitions. [2023-11-26 11:50:34,078 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.0) internal successors, (150), 3 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:34,080 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:34,081 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:34,081 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 150 transitions. [2023-11-26 11:50:34,081 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 65 transitions, 206 flow [2023-11-26 11:50:34,086 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 65 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:34,089 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-26 11:50:34,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-26 11:50:34,091 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-26 11:50:34,091 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-26 11:50:34,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.333333333333336) internal successors, (121), 3 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:34,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:34,092 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:34,101 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:34,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:34,298 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:34,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:34,299 INFO L85 PathProgramCache]: Analyzing trace with hash 404860665, now seen corresponding path program 1 times [2023-11-26 11:50:34,299 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:34,299 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1387593908] [2023-11-26 11:50:34,299 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:34,299 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:34,300 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:34,301 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:34,302 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:50:34,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:34,420 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:50:34,422 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:34,452 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:50:34,465 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-26 11:50:34,465 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:34,465 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:34,466 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1387593908] [2023-11-26 11:50:34,466 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1387593908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:34,466 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:34,466 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:34,467 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2023384231] [2023-11-26 11:50:34,467 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:34,467 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:34,468 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:34,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:34,470 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:34,534 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 40 out of 67 [2023-11-26 11:50:34,534 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:34,535 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:34,535 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 40 of 67 [2023-11-26 11:50:34,535 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:35,072 INFO L124 PetriNetUnfolderBase]: 1175/2194 cut-off events. [2023-11-26 11:50:35,072 INFO L125 PetriNetUnfolderBase]: For 61/61 co-relation queries the response was YES. [2023-11-26 11:50:35,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3989 conditions, 2194 events. 1175/2194 cut-off events. For 61/61 co-relation queries the response was YES. Maximal size of possible extension queue 186. Compared 16730 event pairs, 742 based on Foata normal form. 2/2016 useless extension candidates. Maximal degree in co-relation 3979. Up to 1273 conditions per place. [2023-11-26 11:50:35,104 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 29 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-26 11:50:35,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 64 transitions, 202 flow [2023-11-26 11:50:35,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:35,105 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:35,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-26 11:50:35,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7562189054726368 [2023-11-26 11:50:35,108 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-26 11:50:35,109 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-26 11:50:35,110 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:35,110 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-26 11:50:35,111 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 50.666666666666664) internal successors, (152), 3 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:35,113 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:35,113 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:35,114 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 152 transitions. [2023-11-26 11:50:35,114 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 64 transitions, 202 flow [2023-11-26 11:50:35,119 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 64 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:35,120 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-26 11:50:35,121 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-26 11:50:35,123 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-26 11:50:35,123 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-26 11:50:35,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:35,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:35,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:35,132 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:50:35,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:35,326 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-26 11:50:35,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:35,327 INFO L85 PathProgramCache]: Analyzing trace with hash 936296139, now seen corresponding path program 1 times [2023-11-26 11:50:35,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:35,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [224828379] [2023-11-26 11:50:35,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:35,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:35,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:35,329 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:35,332 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_558a0593-440a-4b00-ae7d-05517adff201/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-26 11:50:35,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:35,440 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:35,442 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:35,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:35,455 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-26 11:50:35,455 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:35,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:35,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [224828379] [2023-11-26 11:50:35,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [224828379] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:35,456 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:35,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:35,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [808145900] [2023-11-26 11:50:35,457 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:35,457 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:35,457 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:35,458 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:35,458 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:35,493 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 67 [2023-11-26 11:50:35,494 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 41.0) internal successors, (123), 3 states have internal predecessors, (123), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:35,494 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:35,494 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 67 [2023-11-26 11:50:35,495 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand