./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:07:13,555 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:07:13,639 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 05:07:13,644 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:07:13,644 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:07:13,666 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:07:13,666 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:07:13,667 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:07:13,668 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:07:13,668 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:07:13,669 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:07:13,669 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:07:13,670 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:07:13,671 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:07:13,671 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:07:13,672 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:07:13,673 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:07:13,673 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:07:13,674 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:07:13,674 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:07:13,674 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:07:13,678 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:07:13,678 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:07:13,678 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:07:13,679 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:07:13,679 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:07:13,680 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:07:13,680 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:07:13,680 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:07:13,681 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:07:13,681 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:07:13,681 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:07:13,682 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:07:13,682 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:07:13,682 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:07:13,682 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 05:07:13,683 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 05:07:13,683 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:07:13,683 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:07:13,683 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:07:13,683 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:07:13,684 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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2023-11-29 05:07:13,926 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:07:13,945 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:07:13,947 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:07:13,948 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:07:13,949 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:07:13,950 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-29 05:07:16,706 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:07:16,940 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:07:16,941 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-29 05:07:16,957 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/cf25f89e6/02f89a49757e44ef8c743d0d3a88da83/FLAGd70bfdd95 [2023-11-29 05:07:16,969 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/cf25f89e6/02f89a49757e44ef8c743d0d3a88da83 [2023-11-29 05:07:16,972 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:07:16,973 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:07:16,975 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:07:16,975 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:07:16,979 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:07:16,979 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:07:16" (1/1) ... [2023-11-29 05:07:16,980 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42e0b09b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:16, skipping insertion in model container [2023-11-29 05:07:16,980 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:07:16" (1/1) ... [2023-11-29 05:07:17,025 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:07:17,420 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:07:17,433 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:07:17,493 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:07:17,524 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:07:17,525 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:07:17,533 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:07:17,533 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17 WrapperNode [2023-11-29 05:07:17,533 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:07:17,535 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:07:17,535 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:07:17,535 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:07:17,543 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,560 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,590 INFO L138 Inliner]: procedures = 177, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 171 [2023-11-29 05:07:17,590 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:07:17,591 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:07:17,591 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:07:17,591 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:07:17,604 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,604 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,608 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,627 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-29 05:07:17,628 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,628 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,638 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,641 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,643 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,646 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,651 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:07:17,651 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:07:17,652 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:07:17,652 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:07:17,653 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (1/1) ... [2023-11-29 05:07:17,659 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:07:17,670 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:17,683 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:07:17,685 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:07:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 05:07:17,714 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 05:07:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 05:07:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 05:07:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 05:07:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:07:17,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:07:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:07:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:07:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:07:17,716 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:07:17,716 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:07:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:07:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:07:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:07:17,717 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:07:17,717 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:07:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 05:07:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 05:07:17,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 05:07:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 05:07:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 05:07:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:07:17,719 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:07:17,719 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:07:17,721 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:07:17,872 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:07:17,875 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:07:18,210 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:07:18,445 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:07:18,446 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:07:18,446 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:18 BoogieIcfgContainer [2023-11-29 05:07:18,446 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:07:18,448 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:07:18,449 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:07:18,452 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:07:18,452 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:07:16" (1/3) ... [2023-11-29 05:07:18,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b21bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:07:18, skipping insertion in model container [2023-11-29 05:07:18,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:17" (2/3) ... [2023-11-29 05:07:18,453 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@339b21bb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:07:18, skipping insertion in model container [2023-11-29 05:07:18,453 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:18" (3/3) ... [2023-11-29 05:07:18,454 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-11-29 05:07:18,475 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:07:18,475 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:07:18,475 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:07:18,533 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:07:18,569 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:07:18,603 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 05:07:18,603 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:07:18,607 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 05:07:18,607 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:07:18,611 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 05:07:18,622 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:07:18,629 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;@6e4430ed, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:07:18,630 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:07:18,633 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:07:18,633 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:07:18,634 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:07:18,634 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:18,634 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:07:18,635 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-29 05:07:18,640 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:18,641 INFO L85 PathProgramCache]: Analyzing trace with hash 14562, now seen corresponding path program 1 times [2023-11-29 05:07:18,651 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:18,651 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322776559] [2023-11-29 05:07:18,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:18,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:18,893 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-29 05:07:18,893 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:18,894 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322776559] [2023-11-29 05:07:18,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322776559] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:18,895 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:18,895 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:18,896 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [150370381] [2023-11-29 05:07:18,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:18,903 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:18,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:18,927 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:18,928 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:18,953 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:18,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:18,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:18,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:18,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:19,505 INFO L124 PetriNetUnfolderBase]: 1419/2599 cut-off events. [2023-11-29 05:07:19,505 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:07:19,517 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 2599 events. 1419/2599 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20187 event pairs, 1059 based on Foata normal form. 144/2582 useless extension candidates. Maximal degree in co-relation 4661. Up to 1529 conditions per place. [2023-11-29 05:07:19,536 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:07:19,536 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 214 flow [2023-11-29 05:07:19,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:19,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:19,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:19,547 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:19,547 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:19,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:19,549 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:19,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:19,553 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:19,557 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:19,557 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:19,559 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:19,560 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 214 flow [2023-11-29 05:07:19,563 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:07:19,567 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:07:19,569 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:19,572 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:07:19,572 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:07:19,573 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:19,573 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:19,573 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:07:19,573 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 05:07:19,573 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-29 05:07:19,574 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:19,574 INFO L85 PathProgramCache]: Analyzing trace with hash 14563, now seen corresponding path program 1 times [2023-11-29 05:07:19,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:19,575 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1651550732] [2023-11-29 05:07:19,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:19,575 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:19,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:19,692 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-29 05:07:19,692 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:19,692 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1651550732] [2023-11-29 05:07:19,692 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1651550732] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:19,693 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:19,693 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:19,693 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600673856] [2023-11-29 05:07:19,693 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:19,694 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:19,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:19,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:19,695 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:19,715 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:19,715 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:19,715 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:19,715 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:19,716 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:20,144 INFO L124 PetriNetUnfolderBase]: 1419/2598 cut-off events. [2023-11-29 05:07:20,144 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-29 05:07:20,148 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 2598 events. 1419/2598 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20253 event pairs, 1059 based on Foata normal form. 1/2438 useless extension candidates. Maximal degree in co-relation 4733. Up to 1528 conditions per place. [2023-11-29 05:07:20,163 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:07:20,163 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2023-11-29 05:07:20,163 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:20,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:20,165 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:20,165 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:20,165 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:20,166 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:20,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:20,166 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:20,168 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,169 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,169 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:20,169 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2023-11-29 05:07:20,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:20,175 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:07:20,176 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:20,176 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 05:07:20,177 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:07:20,177 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,177 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:20,177 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:07:20,178 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 05:07:20,178 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-29 05:07:20,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:20,179 INFO L85 PathProgramCache]: Analyzing trace with hash 434265093, now seen corresponding path program 1 times [2023-11-29 05:07:20,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:20,179 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879893806] [2023-11-29 05:07:20,179 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:20,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:20,197 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:20,238 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-29 05:07:20,238 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:20,238 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879893806] [2023-11-29 05:07:20,239 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879893806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:20,239 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:20,239 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:20,239 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1139999805] [2023-11-29 05:07:20,239 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:20,240 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:20,240 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:20,240 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:20,241 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:20,259 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:20,259 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,259 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:20,259 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:20,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:20,745 INFO L124 PetriNetUnfolderBase]: 1420/2596 cut-off events. [2023-11-29 05:07:20,745 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-29 05:07:20,751 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 2596 events. 1420/2596 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20131 event pairs, 1059 based on Foata normal form. 0/2439 useless extension candidates. Maximal degree in co-relation 4734. Up to 1528 conditions per place. [2023-11-29 05:07:20,774 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:07:20,774 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 210 flow [2023-11-29 05:07:20,775 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:20,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:20,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:20,776 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:20,777 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:20,777 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:20,777 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:20,777 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:20,778 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,779 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,780 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:20,780 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 210 flow [2023-11-29 05:07:20,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:20,787 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:07:20,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:20,788 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:07:20,788 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:07:20,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:20,789 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:07:20,789 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 05:07:20,789 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-29 05:07:20,790 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:20,790 INFO L85 PathProgramCache]: Analyzing trace with hash 434265094, now seen corresponding path program 1 times [2023-11-29 05:07:20,790 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:20,790 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896908477] [2023-11-29 05:07:20,790 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:20,791 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:20,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:20,882 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-29 05:07:20,882 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:20,883 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896908477] [2023-11-29 05:07:20,883 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896908477] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:20,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:20,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:20,884 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55735994] [2023-11-29 05:07:20,884 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:20,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:20,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:20,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:20,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:20,906 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:20,907 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:20,907 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:20,907 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:20,908 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:21,426 INFO L124 PetriNetUnfolderBase]: 1419/2594 cut-off events. [2023-11-29 05:07:21,426 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 05:07:21,432 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 2594 events. 1419/2594 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20030 event pairs, 898 based on Foata normal form. 2/2440 useless extension candidates. Maximal degree in co-relation 4731. Up to 1525 conditions per place. [2023-11-29 05:07:21,453 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:07:21,453 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 206 flow [2023-11-29 05:07:21,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:21,454 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:21,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:21,455 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:21,455 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:21,455 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:21,456 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:21,456 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:21,457 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:21,458 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:21,458 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:21,458 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:21,459 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 206 flow [2023-11-29 05:07:21,461 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:21,463 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:07:21,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:21,464 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 05:07:21,464 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:07:21,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:21,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:21,465 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:21,465 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 05:07:21,465 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-29 05:07:21,465 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:21,466 INFO L85 PathProgramCache]: Analyzing trace with hash 750343322, now seen corresponding path program 1 times [2023-11-29 05:07:21,466 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:21,466 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1622928751] [2023-11-29 05:07:21,466 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:21,467 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:21,483 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:21,524 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-29 05:07:21,525 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:21,525 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1622928751] [2023-11-29 05:07:21,525 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1622928751] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:21,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:21,526 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:21,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [214705885] [2023-11-29 05:07:21,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:21,527 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:21,527 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:21,527 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:21,528 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:21,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:21,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:21,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:21,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:21,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:21,979 INFO L124 PetriNetUnfolderBase]: 1423/2594 cut-off events. [2023-11-29 05:07:21,979 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 05:07:21,985 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4749 conditions, 2594 events. 1423/2594 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19791 event pairs, 743 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 4739. Up to 1524 conditions per place. [2023-11-29 05:07:22,002 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:07:22,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 206 flow [2023-11-29 05:07:22,002 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:22,003 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:22,003 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:22,003 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:22,004 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:22,004 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:22,004 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:22,004 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:22,005 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,006 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,006 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,006 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:22,006 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 206 flow [2023-11-29 05:07:22,009 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:22,011 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:07:22,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:22,012 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 05:07:22,012 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:07:22,012 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:22,013 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:22,013 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 05:07:22,013 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-29 05:07:22,014 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:22,014 INFO L85 PathProgramCache]: Analyzing trace with hash 750343323, now seen corresponding path program 1 times [2023-11-29 05:07:22,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:22,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1912054251] [2023-11-29 05:07:22,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:22,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:22,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:22,096 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-29 05:07:22,096 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:22,097 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1912054251] [2023-11-29 05:07:22,097 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1912054251] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:22,097 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:22,097 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:22,098 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [704079905] [2023-11-29 05:07:22,098 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:22,098 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:22,098 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:22,099 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:22,099 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:22,116 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:22,116 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,116 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:22,117 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:22,117 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:22,537 INFO L124 PetriNetUnfolderBase]: 1419/2583 cut-off events. [2023-11-29 05:07:22,537 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-29 05:07:22,543 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4732 conditions, 2583 events. 1419/2583 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20338 event pairs, 1056 based on Foata normal form. 4/2443 useless extension candidates. Maximal degree in co-relation 4722. Up to 1516 conditions per place. [2023-11-29 05:07:22,559 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:07:22,559 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 202 flow [2023-11-29 05:07:22,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:22,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:22,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:22,560 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:22,561 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:22,561 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:22,561 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:22,561 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:22,562 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,562 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,563 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,563 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:22,563 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 202 flow [2023-11-29 05:07:22,566 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:22,568 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:07:22,568 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:22,569 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 05:07:22,569 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:07:22,569 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:22,570 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:22,570 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:22,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 05:07:22,570 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-29 05:07:22,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:22,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1826419770, now seen corresponding path program 1 times [2023-11-29 05:07:22,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:22,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [872446090] [2023-11-29 05:07:22,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:22,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:22,586 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:22,627 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-29 05:07:22,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:22,628 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [872446090] [2023-11-29 05:07:22,628 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [872446090] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:22,628 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:22,628 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:22,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848558587] [2023-11-29 05:07:22,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:22,629 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:22,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:22,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:22,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:22,648 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:22,648 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 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-29 05:07:22,648 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:22,648 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:22,649 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:23,131 INFO L124 PetriNetUnfolderBase]: 1439/2572 cut-off events. [2023-11-29 05:07:23,131 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-29 05:07:23,138 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4753 conditions, 2572 events. 1439/2572 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 230. Compared 19692 event pairs, 937 based on Foata normal form. 0/2449 useless extension candidates. Maximal degree in co-relation 4743. Up to 1516 conditions per place. [2023-11-29 05:07:23,154 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:07:23,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 202 flow [2023-11-29 05:07:23,155 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:23,155 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:23,156 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:23,156 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:23,157 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:23,157 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:23,157 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:23,157 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:23,158 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,159 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,160 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,160 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:23,160 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 202 flow [2023-11-29 05:07:23,162 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:23,164 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:07:23,164 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:23,165 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:07:23,166 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:07:23,166 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-29 05:07:23,166 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:23,166 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:23,166 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 05:07:23,166 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-29 05:07:23,167 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:23,167 INFO L85 PathProgramCache]: Analyzing trace with hash -1826419769, now seen corresponding path program 1 times [2023-11-29 05:07:23,167 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:23,167 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1050615898] [2023-11-29 05:07:23,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:23,168 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:23,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:23,246 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-29 05:07:23,246 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:23,247 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1050615898] [2023-11-29 05:07:23,247 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1050615898] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:23,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:23,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:23,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651598912] [2023-11-29 05:07:23,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:23,248 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:23,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:23,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:23,249 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:23,265 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:23,266 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 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-29 05:07:23,266 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:23,266 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:23,266 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:23,650 INFO L124 PetriNetUnfolderBase]: 1419/2534 cut-off events. [2023-11-29 05:07:23,651 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-29 05:07:23,657 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4691 conditions, 2534 events. 1419/2534 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 227. Compared 18298 event pairs, 923 based on Foata normal form. 12/2421 useless extension candidates. Maximal degree in co-relation 4681. Up to 1484 conditions per place. [2023-11-29 05:07:23,670 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:07:23,670 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 198 flow [2023-11-29 05:07:23,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:23,671 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:23,672 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:23,672 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:23,672 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:23,672 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:23,672 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:23,673 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:23,673 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,674 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,675 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:23,675 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:23,675 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 198 flow [2023-11-29 05:07:23,677 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:23,679 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:07:23,679 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 05:07:23,680 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:07:23,680 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:07:23,680 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-29 05:07:23,680 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:23,681 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:23,681 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 05:07:23,681 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-29 05:07:23,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:23,682 INFO L85 PathProgramCache]: Analyzing trace with hash 2069753502, now seen corresponding path program 1 times [2023-11-29 05:07:23,682 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:23,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1550168405] [2023-11-29 05:07:23,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:23,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:23,705 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:23,814 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-29 05:07:23,814 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:23,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1550168405] [2023-11-29 05:07:23,815 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1550168405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:23,815 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:23,815 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:23,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1657276342] [2023-11-29 05:07:23,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:23,816 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:23,816 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:23,816 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:23,816 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:23,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 66 [2023-11-29 05:07:23,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-29 05:07:23,817 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:23,817 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 66 [2023-11-29 05:07:23,817 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:24,107 INFO L124 PetriNetUnfolderBase]: 1175/2018 cut-off events. [2023-11-29 05:07:24,107 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:07:24,110 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 2018 events. 1175/2018 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14365 event pairs, 199 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 3813. Up to 1361 conditions per place. [2023-11-29 05:07:24,117 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 30 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-29 05:07:24,118 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 204 flow [2023-11-29 05:07:24,118 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:24,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:24,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:07:24,119 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7676767676767676 [2023-11-29 05:07:24,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:07:24,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:07:24,120 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:24,120 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:07:24,120 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-29 05:07:24,121 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:24,121 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:24,121 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:07:24,121 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 204 flow [2023-11-29 05:07:24,122 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:24,123 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 110 flow [2023-11-29 05:07:24,124 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-29 05:07:24,124 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 05:07:24,125 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 110 flow [2023-11-29 05:07:24,125 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-29 05:07:24,125 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:24,125 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-29 05:07:24,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 05:07:24,126 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-29 05:07:24,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:24,126 INFO L85 PathProgramCache]: Analyzing trace with hash 1185510886, now seen corresponding path program 1 times [2023-11-29 05:07:24,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:24,126 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1600297201] [2023-11-29 05:07:24,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:24,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:24,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:24,918 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-29 05:07:24,919 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:24,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1600297201] [2023-11-29 05:07:24,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1600297201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:24,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:24,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:07:24,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1859021796] [2023-11-29 05:07:24,920 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:24,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 05:07:24,921 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:24,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 05:07:24,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=71, Unknown=0, NotChecked=0, Total=90 [2023-11-29 05:07:25,295 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:07:25,296 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 10 states, 10 states have (on average 37.7) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,296 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:25,296 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:07:25,296 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:25,778 INFO L124 PetriNetUnfolderBase]: 1031/1813 cut-off events. [2023-11-29 05:07:25,778 INFO L125 PetriNetUnfolderBase]: For 84/84 co-relation queries the response was YES. [2023-11-29 05:07:25,781 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3432 conditions, 1813 events. 1031/1813 cut-off events. For 84/84 co-relation queries the response was YES. Maximal size of possible extension queue 166. Compared 12804 event pairs, 158 based on Foata normal form. 60/1864 useless extension candidates. Maximal degree in co-relation 3420. Up to 756 conditions per place. [2023-11-29 05:07:25,788 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 34 selfloop transitions, 5 changer transitions 10/73 dead transitions. [2023-11-29 05:07:25,788 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 258 flow [2023-11-29 05:07:25,788 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:07:25,789 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:07:25,790 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 338 transitions. [2023-11-29 05:07:25,790 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6401515151515151 [2023-11-29 05:07:25,790 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 338 transitions. [2023-11-29 05:07:25,791 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 338 transitions. [2023-11-29 05:07:25,791 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:25,791 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 338 transitions. [2023-11-29 05:07:25,792 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 42.25) internal successors, (338), 8 states have internal predecessors, (338), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,794 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,794 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,794 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 8 states and 338 transitions. [2023-11-29 05:07:25,794 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 258 flow [2023-11-29 05:07:25,795 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 252 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:25,796 INFO L231 Difference]: Finished difference. Result has 64 places, 47 transitions, 112 flow [2023-11-29 05:07:25,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=112, PETRI_PLACES=64, PETRI_TRANSITIONS=47} [2023-11-29 05:07:25,797 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 05:07:25,798 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 47 transitions, 112 flow [2023-11-29 05:07:25,798 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.7) internal successors, (377), 10 states have internal predecessors, (377), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,798 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:25,798 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-29 05:07:25,799 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 05:07:25,799 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-29 05:07:25,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:25,799 INFO L85 PathProgramCache]: Analyzing trace with hash 1185512354, now seen corresponding path program 1 times [2023-11-29 05:07:25,800 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:25,800 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1328549790] [2023-11-29 05:07:25,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:25,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:25,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:25,959 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-29 05:07:25,960 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:25,960 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1328549790] [2023-11-29 05:07:25,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1328549790] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:25,960 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:25,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:25,961 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1406125955] [2023-11-29 05:07:25,961 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:25,961 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:25,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:25,962 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:25,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:25,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:25,966 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 47 transitions, 112 flow. Second operand has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:25,966 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:25,966 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:25,967 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:26,427 INFO L124 PetriNetUnfolderBase]: 1327/2254 cut-off events. [2023-11-29 05:07:26,427 INFO L125 PetriNetUnfolderBase]: For 83/83 co-relation queries the response was YES. [2023-11-29 05:07:26,431 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4326 conditions, 2254 events. 1327/2254 cut-off events. For 83/83 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 16389 event pairs, 307 based on Foata normal form. 0/2201 useless extension candidates. Maximal degree in co-relation 4315. Up to 853 conditions per place. [2023-11-29 05:07:26,436 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 27 selfloop transitions, 2 changer transitions 36/89 dead transitions. [2023-11-29 05:07:26,436 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 89 transitions, 330 flow [2023-11-29 05:07:26,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 05:07:26,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 05:07:26,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 363 transitions. [2023-11-29 05:07:26,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6875 [2023-11-29 05:07:26,439 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 363 transitions. [2023-11-29 05:07:26,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 363 transitions. [2023-11-29 05:07:26,439 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:26,439 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 363 transitions. [2023-11-29 05:07:26,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 45.375) internal successors, (363), 8 states have internal predecessors, (363), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:26,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:26,442 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 66.0) internal successors, (594), 9 states have internal predecessors, (594), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:26,442 INFO L175 Difference]: Start difference. First operand has 64 places, 47 transitions, 112 flow. Second operand 8 states and 363 transitions. [2023-11-29 05:07:26,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 89 transitions, 330 flow [2023-11-29 05:07:26,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 89 transitions, 319 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:07:26,444 INFO L231 Difference]: Finished difference. Result has 69 places, 46 transitions, 117 flow [2023-11-29 05:07:26,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=103, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=117, PETRI_PLACES=69, PETRI_TRANSITIONS=46} [2023-11-29 05:07:26,444 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:07:26,444 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 46 transitions, 117 flow [2023-11-29 05:07:26,445 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.8) internal successors, (199), 5 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:26,445 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:26,445 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] [2023-11-29 05:07:26,445 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 05:07:26,446 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-29 05:07:26,446 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:26,446 INFO L85 PathProgramCache]: Analyzing trace with hash -1592736718, now seen corresponding path program 1 times [2023-11-29 05:07:26,446 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:26,446 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [919017388] [2023-11-29 05:07:26,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:26,446 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:26,482 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:26,602 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-29 05:07:26,602 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:26,602 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [919017388] [2023-11-29 05:07:26,602 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [919017388] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:26,602 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:26,602 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:07:26,603 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [83771099] [2023-11-29 05:07:26,603 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:26,603 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:07:26,603 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:26,604 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:07:26,604 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:07:26,614 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:26,614 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 46 transitions, 117 flow. Second operand has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-29 05:07:26,614 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:26,614 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:26,615 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:27,264 INFO L124 PetriNetUnfolderBase]: 4223/6316 cut-off events. [2023-11-29 05:07:27,264 INFO L125 PetriNetUnfolderBase]: For 768/768 co-relation queries the response was YES. [2023-11-29 05:07:27,272 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13625 conditions, 6316 events. 4223/6316 cut-off events. For 768/768 co-relation queries the response was YES. Maximal size of possible extension queue 428. Compared 41144 event pairs, 603 based on Foata normal form. 216/6525 useless extension candidates. Maximal degree in co-relation 13609. Up to 3483 conditions per place. [2023-11-29 05:07:27,288 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 47 selfloop transitions, 6 changer transitions 1/74 dead transitions. [2023-11-29 05:07:27,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 74 transitions, 295 flow [2023-11-29 05:07:27,288 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:07:27,289 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:07:27,289 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 192 transitions. [2023-11-29 05:07:27,289 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7272727272727273 [2023-11-29 05:07:27,289 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 192 transitions. [2023-11-29 05:07:27,290 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 192 transitions. [2023-11-29 05:07:27,290 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:27,290 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 192 transitions. [2023-11-29 05:07:27,291 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.0) internal successors, (192), 4 states have internal predecessors, (192), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:27,292 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:27,292 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:27,293 INFO L175 Difference]: Start difference. First operand has 69 places, 46 transitions, 117 flow. Second operand 4 states and 192 transitions. [2023-11-29 05:07:27,293 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 74 transitions, 295 flow [2023-11-29 05:07:27,321 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 74 transitions, 279 flow, removed 4 selfloop flow, removed 6 redundant places. [2023-11-29 05:07:27,323 INFO L231 Difference]: Finished difference. Result has 62 places, 50 transitions, 147 flow [2023-11-29 05:07:27,323 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=147, PETRI_PLACES=62, PETRI_TRANSITIONS=50} [2023-11-29 05:07:27,324 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:07:27,324 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 50 transitions, 147 flow [2023-11-29 05:07:27,324 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 38.0) internal successors, (152), 4 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-29 05:07:27,324 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:27,324 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] [2023-11-29 05:07:27,324 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 05:07:27,325 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-29 05:07:27,325 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:27,325 INFO L85 PathProgramCache]: Analyzing trace with hash -1756570366, now seen corresponding path program 1 times [2023-11-29 05:07:27,325 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:27,325 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1116706835] [2023-11-29 05:07:27,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:27,326 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:27,371 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:27,546 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-29 05:07:27,546 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:27,546 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1116706835] [2023-11-29 05:07:27,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1116706835] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:27,546 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:27,547 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:27,547 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1031531133] [2023-11-29 05:07:27,547 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:27,547 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:27,548 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:27,548 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:27,549 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:27,555 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:27,555 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 50 transitions, 147 flow. Second operand has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:27,555 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:27,555 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:27,556 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:28,152 INFO L124 PetriNetUnfolderBase]: 3605/5436 cut-off events. [2023-11-29 05:07:28,153 INFO L125 PetriNetUnfolderBase]: For 1548/1548 co-relation queries the response was YES. [2023-11-29 05:07:28,164 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13235 conditions, 5436 events. 3605/5436 cut-off events. For 1548/1548 co-relation queries the response was YES. Maximal size of possible extension queue 344. Compared 34369 event pairs, 213 based on Foata normal form. 208/5637 useless extension candidates. Maximal degree in co-relation 13221. Up to 2673 conditions per place. [2023-11-29 05:07:28,187 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 60 selfloop transitions, 10 changer transitions 1/91 dead transitions. [2023-11-29 05:07:28,188 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 91 transitions, 406 flow [2023-11-29 05:07:28,188 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:07:28,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:07:28,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 243 transitions. [2023-11-29 05:07:28,189 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7363636363636363 [2023-11-29 05:07:28,189 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 243 transitions. [2023-11-29 05:07:28,189 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 243 transitions. [2023-11-29 05:07:28,190 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:28,190 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 243 transitions. [2023-11-29 05:07:28,191 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.6) internal successors, (243), 5 states have internal predecessors, (243), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:28,191 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:28,192 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:28,192 INFO L175 Difference]: Start difference. First operand has 62 places, 50 transitions, 147 flow. Second operand 5 states and 243 transitions. [2023-11-29 05:07:28,192 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 91 transitions, 406 flow [2023-11-29 05:07:28,194 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 91 transitions, 395 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:28,195 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 199 flow [2023-11-29 05:07:28,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=199, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-29 05:07:28,196 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 05:07:28,196 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 199 flow [2023-11-29 05:07:28,196 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.6) internal successors, (188), 5 states have internal predecessors, (188), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:28,196 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:28,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, 1] [2023-11-29 05:07:28,196 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 05:07:28,196 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-29 05:07:28,197 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:28,197 INFO L85 PathProgramCache]: Analyzing trace with hash -2143429093, now seen corresponding path program 1 times [2023-11-29 05:07:28,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:28,197 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1563204654] [2023-11-29 05:07:28,197 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:28,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:28,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:28,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:07:28,449 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:28,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1563204654] [2023-11-29 05:07:28,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1563204654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:28,450 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:28,450 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:07:28,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [647399736] [2023-11-29 05:07:28,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:28,450 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:28,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:28,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:28,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:28,457 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:28,457 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 199 flow. Second operand has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:28,458 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:28,458 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:28,458 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:28,978 INFO L124 PetriNetUnfolderBase]: 2467/3742 cut-off events. [2023-11-29 05:07:28,979 INFO L125 PetriNetUnfolderBase]: For 3118/3118 co-relation queries the response was YES. [2023-11-29 05:07:28,986 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10189 conditions, 3742 events. 2467/3742 cut-off events. For 3118/3118 co-relation queries the response was YES. Maximal size of possible extension queue 175. Compared 21039 event pairs, 81 based on Foata normal form. 164/3899 useless extension candidates. Maximal degree in co-relation 10173. Up to 1249 conditions per place. [2023-11-29 05:07:28,997 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 71 selfloop transitions, 14 changer transitions 1/106 dead transitions. [2023-11-29 05:07:28,998 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 106 transitions, 531 flow [2023-11-29 05:07:28,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:28,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:07:28,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 292 transitions. [2023-11-29 05:07:29,000 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:29,000 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 292 transitions. [2023-11-29 05:07:29,000 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 292 transitions. [2023-11-29 05:07:29,001 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:29,001 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 292 transitions. [2023-11-29 05:07:29,002 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.666666666666664) internal successors, (292), 6 states have internal predecessors, (292), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,003 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,003 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,003 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 199 flow. Second operand 6 states and 292 transitions. [2023-11-29 05:07:29,004 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 106 transitions, 531 flow [2023-11-29 05:07:29,013 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 106 transitions, 501 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:07:29,015 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 249 flow [2023-11-29 05:07:29,015 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=249, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-29 05:07:29,016 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:07:29,016 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 249 flow [2023-11-29 05:07:29,016 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 37.166666666666664) internal successors, (223), 6 states have internal predecessors, (223), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,016 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:29,016 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] [2023-11-29 05:07:29,016 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 05:07:29,016 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-29 05:07:29,016 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:29,017 INFO L85 PathProgramCache]: Analyzing trace with hash -1393410852, now seen corresponding path program 1 times [2023-11-29 05:07:29,017 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:29,017 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [929011580] [2023-11-29 05:07:29,017 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:29,017 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:29,065 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:29,283 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-29 05:07:29,283 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:29,284 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [929011580] [2023-11-29 05:07:29,284 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [929011580] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:29,284 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:29,284 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:29,284 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381539433] [2023-11-29 05:07:29,284 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:29,285 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:29,285 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:29,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:29,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:29,301 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:29,302 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 249 flow. Second operand has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,302 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:29,302 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:29,302 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:29,753 INFO L124 PetriNetUnfolderBase]: 1559/2318 cut-off events. [2023-11-29 05:07:29,753 INFO L125 PetriNetUnfolderBase]: For 3480/3480 co-relation queries the response was YES. [2023-11-29 05:07:29,757 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7030 conditions, 2318 events. 1559/2318 cut-off events. For 3480/3480 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11413 event pairs, 47 based on Foata normal form. 80/2391 useless extension candidates. Maximal degree in co-relation 7013. Up to 768 conditions per place. [2023-11-29 05:07:29,764 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 64 selfloop transitions, 18 changer transitions 1/103 dead transitions. [2023-11-29 05:07:29,764 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 103 transitions, 527 flow [2023-11-29 05:07:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:29,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:07:29,766 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 323 transitions. [2023-11-29 05:07:29,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6991341991341992 [2023-11-29 05:07:29,767 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 323 transitions. [2023-11-29 05:07:29,767 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 323 transitions. [2023-11-29 05:07:29,767 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:29,767 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 323 transitions. [2023-11-29 05:07:29,769 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.142857142857146) internal successors, (323), 7 states have internal predecessors, (323), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,770 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,771 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,771 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 249 flow. Second operand 7 states and 323 transitions. [2023-11-29 05:07:29,771 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 103 transitions, 527 flow [2023-11-29 05:07:29,785 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 103 transitions, 474 flow, removed 10 selfloop flow, removed 6 redundant places. [2023-11-29 05:07:29,787 INFO L231 Difference]: Finished difference. Result has 71 places, 58 transitions, 255 flow [2023-11-29 05:07:29,787 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=202, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=255, PETRI_PLACES=71, PETRI_TRANSITIONS=58} [2023-11-29 05:07:29,787 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -2 predicate places. [2023-11-29 05:07:29,787 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 58 transitions, 255 flow [2023-11-29 05:07:29,788 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.857142857142854) internal successors, (258), 7 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:29,788 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:29,788 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] [2023-11-29 05:07:29,788 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 05:07:29,788 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-29 05:07:29,788 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:29,788 INFO L85 PathProgramCache]: Analyzing trace with hash -1871955353, now seen corresponding path program 1 times [2023-11-29 05:07:29,788 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:29,789 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [234210276] [2023-11-29 05:07:29,789 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:29,789 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:29,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:30,101 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-29 05:07:30,101 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:30,101 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [234210276] [2023-11-29 05:07:30,102 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [234210276] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:30,102 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:30,102 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:30,102 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1494265992] [2023-11-29 05:07:30,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:30,103 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:30,103 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:30,104 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:30,104 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:30,121 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 66 [2023-11-29 05:07:30,122 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 58 transitions, 255 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:30,122 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:30,122 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 66 [2023-11-29 05:07:30,122 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:30,894 INFO L124 PetriNetUnfolderBase]: 3095/5261 cut-off events. [2023-11-29 05:07:30,894 INFO L125 PetriNetUnfolderBase]: For 2831/2999 co-relation queries the response was YES. [2023-11-29 05:07:30,913 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12557 conditions, 5261 events. 3095/5261 cut-off events. For 2831/2999 co-relation queries the response was YES. Maximal size of possible extension queue 315. Compared 35037 event pairs, 307 based on Foata normal form. 16/5044 useless extension candidates. Maximal degree in co-relation 12540. Up to 2288 conditions per place. [2023-11-29 05:07:30,930 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 53 selfloop transitions, 11 changer transitions 12/108 dead transitions. [2023-11-29 05:07:30,930 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 108 transitions, 530 flow [2023-11-29 05:07:30,930 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:30,930 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:07:30,931 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2023-11-29 05:07:30,932 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6666666666666666 [2023-11-29 05:07:30,932 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 308 transitions. [2023-11-29 05:07:30,932 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 308 transitions. [2023-11-29 05:07:30,932 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:30,932 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 308 transitions. [2023-11-29 05:07:30,933 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.0) internal successors, (308), 7 states have internal predecessors, (308), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:30,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:30,935 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:30,935 INFO L175 Difference]: Start difference. First operand has 71 places, 58 transitions, 255 flow. Second operand 7 states and 308 transitions. [2023-11-29 05:07:30,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 108 transitions, 530 flow [2023-11-29 05:07:30,992 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 108 transitions, 424 flow, removed 22 selfloop flow, removed 10 redundant places. [2023-11-29 05:07:30,993 INFO L231 Difference]: Finished difference. Result has 72 places, 67 transitions, 240 flow [2023-11-29 05:07:30,993 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=240, PETRI_PLACES=72, PETRI_TRANSITIONS=67} [2023-11-29 05:07:30,993 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -1 predicate places. [2023-11-29 05:07:30,993 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 67 transitions, 240 flow [2023-11-29 05:07:30,994 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:30,994 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:30,994 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] [2023-11-29 05:07:30,994 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 05:07:30,994 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-29 05:07:30,995 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:30,995 INFO L85 PathProgramCache]: Analyzing trace with hash 1116530089, now seen corresponding path program 2 times [2023-11-29 05:07:30,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:30,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1381938206] [2023-11-29 05:07:30,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:30,995 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:31,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:31,286 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-29 05:07:31,287 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:31,287 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1381938206] [2023-11-29 05:07:31,287 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1381938206] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:31,287 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:31,287 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:31,288 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [655866461] [2023-11-29 05:07:31,288 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:31,288 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:31,289 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:31,289 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:31,289 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:31,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:07:31,294 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 67 transitions, 240 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:31,294 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:31,294 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:07:31,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:32,192 INFO L124 PetriNetUnfolderBase]: 4639/8149 cut-off events. [2023-11-29 05:07:32,192 INFO L125 PetriNetUnfolderBase]: For 2657/2693 co-relation queries the response was YES. [2023-11-29 05:07:32,210 INFO L83 FinitePrefix]: Finished finitePrefix Result has 18785 conditions, 8149 events. 4639/8149 cut-off events. For 2657/2693 co-relation queries the response was YES. Maximal size of possible extension queue 507. Compared 61597 event pairs, 1227 based on Foata normal form. 38/7673 useless extension candidates. Maximal degree in co-relation 18768. Up to 2710 conditions per place. [2023-11-29 05:07:32,221 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 43 selfloop transitions, 2 changer transitions 29/112 dead transitions. [2023-11-29 05:07:32,222 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 112 transitions, 537 flow [2023-11-29 05:07:32,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:32,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:07:32,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 273 transitions. [2023-11-29 05:07:32,224 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6893939393939394 [2023-11-29 05:07:32,224 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 273 transitions. [2023-11-29 05:07:32,224 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 273 transitions. [2023-11-29 05:07:32,224 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:32,224 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 273 transitions. [2023-11-29 05:07:32,225 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.5) internal successors, (273), 6 states have internal predecessors, (273), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:32,227 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:32,227 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:32,227 INFO L175 Difference]: Start difference. First operand has 72 places, 67 transitions, 240 flow. Second operand 6 states and 273 transitions. [2023-11-29 05:07:32,227 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 112 transitions, 537 flow [2023-11-29 05:07:32,229 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 112 transitions, 531 flow, removed 3 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:32,231 INFO L231 Difference]: Finished difference. Result has 77 places, 68 transitions, 261 flow [2023-11-29 05:07:32,231 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=236, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=67, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=261, PETRI_PLACES=77, PETRI_TRANSITIONS=68} [2023-11-29 05:07:32,231 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 4 predicate places. [2023-11-29 05:07:32,231 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 68 transitions, 261 flow [2023-11-29 05:07:32,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:32,232 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:32,232 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] [2023-11-29 05:07:32,232 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 05:07:32,232 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-29 05:07:32,232 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:32,232 INFO L85 PathProgramCache]: Analyzing trace with hash 1958385853, now seen corresponding path program 3 times [2023-11-29 05:07:32,232 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:32,232 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [225999237] [2023-11-29 05:07:32,232 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:32,233 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:32,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:32,437 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-29 05:07:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [225999237] [2023-11-29 05:07:32,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [225999237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:32,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338393250] [2023-11-29 05:07:32,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:32,439 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:32,447 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:07:32,448 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 68 transitions, 261 flow. Second operand has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:32,448 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:32,448 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:07:32,448 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:33,697 INFO L124 PetriNetUnfolderBase]: 6440/11277 cut-off events. [2023-11-29 05:07:33,698 INFO L125 PetriNetUnfolderBase]: For 3559/3647 co-relation queries the response was YES. [2023-11-29 05:07:33,728 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25380 conditions, 11277 events. 6440/11277 cut-off events. For 3559/3647 co-relation queries the response was YES. Maximal size of possible extension queue 759. Compared 91067 event pairs, 1824 based on Foata normal form. 44/10464 useless extension candidates. Maximal degree in co-relation 25360. Up to 4603 conditions per place. [2023-11-29 05:07:33,741 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 52 selfloop transitions, 3 changer transitions 12/107 dead transitions. [2023-11-29 05:07:33,741 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 107 transitions, 517 flow [2023-11-29 05:07:33,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:33,742 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:07:33,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 269 transitions. [2023-11-29 05:07:33,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6792929292929293 [2023-11-29 05:07:33,743 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 269 transitions. [2023-11-29 05:07:33,743 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 269 transitions. [2023-11-29 05:07:33,743 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:33,743 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 269 transitions. [2023-11-29 05:07:33,744 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 44.833333333333336) internal successors, (269), 6 states have internal predecessors, (269), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:33,745 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:33,745 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:33,745 INFO L175 Difference]: Start difference. First operand has 77 places, 68 transitions, 261 flow. Second operand 6 states and 269 transitions. [2023-11-29 05:07:33,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 107 transitions, 517 flow [2023-11-29 05:07:33,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 107 transitions, 510 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:07:33,757 INFO L231 Difference]: Finished difference. Result has 81 places, 70 transitions, 287 flow [2023-11-29 05:07:33,757 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=256, PETRI_DIFFERENCE_MINUEND_PLACES=72, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=287, PETRI_PLACES=81, PETRI_TRANSITIONS=70} [2023-11-29 05:07:33,757 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 8 predicate places. [2023-11-29 05:07:33,758 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 70 transitions, 287 flow [2023-11-29 05:07:33,758 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.333333333333336) internal successors, (230), 6 states have internal predecessors, (230), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:33,758 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:33,758 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] [2023-11-29 05:07:33,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 05:07:33,758 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-29 05:07:33,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:33,758 INFO L85 PathProgramCache]: Analyzing trace with hash -269041035, now seen corresponding path program 4 times [2023-11-29 05:07:33,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:33,759 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1978677583] [2023-11-29 05:07:33,759 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:33,759 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:33,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:34,123 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-29 05:07:34,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:34,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1978677583] [2023-11-29 05:07:34,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1978677583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:34,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:34,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:07:34,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540635084] [2023-11-29 05:07:34,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:34,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:07:34,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:34,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:07:34,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:07:34,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 66 [2023-11-29 05:07:34,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 70 transitions, 287 flow. Second operand has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 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-29 05:07:34,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:34,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 66 [2023-11-29 05:07:34,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:36,037 INFO L124 PetriNetUnfolderBase]: 8866/15461 cut-off events. [2023-11-29 05:07:36,037 INFO L125 PetriNetUnfolderBase]: For 4994/5084 co-relation queries the response was YES. [2023-11-29 05:07:36,082 INFO L83 FinitePrefix]: Finished finitePrefix Result has 35093 conditions, 15461 events. 8866/15461 cut-off events. For 4994/5084 co-relation queries the response was YES. Maximal size of possible extension queue 1116. Compared 130024 event pairs, 2295 based on Foata normal form. 18/14266 useless extension candidates. Maximal degree in co-relation 35071. Up to 5942 conditions per place. [2023-11-29 05:07:36,091 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 27 selfloop transitions, 4 changer transitions 91/159 dead transitions. [2023-11-29 05:07:36,091 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 159 transitions, 836 flow [2023-11-29 05:07:36,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 05:07:36,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14 states. [2023-11-29 05:07:36,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 595 transitions. [2023-11-29 05:07:36,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6439393939393939 [2023-11-29 05:07:36,094 INFO L72 ComplementDD]: Start complementDD. Operand 14 states and 595 transitions. [2023-11-29 05:07:36,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 14 states and 595 transitions. [2023-11-29 05:07:36,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:36,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 14 states and 595 transitions. [2023-11-29 05:07:36,096 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 15 states, 14 states have (on average 42.5) internal successors, (595), 14 states have internal predecessors, (595), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:36,098 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:36,098 INFO L81 ComplementDD]: Finished complementDD. Result has 15 states, 15 states have (on average 66.0) internal successors, (990), 15 states have internal predecessors, (990), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:36,098 INFO L175 Difference]: Start difference. First operand has 81 places, 70 transitions, 287 flow. Second operand 14 states and 595 transitions. [2023-11-29 05:07:36,098 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 159 transitions, 836 flow [2023-11-29 05:07:36,118 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 89 places, 159 transitions, 829 flow, removed 3 selfloop flow, removed 3 redundant places. [2023-11-29 05:07:36,120 INFO L231 Difference]: Finished difference. Result has 95 places, 61 transitions, 245 flow [2023-11-29 05:07:36,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=282, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=66, PETRI_DIFFERENCE_SUBTRAHEND_STATES=14, PETRI_FLOW=245, PETRI_PLACES=95, PETRI_TRANSITIONS=61} [2023-11-29 05:07:36,120 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 22 predicate places. [2023-11-29 05:07:36,120 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 61 transitions, 245 flow [2023-11-29 05:07:36,121 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 37.22222222222222) internal successors, (335), 9 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-29 05:07:36,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:36,121 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] [2023-11-29 05:07:36,121 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 05:07:36,121 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-29 05:07:36,121 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:36,122 INFO L85 PathProgramCache]: Analyzing trace with hash -612432661, now seen corresponding path program 5 times [2023-11-29 05:07:36,122 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:36,122 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721720750] [2023-11-29 05:07:36,122 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:36,122 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:36,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:37,029 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-29 05:07:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 05:07:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721720750] [2023-11-29 05:07:37,030 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721720750] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:37,030 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:37,030 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:07:37,030 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [842406572] [2023-11-29 05:07:37,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:37,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:07:37,031 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 05:07:37,031 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:07:37,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:07:37,046 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:37,046 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 61 transitions, 245 flow. Second operand has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:37,047 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:37,047 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:37,047 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:38,016 INFO L124 PetriNetUnfolderBase]: 3273/6040 cut-off events. [2023-11-29 05:07:38,017 INFO L125 PetriNetUnfolderBase]: For 3701/3873 co-relation queries the response was YES. [2023-11-29 05:07:38,044 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13449 conditions, 6040 events. 3273/6040 cut-off events. For 3701/3873 co-relation queries the response was YES. Maximal size of possible extension queue 481. Compared 46513 event pairs, 628 based on Foata normal form. 16/5468 useless extension candidates. Maximal degree in co-relation 13422. Up to 1583 conditions per place. [2023-11-29 05:07:38,052 INFO L140 encePairwiseOnDemand]: 57/66 looper letters, 34 selfloop transitions, 6 changer transitions 18/97 dead transitions. [2023-11-29 05:07:38,052 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 94 places, 97 transitions, 451 flow [2023-11-29 05:07:38,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:07:38,052 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:07:38,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 429 transitions. [2023-11-29 05:07:38,054 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.65 [2023-11-29 05:07:38,054 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 429 transitions. [2023-11-29 05:07:38,055 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 429 transitions. [2023-11-29 05:07:38,055 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:38,055 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 429 transitions. [2023-11-29 05:07:38,057 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 42.9) internal successors, (429), 10 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:38,059 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:38,059 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:38,059 INFO L175 Difference]: Start difference. First operand has 95 places, 61 transitions, 245 flow. Second operand 10 states and 429 transitions. [2023-11-29 05:07:38,060 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 94 places, 97 transitions, 451 flow [2023-11-29 05:07:38,065 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 97 transitions, 411 flow, removed 16 selfloop flow, removed 9 redundant places. [2023-11-29 05:07:38,067 INFO L231 Difference]: Finished difference. Result has 89 places, 62 transitions, 244 flow [2023-11-29 05:07:38,067 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=217, PETRI_DIFFERENCE_MINUEND_PLACES=76, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=244, PETRI_PLACES=89, PETRI_TRANSITIONS=62} [2023-11-29 05:07:38,067 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 16 predicate places. [2023-11-29 05:07:38,067 INFO L495 AbstractCegarLoop]: Abstraction has has 89 places, 62 transitions, 244 flow [2023-11-29 05:07:38,068 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 39.0) internal successors, (351), 9 states have internal predecessors, (351), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:38,068 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:38,068 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] [2023-11-29 05:07:38,068 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 05:07:38,068 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-29 05:07:38,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:38,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1676504269, now seen corresponding path program 6 times [2023-11-29 05:07:38,069 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 05:07:38,069 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [391609505] [2023-11-29 05:07:38,070 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:38,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 05:07:38,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:07:38,128 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:07:38,181 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:07:38,217 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 05:07:38,217 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:07:38,218 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:07:38,219 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:07:38,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:07:38,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:07:38,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:07:38,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:07:38,220 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:07:38,221 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:07:38,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:07:38,222 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:07:38,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 05:07:38,222 INFO L445 BasicCegarLoop]: Path program histogram: [6, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:38,228 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:07:38,228 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:07:38,295 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:07:38,297 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:07:38,298 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:07:38,300 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 05:07:38,316 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:07:38,317 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:07:38,332 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:07:38 BasicIcfg [2023-11-29 05:07:38,332 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:07:38,332 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:07:38,333 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:07:38,333 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:07:38,333 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:18" (3/4) ... [2023-11-29 05:07:38,335 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:07:38,335 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:07:38,336 INFO L158 Benchmark]: Toolchain (without parser) took 21362.75ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 130.7MB in the beginning and 523.5MB in the end (delta: -392.8MB). Peak memory consumption was 649.8MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,336 INFO L158 Benchmark]: CDTParser took 0.12ms. Allocated memory is still 117.4MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:07:38,336 INFO L158 Benchmark]: CACSL2BoogieTranslator took 559.18ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 127.5MB in the end (delta: 3.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,337 INFO L158 Benchmark]: Boogie Procedure Inliner took 55.86ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 124.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,337 INFO L158 Benchmark]: Boogie Preprocessor took 59.80ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 120.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,337 INFO L158 Benchmark]: RCFGBuilder took 794.93ms. Allocated memory is still 169.9MB. Free memory was 120.8MB in the beginning and 126.2MB in the end (delta: -5.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,338 INFO L158 Benchmark]: TraceAbstraction took 19883.68ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.5MB in the beginning and 523.5MB in the end (delta: -398.1MB). Peak memory consumption was 646.0MB. Max. memory is 16.1GB. [2023-11-29 05:07:38,338 INFO L158 Benchmark]: Witness Printer took 2.92ms. Allocated memory is still 1.2GB. Free memory is still 523.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:07:38,339 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.12ms. Allocated memory is still 117.4MB. Free memory is still 90.1MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 559.18ms. Allocated memory is still 169.9MB. Free memory was 130.7MB in the beginning and 127.5MB in the end (delta: 3.2MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 55.86ms. Allocated memory is still 169.9MB. Free memory was 127.5MB in the beginning and 124.9MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 59.80ms. Allocated memory is still 169.9MB. Free memory was 124.9MB in the beginning and 120.8MB in the end (delta: 4.1MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 794.93ms. Allocated memory is still 169.9MB. Free memory was 120.8MB in the beginning and 126.2MB in the end (delta: -5.5MB). Peak memory consumption was 48.4MB. Max. memory is 16.1GB. * TraceAbstraction took 19883.68ms. Allocated memory was 169.9MB in the beginning and 1.2GB in the end (delta: 1.0GB). Free memory was 125.5MB in the beginning and 523.5MB in the end (delta: -398.1MB). Peak memory consumption was 646.0MB. Max. memory is 16.1GB. * Witness Printer took 2.92ms. Allocated memory is still 1.2GB. Free memory is still 523.5MB. 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~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: IdentifierExpression #t~pre13 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, 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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, 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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x=1, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={5:0}, t446={6:0}, t447={7:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix017_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 873]: 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: 869]: 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: 867]: 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: 871]: 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, 99 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: 19.7s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 6, EmptinessCheckTime: 0.0s, AutomataDifference: 14.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1175 SdHoareTripleChecker+Valid, 3.1s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 979 mSDsluCounter, 174 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 134 mSDsCounter, 61 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3064 IncrementalHoareTripleChecker+Invalid, 3125 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 61 mSolverCounterUnsat, 40 mSDtfsCounter, 3064 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 116 GetRequests, 19 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 77 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=287occurred in iteration=18, InterpolantAutomatonStates: 108, 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.4s SatisfiabilityAnalysisTime, 4.2s InterpolantComputationTime, 480 NumberOfCodeBlocks, 480 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 418 ConstructedInterpolants, 0 QuantifiedInterpolants, 2545 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-29 05:07:38,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya --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 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 05:07:40,442 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 05:07:40,525 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 05:07:40,531 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 05:07:40,532 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 05:07:40,559 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 05:07:40,560 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 05:07:40,561 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 05:07:40,561 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 05:07:40,562 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 05:07:40,563 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 05:07:40,563 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 05:07:40,564 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 05:07:40,565 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 05:07:40,565 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 05:07:40,566 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 05:07:40,567 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 05:07:40,567 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 05:07:40,568 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 05:07:40,568 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 05:07:40,569 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 05:07:40,570 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 05:07:40,571 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 05:07:40,571 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 05:07:40,571 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 05:07:40,572 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 05:07:40,572 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 05:07:40,572 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 05:07:40,573 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 05:07:40,573 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 05:07:40,574 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 05:07:40,574 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 05:07:40,574 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 05:07:40,575 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 05:07:40,575 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:07:40,575 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 05:07:40,576 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 05:07:40,576 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 05:07:40,576 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 05:07:40,576 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 05:07:40,576 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 05:07:40,577 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 05:07:40,577 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 05:07:40,577 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 05:07:40,577 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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya 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 -> 39f434d3f7e7749f4257e03557066c1349e963b1d489e771c14fc3ff33c9a6c7 [2023-11-29 05:07:40,858 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 05:07:40,879 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 05:07:40,881 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 05:07:40,882 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 05:07:40,883 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 05:07:40,884 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-29 05:07:43,667 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 05:07:43,919 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 05:07:43,920 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/sv-benchmarks/c/pthread-wmm/mix017_pso.opt_tso.opt.i [2023-11-29 05:07:43,940 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/c7d7fd9be/3d94e5dcb5ec48ce97b45b31922b45cb/FLAG357402bd4 [2023-11-29 05:07:44,231 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/data/c7d7fd9be/3d94e5dcb5ec48ce97b45b31922b45cb [2023-11-29 05:07:44,233 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 05:07:44,235 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 05:07:44,237 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 05:07:44,237 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 05:07:44,243 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 05:07:44,244 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1c144f05 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44, skipping insertion in model container [2023-11-29 05:07:44,245 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,311 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 05:07:44,706 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:07:44,722 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 05:07:44,782 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 05:07:44,832 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:07:44,832 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 05:07:44,840 INFO L206 MainTranslator]: Completed translation [2023-11-29 05:07:44,840 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44 WrapperNode [2023-11-29 05:07:44,841 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 05:07:44,842 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 05:07:44,842 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 05:07:44,842 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 05:07:44,849 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,869 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,896 INFO L138 Inliner]: procedures = 180, calls = 70, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 172 [2023-11-29 05:07:44,896 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 05:07:44,897 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 05:07:44,897 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 05:07:44,897 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 05:07:44,909 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,909 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,914 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,936 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-29 05:07:44,936 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,937 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,955 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,958 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,963 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 05:07:44,964 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 05:07:44,965 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 05:07:44,965 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 05:07:44,966 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (1/1) ... [2023-11-29 05:07:44,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 05:07:44,984 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 05:07:44,996 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 05:07:45,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 05:07:45,038 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 05:07:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 05:07:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 05:07:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 05:07:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 05:07:45,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 05:07:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 05:07:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 05:07:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 05:07:45,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 05:07:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 05:07:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 05:07:45,041 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 05:07:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 05:07:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 05:07:45,042 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 05:07:45,042 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 05:07:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 05:07:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 05:07:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 05:07:45,043 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 05:07:45,043 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 05:07:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 05:07:45,044 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 05:07:45,044 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 05:07:45,046 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 05:07:45,232 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 05:07:45,235 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 05:07:45,617 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 05:07:45,851 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 05:07:45,852 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 05:07:45,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:45 BoogieIcfgContainer [2023-11-29 05:07:45,852 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 05:07:45,855 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 05:07:45,855 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 05:07:45,858 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 05:07:45,858 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 05:07:44" (1/3) ... [2023-11-29 05:07:45,859 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a0e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:07:45, skipping insertion in model container [2023-11-29 05:07:45,859 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 05:07:44" (2/3) ... [2023-11-29 05:07:45,860 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@66a0e744 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 05:07:45, skipping insertion in model container [2023-11-29 05:07:45,860 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:45" (3/3) ... [2023-11-29 05:07:45,861 INFO L112 eAbstractionObserver]: Analyzing ICFG mix017_pso.opt_tso.opt.i [2023-11-29 05:07:45,890 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 05:07:45,890 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 05:07:45,890 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 05:07:45,973 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 05:07:46,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:07:46,036 INFO L124 PetriNetUnfolderBase]: 2/62 cut-off events. [2023-11-29 05:07:46,036 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:07:46,041 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75 conditions, 62 events. 2/62 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 128 event pairs, 0 based on Foata normal form. 0/49 useless extension candidates. Maximal degree in co-relation 63. Up to 2 conditions per place. [2023-11-29 05:07:46,041 INFO L82 GeneralOperation]: Start removeDead. Operand has 77 places, 66 transitions, 148 flow [2023-11-29 05:07:46,045 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 73 places, 62 transitions, 136 flow [2023-11-29 05:07:46,055 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 05:07:46,061 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;@233c4ee3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 05:07:46,062 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 05:07:46,065 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 05:07:46,065 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 05:07:46,065 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 05:07:46,066 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:46,066 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:07:46,067 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-29 05:07:46,072 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:46,072 INFO L85 PathProgramCache]: Analyzing trace with hash 14626, now seen corresponding path program 1 times [2023-11-29 05:07:46,086 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:46,087 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [975312756] [2023-11-29 05:07:46,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:46,087 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-29 05:07:46,088 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:46,090 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:46,095 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:46,239 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:46,242 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:07:46,247 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:46,324 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-29 05:07:46,337 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 05:07:46,337 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:46,338 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:46,339 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [975312756] [2023-11-29 05:07:46,339 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [975312756] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:46,339 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:46,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:46,341 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [251536303] [2023-11-29 05:07:46,342 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:46,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:46,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:46,383 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:46,383 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:46,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:46,428 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 62 transitions, 136 flow. Second operand has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:46,428 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:46,428 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:46,430 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:47,031 INFO L124 PetriNetUnfolderBase]: 1419/2599 cut-off events. [2023-11-29 05:07:47,032 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-29 05:07:47,052 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4676 conditions, 2599 events. 1419/2599 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20187 event pairs, 1059 based on Foata normal form. 144/2582 useless extension candidates. Maximal degree in co-relation 4661. Up to 1529 conditions per place. [2023-11-29 05:07:47,077 INFO L140 encePairwiseOnDemand]: 61/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 05:07:47,077 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 67 transitions, 214 flow [2023-11-29 05:07:47,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:47,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:47,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:47,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:47,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:47,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:47,093 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:47,096 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:47,098 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:47,102 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:47,103 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:47,105 INFO L175 Difference]: Start difference. First operand has 73 places, 62 transitions, 136 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:47,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 67 transitions, 214 flow [2023-11-29 05:07:47,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 67 transitions, 210 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 05:07:47,114 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-29 05:07:47,116 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:47,120 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -4 predicate places. [2023-11-29 05:07:47,120 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-29 05:07:47,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.666666666666664) internal successors, (113), 3 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:47,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:47,121 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 05:07:47,125 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 05:07:47,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:47,322 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-29 05:07:47,322 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:47,322 INFO L85 PathProgramCache]: Analyzing trace with hash 14627, now seen corresponding path program 1 times [2023-11-29 05:07:47,323 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:47,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [866165323] [2023-11-29 05:07:47,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:47,324 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-29 05:07:47,324 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:47,326 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:47,327 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:47,420 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:47,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:07:47,423 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:47,435 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-29 05:07:47,445 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-29 05:07:47,446 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:47,446 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:47,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [866165323] [2023-11-29 05:07:47,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [866165323] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:47,447 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:47,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:47,448 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548834409] [2023-11-29 05:07:47,448 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:47,449 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:47,450 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:47,450 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:47,451 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:47,497 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:47,497 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:47,498 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:47,498 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:47,498 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:48,027 INFO L124 PetriNetUnfolderBase]: 1419/2598 cut-off events. [2023-11-29 05:07:48,027 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-29 05:07:48,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4744 conditions, 2598 events. 1419/2598 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20253 event pairs, 1059 based on Foata normal form. 1/2438 useless extension candidates. Maximal degree in co-relation 4733. Up to 1528 conditions per place. [2023-11-29 05:07:48,056 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 05:07:48,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 66 transitions, 210 flow [2023-11-29 05:07:48,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:48,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:48,058 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:48,059 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:48,059 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:48,059 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:48,060 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:48,060 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:48,062 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,063 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,064 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,064 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:48,064 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 66 transitions, 210 flow [2023-11-29 05:07:48,070 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 66 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:48,072 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 05:07:48,072 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:48,073 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -5 predicate places. [2023-11-29 05:07:48,073 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 05:07:48,074 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,074 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:48,074 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:07:48,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:48,274 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:48,275 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-29 05:07:48,276 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:48,276 INFO L85 PathProgramCache]: Analyzing trace with hash 436173703, now seen corresponding path program 1 times [2023-11-29 05:07:48,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:48,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [652906862] [2023-11-29 05:07:48,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:48,278 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-29 05:07:48,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:48,279 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:48,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:48,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:48,375 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:07:48,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:48,382 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-29 05:07:48,389 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-29 05:07:48,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:48,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:48,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [652906862] [2023-11-29 05:07:48,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [652906862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:48,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:48,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:48,391 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [723929035] [2023-11-29 05:07:48,391 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:48,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:48,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:48,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:48,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:48,425 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:48,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:48,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:48,426 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:48,912 INFO L124 PetriNetUnfolderBase]: 1420/2596 cut-off events. [2023-11-29 05:07:48,912 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-29 05:07:48,918 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4745 conditions, 2596 events. 1420/2596 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20131 event pairs, 1059 based on Foata normal form. 0/2439 useless extension candidates. Maximal degree in co-relation 4734. Up to 1528 conditions per place. [2023-11-29 05:07:48,940 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 05:07:48,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 65 transitions, 210 flow [2023-11-29 05:07:48,941 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:48,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:48,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:48,943 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:48,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:48,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:48,944 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:48,944 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:48,945 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,946 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,947 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,947 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:48,947 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 65 transitions, 210 flow [2023-11-29 05:07:48,952 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 65 transitions, 206 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:48,954 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 05:07:48,954 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:48,955 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:07:48,955 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 05:07:48,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:48,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:48,956 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 05:07:48,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:07:49,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:49,156 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-29 05:07:49,157 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:49,157 INFO L85 PathProgramCache]: Analyzing trace with hash 436173704, now seen corresponding path program 1 times [2023-11-29 05:07:49,158 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:49,158 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1814534110] [2023-11-29 05:07:49,158 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:49,158 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-29 05:07:49,158 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:49,159 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:49,160 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:49,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:49,230 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:07:49,231 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:49,240 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-29 05:07:49,250 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-29 05:07:49,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:49,250 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:49,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1814534110] [2023-11-29 05:07:49,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1814534110] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:49,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:49,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:49,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [661389181] [2023-11-29 05:07:49,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:49,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:49,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:49,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:49,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:49,293 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:49,293 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:49,293 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:49,293 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:49,294 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:49,791 INFO L124 PetriNetUnfolderBase]: 1419/2593 cut-off events. [2023-11-29 05:07:49,791 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 05:07:49,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4740 conditions, 2593 events. 1419/2593 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20215 event pairs, 1058 based on Foata normal form. 2/2439 useless extension candidates. Maximal degree in co-relation 4730. Up to 1525 conditions per place. [2023-11-29 05:07:49,822 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/64 dead transitions. [2023-11-29 05:07:49,822 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 64 transitions, 206 flow [2023-11-29 05:07:49,823 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:49,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:49,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:49,825 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:49,825 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:49,825 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:49,825 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:49,826 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:49,827 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:49,828 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:49,828 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:49,828 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:49,829 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 64 transitions, 206 flow [2023-11-29 05:07:49,833 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 64 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:49,835 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 05:07:49,835 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:49,836 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -7 predicate places. [2023-11-29 05:07:49,837 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 05:07:49,837 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.333333333333336) internal successors, (118), 3 states have internal predecessors, (118), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:49,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:49,837 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:49,840 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:07:50,038 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:50,038 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-29 05:07:50,039 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:50,039 INFO L85 PathProgramCache]: Analyzing trace with hash 1775170970, now seen corresponding path program 1 times [2023-11-29 05:07:50,039 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:50,040 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [382209843] [2023-11-29 05:07:50,040 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:50,040 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-29 05:07:50,040 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:50,041 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:50,042 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:50,139 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:50,141 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:07:50,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:50,148 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-29 05:07:50,154 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-29 05:07:50,154 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:50,155 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:50,155 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [382209843] [2023-11-29 05:07:50,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [382209843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:50,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:50,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:50,156 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2047229555] [2023-11-29 05:07:50,156 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:50,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:50,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:50,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:50,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:50,188 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:50,188 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,188 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:50,189 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:50,189 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:50,530 INFO L124 PetriNetUnfolderBase]: 1423/2591 cut-off events. [2023-11-29 05:07:50,530 INFO L125 PetriNetUnfolderBase]: For 73/73 co-relation queries the response was YES. [2023-11-29 05:07:50,535 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4746 conditions, 2591 events. 1423/2591 cut-off events. For 73/73 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 20395 event pairs, 1060 based on Foata normal form. 0/2446 useless extension candidates. Maximal degree in co-relation 4736. Up to 1524 conditions per place. [2023-11-29 05:07:50,546 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-29 05:07:50,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 63 transitions, 206 flow [2023-11-29 05:07:50,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:50,549 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:50,550 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:50,550 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:50,550 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:50,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:50,551 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:50,551 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:50,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,553 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,553 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:50,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 63 transitions, 206 flow [2023-11-29 05:07:50,557 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 63 transitions, 202 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:50,559 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 05:07:50,559 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:50,560 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -8 predicate places. [2023-11-29 05:07:50,560 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 05:07:50,561 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,561 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:50,561 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:50,563 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 05:07:50,763 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:50,763 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-29 05:07:50,764 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:50,764 INFO L85 PathProgramCache]: Analyzing trace with hash 1775170971, now seen corresponding path program 1 times [2023-11-29 05:07:50,764 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:50,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [328869667] [2023-11-29 05:07:50,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:50,765 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-29 05:07:50,765 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:50,766 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:50,767 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Waiting until timeout for monitored process [2023-11-29 05:07:50,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:50,914 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:07:50,915 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:50,924 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-29 05:07:50,933 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-29 05:07:50,933 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:50,934 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:50,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [328869667] [2023-11-29 05:07:50,934 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [328869667] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:50,934 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:50,934 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:50,935 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [81720778] [2023-11-29 05:07:50,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:50,935 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:50,935 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:50,936 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:50,936 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:50,982 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:50,983 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:50,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:50,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:50,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:51,299 INFO L124 PetriNetUnfolderBase]: 1419/2586 cut-off events. [2023-11-29 05:07:51,299 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-29 05:07:51,304 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4735 conditions, 2586 events. 1419/2586 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19804 event pairs, 743 based on Foata normal form. 4/2444 useless extension candidates. Maximal degree in co-relation 4725. Up to 1516 conditions per place. [2023-11-29 05:07:51,316 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-29 05:07:51,316 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 62 transitions, 202 flow [2023-11-29 05:07:51,317 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:51,317 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:51,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:51,318 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:51,318 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:51,318 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:51,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:51,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:51,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:51,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:51,321 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:51,321 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:51,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 62 transitions, 202 flow [2023-11-29 05:07:51,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 62 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:51,325 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-29 05:07:51,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:51,326 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -9 predicate places. [2023-11-29 05:07:51,326 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-29 05:07:51,327 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 40.0) internal successors, (120), 3 states have internal predecessors, (120), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:51,327 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:51,327 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:51,329 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (7)] Ended with exit code 0 [2023-11-29 05:07:51,528 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:51,528 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-29 05:07:51,529 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:51,529 INFO L85 PathProgramCache]: Analyzing trace with hash 186503816, now seen corresponding path program 1 times [2023-11-29 05:07:51,529 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:51,529 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [416189292] [2023-11-29 05:07:51,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:51,530 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-29 05:07:51,530 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:51,531 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:51,532 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Waiting until timeout for monitored process [2023-11-29 05:07:51,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:51,632 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:07:51,634 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:51,638 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-29 05:07:51,644 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-29 05:07:51,645 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:51,645 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:51,645 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [416189292] [2023-11-29 05:07:51,645 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [416189292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:51,645 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:51,646 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:51,646 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2078068255] [2023-11-29 05:07:51,646 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:51,646 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:51,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:51,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:51,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:51,671 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 66 [2023-11-29 05:07:51,672 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 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-29 05:07:51,672 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:51,672 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 66 [2023-11-29 05:07:51,672 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:51,998 INFO L124 PetriNetUnfolderBase]: 1439/2560 cut-off events. [2023-11-29 05:07:51,999 INFO L125 PetriNetUnfolderBase]: For 74/74 co-relation queries the response was YES. [2023-11-29 05:07:52,003 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4741 conditions, 2560 events. 1439/2560 cut-off events. For 74/74 co-relation queries the response was YES. Maximal size of possible extension queue 228. Compared 18878 event pairs, 937 based on Foata normal form. 0/2439 useless extension candidates. Maximal degree in co-relation 4731. Up to 1516 conditions per place. [2023-11-29 05:07:52,017 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 32 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 05:07:52,017 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 61 transitions, 202 flow [2023-11-29 05:07:52,017 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:52,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:52,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-29 05:07:52,018 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373737373737373 [2023-11-29 05:07:52,018 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-29 05:07:52,019 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-29 05:07:52,019 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:52,019 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-29 05:07:52,020 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,020 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,021 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,021 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-29 05:07:52,021 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 61 transitions, 202 flow [2023-11-29 05:07:52,023 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:52,024 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-29 05:07:52,024 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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-29 05:07:52,025 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:07:52,025 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-29 05:07:52,026 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-29 05:07:52,026 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:52,026 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:52,028 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (8)] Ended with exit code 0 [2023-11-29 05:07:52,228 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:52,229 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-29 05:07:52,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:52,229 INFO L85 PathProgramCache]: Analyzing trace with hash 186503817, now seen corresponding path program 1 times [2023-11-29 05:07:52,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:52,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [574938319] [2023-11-29 05:07:52,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:52,230 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-29 05:07:52,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:52,231 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:52,233 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (9)] Waiting until timeout for monitored process [2023-11-29 05:07:52,346 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:52,349 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:07:52,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:52,361 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-29 05:07:52,371 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-29 05:07:52,371 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:52,371 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:52,371 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [574938319] [2023-11-29 05:07:52,372 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [574938319] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:52,372 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:52,372 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 05:07:52,372 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [352021454] [2023-11-29 05:07:52,372 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:52,373 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:52,373 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:52,373 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:52,373 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:52,415 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:07:52,416 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 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-29 05:07:52,416 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:52,416 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:07:52,416 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:52,744 INFO L124 PetriNetUnfolderBase]: 1419/2562 cut-off events. [2023-11-29 05:07:52,744 INFO L125 PetriNetUnfolderBase]: For 80/80 co-relation queries the response was YES. [2023-11-29 05:07:52,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4719 conditions, 2562 events. 1419/2562 cut-off events. For 80/80 co-relation queries the response was YES. Maximal size of possible extension queue 229. Compared 19532 event pairs, 559 based on Foata normal form. 12/2459 useless extension candidates. Maximal degree in co-relation 4709. Up to 1484 conditions per place. [2023-11-29 05:07:52,758 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 31 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 05:07:52,758 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 60 transitions, 198 flow [2023-11-29 05:07:52,759 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:52,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:52,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 148 transitions. [2023-11-29 05:07:52,759 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7474747474747475 [2023-11-29 05:07:52,760 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 148 transitions. [2023-11-29 05:07:52,760 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 148 transitions. [2023-11-29 05:07:52,760 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:52,760 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 148 transitions. [2023-11-29 05:07:52,761 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.333333333333336) internal successors, (148), 3 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,762 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:52,762 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 148 transitions. [2023-11-29 05:07:52,762 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 60 transitions, 198 flow [2023-11-29 05:07:52,764 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 60 transitions, 194 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:52,765 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 05:07:52,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, 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=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-29 05:07:52,766 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -11 predicate places. [2023-11-29 05:07:52,766 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 05:07:52,767 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-29 05:07:52,767 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:52,767 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:07:52,770 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (9)] Ended with exit code 0 [2023-11-29 05:07:52,970 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:52,970 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-29 05:07:52,971 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:52,971 INFO L85 PathProgramCache]: Analyzing trace with hash -1552048034, now seen corresponding path program 1 times [2023-11-29 05:07:52,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:52,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2037494701] [2023-11-29 05:07:52,971 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:52,972 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-29 05:07:52,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:52,973 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:52,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Waiting until timeout for monitored process [2023-11-29 05:07:53,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:53,083 INFO L262 TraceCheckSpWp]: Trace formula consists of 144 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:07:53,084 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:53,108 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-29 05:07:53,108 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:53,108 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:53,109 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2037494701] [2023-11-29 05:07:53,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2037494701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:53,109 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:53,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 05:07:53,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1907651413] [2023-11-29 05:07:53,109 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:53,109 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 05:07:53,109 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:53,110 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 05:07:53,110 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 05:07:53,110 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 39 out of 66 [2023-11-29 05:07:53,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 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-29 05:07:53,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:53,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 39 of 66 [2023-11-29 05:07:53,110 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:53,339 INFO L124 PetriNetUnfolderBase]: 1175/2018 cut-off events. [2023-11-29 05:07:53,339 INFO L125 PetriNetUnfolderBase]: For 68/68 co-relation queries the response was YES. [2023-11-29 05:07:53,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 2018 events. 1175/2018 cut-off events. For 68/68 co-relation queries the response was YES. Maximal size of possible extension queue 180. Compared 14236 event pairs, 199 based on Foata normal form. 0/2001 useless extension candidates. Maximal degree in co-relation 3813. Up to 1361 conditions per place. [2023-11-29 05:07:53,348 INFO L140 encePairwiseOnDemand]: 63/66 looper letters, 30 selfloop transitions, 2 changer transitions 2/61 dead transitions. [2023-11-29 05:07:53,349 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 61 transitions, 204 flow [2023-11-29 05:07:53,349 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 05:07:53,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 05:07:53,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 152 transitions. [2023-11-29 05:07:53,350 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7676767676767676 [2023-11-29 05:07:53,350 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 152 transitions. [2023-11-29 05:07:53,350 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 152 transitions. [2023-11-29 05:07:53,351 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:53,351 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 152 transitions. [2023-11-29 05:07:53,352 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-29 05:07:53,352 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:53,353 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 66.0) internal successors, (264), 4 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:53,353 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 152 transitions. [2023-11-29 05:07:53,353 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 61 transitions, 204 flow [2023-11-29 05:07:53,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 61 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:53,355 INFO L231 Difference]: Finished difference. Result has 61 places, 49 transitions, 110 flow [2023-11-29 05:07:53,355 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=108, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=61, PETRI_TRANSITIONS=49} [2023-11-29 05:07:53,356 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -12 predicate places. [2023-11-29 05:07:53,356 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 49 transitions, 110 flow [2023-11-29 05:07:53,356 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-29 05:07:53,357 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:53,357 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-29 05:07:53,359 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (10)] Ended with exit code 0 [2023-11-29 05:07:53,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:53,557 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-29 05:07:53,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:53,558 INFO L85 PathProgramCache]: Analyzing trace with hash -1813671064, now seen corresponding path program 1 times [2023-11-29 05:07:53,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:53,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1189965631] [2023-11-29 05:07:53,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:53,559 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-29 05:07:53,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:53,560 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:53,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Waiting until timeout for monitored process [2023-11-29 05:07:53,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:53,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 05:07:53,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:53,730 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-29 05:07:53,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:53,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:53,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1189965631] [2023-11-29 05:07:53,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1189965631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:53,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:53,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 05:07:53,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1812784948] [2023-11-29 05:07:53,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:53,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 05:07:53,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:53,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 05:07:53,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 05:07:53,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:53,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 49 transitions, 110 flow. Second operand has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-29 05:07:53,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:53,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:53,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:54,478 INFO L124 PetriNetUnfolderBase]: 5233/8290 cut-off events. [2023-11-29 05:07:54,478 INFO L125 PetriNetUnfolderBase]: For 312/312 co-relation queries the response was YES. [2023-11-29 05:07:54,489 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15930 conditions, 8290 events. 5233/8290 cut-off events. For 312/312 co-relation queries the response was YES. Maximal size of possible extension queue 544. Compared 60024 event pairs, 603 based on Foata normal form. 216/8499 useless extension candidates. Maximal degree in co-relation 15919. Up to 4837 conditions per place. [2023-11-29 05:07:54,515 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 48 selfloop transitions, 6 changer transitions 1/77 dead transitions. [2023-11-29 05:07:54,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 286 flow [2023-11-29 05:07:54,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 05:07:54,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 05:07:54,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 193 transitions. [2023-11-29 05:07:54,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7310606060606061 [2023-11-29 05:07:54,517 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 193 transitions. [2023-11-29 05:07:54,517 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 193 transitions. [2023-11-29 05:07:54,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:54,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 193 transitions. [2023-11-29 05:07:54,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.25) internal successors, (193), 4 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-29 05:07:54,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:54,520 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 66.0) internal successors, (330), 5 states have internal predecessors, (330), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:54,520 INFO L175 Difference]: Start difference. First operand has 61 places, 49 transitions, 110 flow. Second operand 4 states and 193 transitions. [2023-11-29 05:07:54,520 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 286 flow [2023-11-29 05:07:54,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 77 transitions, 278 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:54,523 INFO L231 Difference]: Finished difference. Result has 63 places, 53 transitions, 148 flow [2023-11-29 05:07:54,523 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=148, PETRI_PLACES=63, PETRI_TRANSITIONS=53} [2023-11-29 05:07:54,524 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -10 predicate places. [2023-11-29 05:07:54,524 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 53 transitions, 148 flow [2023-11-29 05:07:54,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 37.5) internal successors, (150), 4 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-29 05:07:54,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:54,525 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-29 05:07:54,527 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (11)] Ended with exit code 0 [2023-11-29 05:07:54,725 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:54,725 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:07:54,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:54,726 INFO L85 PathProgramCache]: Analyzing trace with hash -1007948781, now seen corresponding path program 1 times [2023-11-29 05:07:54,726 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:54,726 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [989967665] [2023-11-29 05:07:54,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:54,727 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-29 05:07:54,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:54,728 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:54,730 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Waiting until timeout for monitored process [2023-11-29 05:07:54,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:54,837 INFO L262 TraceCheckSpWp]: Trace formula consists of 160 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 05:07:54,838 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:54,896 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-29 05:07:54,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:54,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:54,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [989967665] [2023-11-29 05:07:54,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [989967665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:54,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:54,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 05:07:54,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1019116610] [2023-11-29 05:07:54,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:54,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 05:07:54,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:54,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 05:07:54,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 05:07:54,912 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:54,913 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 53 transitions, 148 flow. Second operand has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:54,913 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:54,913 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:54,913 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:55,645 INFO L124 PetriNetUnfolderBase]: 4321/6884 cut-off events. [2023-11-29 05:07:55,645 INFO L125 PetriNetUnfolderBase]: For 1724/1724 co-relation queries the response was YES. [2023-11-29 05:07:55,658 INFO L83 FinitePrefix]: Finished finitePrefix Result has 15362 conditions, 6884 events. 4321/6884 cut-off events. For 1724/1724 co-relation queries the response was YES. Maximal size of possible extension queue 447. Compared 47905 event pairs, 213 based on Foata normal form. 208/7085 useless extension candidates. Maximal degree in co-relation 15349. Up to 3649 conditions per place. [2023-11-29 05:07:55,687 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 61 selfloop transitions, 10 changer transitions 1/94 dead transitions. [2023-11-29 05:07:55,688 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 94 transitions, 403 flow [2023-11-29 05:07:55,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 05:07:55,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 05:07:55,689 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2023-11-29 05:07:55,690 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7393939393939394 [2023-11-29 05:07:55,690 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 244 transitions. [2023-11-29 05:07:55,690 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 244 transitions. [2023-11-29 05:07:55,690 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:55,690 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 244 transitions. [2023-11-29 05:07:55,691 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 48.8) internal successors, (244), 5 states have internal predecessors, (244), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:55,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:55,693 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 66.0) internal successors, (396), 6 states have internal predecessors, (396), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:55,693 INFO L175 Difference]: Start difference. First operand has 63 places, 53 transitions, 148 flow. Second operand 5 states and 244 transitions. [2023-11-29 05:07:55,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 94 transitions, 403 flow [2023-11-29 05:07:55,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 94 transitions, 392 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 05:07:55,697 INFO L231 Difference]: Finished difference. Result has 67 places, 57 transitions, 200 flow [2023-11-29 05:07:55,697 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=139, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=200, PETRI_PLACES=67, PETRI_TRANSITIONS=57} [2023-11-29 05:07:55,698 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -6 predicate places. [2023-11-29 05:07:55,698 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 57 transitions, 200 flow [2023-11-29 05:07:55,698 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.0) internal successors, (185), 5 states have internal predecessors, (185), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:55,698 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:55,698 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-29 05:07:55,701 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (12)] Forceful destruction successful, exit code 0 [2023-11-29 05:07:55,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:55,899 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:07:55,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:55,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1283113394, now seen corresponding path program 1 times [2023-11-29 05:07:55,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:55,900 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1923527952] [2023-11-29 05:07:55,900 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:55,900 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-29 05:07:55,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:55,901 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:55,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Waiting until timeout for monitored process [2023-11-29 05:07:56,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:56,031 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 05:07:56,033 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:56,094 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-29 05:07:56,094 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:56,094 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:56,094 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1923527952] [2023-11-29 05:07:56,094 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1923527952] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:56,095 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:56,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:07:56,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [137378816] [2023-11-29 05:07:56,095 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:56,095 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:56,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:56,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:56,096 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:07:56,106 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:56,106 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 57 transitions, 200 flow. Second operand has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:56,106 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:56,106 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:56,107 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:56,684 INFO L124 PetriNetUnfolderBase]: 2739/4334 cut-off events. [2023-11-29 05:07:56,684 INFO L125 PetriNetUnfolderBase]: For 3214/3214 co-relation queries the response was YES. [2023-11-29 05:07:56,691 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10924 conditions, 4334 events. 2739/4334 cut-off events. For 3214/3214 co-relation queries the response was YES. Maximal size of possible extension queue 184. Compared 26059 event pairs, 81 based on Foata normal form. 164/4491 useless extension candidates. Maximal degree in co-relation 10909. Up to 1633 conditions per place. [2023-11-29 05:07:56,703 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 72 selfloop transitions, 14 changer transitions 1/109 dead transitions. [2023-11-29 05:07:56,703 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 109 transitions, 526 flow [2023-11-29 05:07:56,704 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:07:56,704 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:07:56,705 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 293 transitions. [2023-11-29 05:07:56,706 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.73989898989899 [2023-11-29 05:07:56,706 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 293 transitions. [2023-11-29 05:07:56,706 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 293 transitions. [2023-11-29 05:07:56,706 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:56,706 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 293 transitions. [2023-11-29 05:07:56,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 48.833333333333336) internal successors, (293), 6 states have internal predecessors, (293), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:56,709 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:56,709 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:56,709 INFO L175 Difference]: Start difference. First operand has 67 places, 57 transitions, 200 flow. Second operand 6 states and 293 transitions. [2023-11-29 05:07:56,709 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 109 transitions, 526 flow [2023-11-29 05:07:56,717 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 109 transitions, 496 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 05:07:56,718 INFO L231 Difference]: Finished difference. Result has 70 places, 61 transitions, 250 flow [2023-11-29 05:07:56,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=250, PETRI_PLACES=70, PETRI_TRANSITIONS=61} [2023-11-29 05:07:56,719 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 05:07:56,719 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 61 transitions, 250 flow [2023-11-29 05:07:56,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.666666666666664) internal successors, (220), 6 states have internal predecessors, (220), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:56,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:56,720 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-29 05:07:56,723 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (13)] Ended with exit code 0 [2023-11-29 05:07:56,920 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:56,920 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:07:56,920 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:56,920 INFO L85 PathProgramCache]: Analyzing trace with hash 263589223, now seen corresponding path program 1 times [2023-11-29 05:07:56,921 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:56,921 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [191219718] [2023-11-29 05:07:56,921 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:56,921 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-29 05:07:56,921 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:56,922 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:56,923 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Waiting until timeout for monitored process [2023-11-29 05:07:57,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:57,055 INFO L262 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:07:57,057 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:57,127 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-29 05:07:57,127 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:57,128 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:57,128 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [191219718] [2023-11-29 05:07:57,128 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [191219718] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:57,128 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:57,128 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:57,129 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1648876691] [2023-11-29 05:07:57,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:57,129 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:57,130 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:57,130 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:57,130 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 05:07:57,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 66 [2023-11-29 05:07:57,141 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 61 transitions, 250 flow. Second operand has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:57,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:57,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 66 [2023-11-29 05:07:57,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:57,663 INFO L124 PetriNetUnfolderBase]: 1591/2398 cut-off events. [2023-11-29 05:07:57,663 INFO L125 PetriNetUnfolderBase]: For 3480/3480 co-relation queries the response was YES. [2023-11-29 05:07:57,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6981 conditions, 2398 events. 1591/2398 cut-off events. For 3480/3480 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 11871 event pairs, 47 based on Foata normal form. 80/2471 useless extension candidates. Maximal degree in co-relation 6965. Up to 768 conditions per place. [2023-11-29 05:07:57,674 INFO L140 encePairwiseOnDemand]: 59/66 looper letters, 65 selfloop transitions, 18 changer transitions 1/106 dead transitions. [2023-11-29 05:07:57,674 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 106 transitions, 524 flow [2023-11-29 05:07:57,675 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:57,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:07:57,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 324 transitions. [2023-11-29 05:07:57,676 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7012987012987013 [2023-11-29 05:07:57,676 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 324 transitions. [2023-11-29 05:07:57,676 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 324 transitions. [2023-11-29 05:07:57,676 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:57,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 324 transitions. [2023-11-29 05:07:57,677 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-29 05:07:57,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:57,679 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:57,679 INFO L175 Difference]: Start difference. First operand has 70 places, 61 transitions, 250 flow. Second operand 7 states and 324 transitions. [2023-11-29 05:07:57,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 106 transitions, 524 flow [2023-11-29 05:07:57,695 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 106 transitions, 478 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 05:07:57,696 INFO L231 Difference]: Finished difference. Result has 73 places, 61 transitions, 260 flow [2023-11-29 05:07:57,696 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=207, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=260, PETRI_PLACES=73, PETRI_TRANSITIONS=61} [2023-11-29 05:07:57,697 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 0 predicate places. [2023-11-29 05:07:57,697 INFO L495 AbstractCegarLoop]: Abstraction has has 73 places, 61 transitions, 260 flow [2023-11-29 05:07:57,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.57142857142857) internal successors, (256), 7 states have internal predecessors, (256), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:57,697 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:57,697 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] [2023-11-29 05:07:57,700 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (14)] Ended with exit code 0 [2023-11-29 05:07:57,897 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:57,898 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P3Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 05:07:57,898 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:57,898 INFO L85 PathProgramCache]: Analyzing trace with hash -1633043175, now seen corresponding path program 1 times [2023-11-29 05:07:57,898 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:57,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2090880571] [2023-11-29 05:07:57,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:57,899 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-29 05:07:57,899 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:57,900 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:57,901 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Waiting until timeout for monitored process [2023-11-29 05:07:58,131 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:58,138 INFO L262 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:07:58,142 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:59,054 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t448~0#1.base_41| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t446~0#1.base_45| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t447~0#1.base_49| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t445~0#1.base_41| (_ BitVec 32))) (let ((.cse1 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t445~0#1.base_41| (_ bv1 1)))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#t446~0#1.base_45| (_ bv1 1)))) (and (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t445~0#1.base_41|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t447~0#1.base_49| (_ bv1 1)) |v_ULTIMATE.start_main_~#t448~0#1.base_41|)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t447~0#1.base_49|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t445~0#1.base_41| (_ bv0 1)) |v_ULTIMATE.start_main_~#t446~0#1.base_45| (_ bv0 1)) |v_ULTIMATE.start_main_~#t447~0#1.base_49| (_ bv0 1)) |v_ULTIMATE.start_main_~#t448~0#1.base_41| (_ bv0 1))) (= (select .cse1 |v_ULTIMATE.start_main_~#t446~0#1.base_45|) (_ bv0 1)))))) is different from true [2023-11-29 05:07:59,055 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-29 05:07:59,056 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:59,056 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:59,056 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2090880571] [2023-11-29 05:07:59,056 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2090880571] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:59,057 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:59,057 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 05:07:59,057 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [154588610] [2023-11-29 05:07:59,057 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:59,058 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 05:07:59,058 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:59,058 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 05:07:59,059 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 05:07:59,141 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 66 [2023-11-29 05:07:59,142 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 73 places, 61 transitions, 260 flow. Second operand has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:59,142 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:07:59,142 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 66 [2023-11-29 05:07:59,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:07:59,561 INFO L124 PetriNetUnfolderBase]: 781/1436 cut-off events. [2023-11-29 05:07:59,561 INFO L125 PetriNetUnfolderBase]: For 728/776 co-relation queries the response was YES. [2023-11-29 05:07:59,564 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3272 conditions, 1436 events. 781/1436 cut-off events. For 728/776 co-relation queries the response was YES. Maximal size of possible extension queue 110. Compared 8326 event pairs, 150 based on Foata normal form. 16/1353 useless extension candidates. Maximal degree in co-relation 3254. Up to 931 conditions per place. [2023-11-29 05:07:59,569 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 33 selfloop transitions, 9 changer transitions 0/76 dead transitions. [2023-11-29 05:07:59,569 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 76 transitions, 374 flow [2023-11-29 05:07:59,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 05:07:59,569 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 05:07:59,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 225 transitions. [2023-11-29 05:07:59,570 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.487012987012987 [2023-11-29 05:07:59,570 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 225 transitions. [2023-11-29 05:07:59,571 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 225 transitions. [2023-11-29 05:07:59,571 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:07:59,571 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 225 transitions. [2023-11-29 05:07:59,571 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.142857142857146) internal successors, (225), 7 states have internal predecessors, (225), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:59,573 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:59,573 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 66.0) internal successors, (528), 8 states have internal predecessors, (528), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:59,573 INFO L175 Difference]: Start difference. First operand has 73 places, 61 transitions, 260 flow. Second operand 7 states and 225 transitions. [2023-11-29 05:07:59,573 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 76 transitions, 374 flow [2023-11-29 05:07:59,576 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 76 transitions, 278 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 05:07:59,578 INFO L231 Difference]: Finished difference. Result has 70 places, 65 transitions, 205 flow [2023-11-29 05:07:59,578 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=164, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=205, PETRI_PLACES=70, PETRI_TRANSITIONS=65} [2023-11-29 05:07:59,578 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, -3 predicate places. [2023-11-29 05:07:59,578 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 65 transitions, 205 flow [2023-11-29 05:07:59,579 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 29.142857142857142) internal successors, (204), 7 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:07:59,579 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:07:59,579 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] [2023-11-29 05:07:59,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (15)] Forceful destruction successful, exit code 0 [2023-11-29 05:07:59,779 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:59,779 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-29 05:07:59,780 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:07:59,780 INFO L85 PathProgramCache]: Analyzing trace with hash 887557383, now seen corresponding path program 1 times [2023-11-29 05:07:59,780 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:07:59,780 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1032541423] [2023-11-29 05:07:59,780 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 05:07:59,781 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-29 05:07:59,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:07:59,782 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:07:59,783 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Waiting until timeout for monitored process [2023-11-29 05:07:59,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 05:07:59,916 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:07:59,918 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:07:59,987 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-29 05:07:59,987 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:07:59,988 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:07:59,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1032541423] [2023-11-29 05:07:59,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1032541423] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:07:59,988 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:07:59,988 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:07:59,988 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1794063896] [2023-11-29 05:07:59,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:07:59,989 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:07:59,989 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:07:59,989 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:07:59,990 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:08:00,002 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:08:00,003 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 65 transitions, 205 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:00,003 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:08:00,003 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:08:00,003 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:08:00,571 INFO L124 PetriNetUnfolderBase]: 2239/3949 cut-off events. [2023-11-29 05:08:00,571 INFO L125 PetriNetUnfolderBase]: For 1161/1511 co-relation queries the response was YES. [2023-11-29 05:08:00,579 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 3949 events. 2239/3949 cut-off events. For 1161/1511 co-relation queries the response was YES. Maximal size of possible extension queue 218. Compared 25453 event pairs, 689 based on Foata normal form. 16/3736 useless extension candidates. Maximal degree in co-relation 9340. Up to 1527 conditions per place. [2023-11-29 05:08:00,591 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 67 selfloop transitions, 5 changer transitions 0/108 dead transitions. [2023-11-29 05:08:00,591 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 108 transitions, 496 flow [2023-11-29 05:08:00,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:08:00,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:08:00,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2023-11-29 05:08:00,593 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7095959595959596 [2023-11-29 05:08:00,593 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 281 transitions. [2023-11-29 05:08:00,593 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 281 transitions. [2023-11-29 05:08:00,593 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:08:00,593 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 281 transitions. [2023-11-29 05:08:00,594 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.833333333333336) internal successors, (281), 6 states have internal predecessors, (281), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:00,595 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:00,595 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:00,595 INFO L175 Difference]: Start difference. First operand has 70 places, 65 transitions, 205 flow. Second operand 6 states and 281 transitions. [2023-11-29 05:08:00,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 108 transitions, 496 flow [2023-11-29 05:08:00,597 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 108 transitions, 470 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 05:08:00,598 INFO L231 Difference]: Finished difference. Result has 74 places, 69 transitions, 231 flow [2023-11-29 05:08:00,599 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=231, PETRI_PLACES=74, PETRI_TRANSITIONS=69} [2023-11-29 05:08:00,599 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 1 predicate places. [2023-11-29 05:08:00,599 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 69 transitions, 231 flow [2023-11-29 05:08:00,599 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:00,599 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:08:00,599 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] [2023-11-29 05:08:00,603 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (16)] Ended with exit code 0 [2023-11-29 05:08:00,800 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:00,800 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-29 05:08:00,800 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:00,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1017864921, now seen corresponding path program 2 times [2023-11-29 05:08:00,801 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:08:00,801 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [81785366] [2023-11-29 05:08:00,801 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 05:08:00,801 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-29 05:08:00,801 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:08:00,802 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:00,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Waiting until timeout for monitored process [2023-11-29 05:08:00,931 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:08:00,931 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:08:00,936 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:08:00,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:08:01,018 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-29 05:08:01,018 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:08:01,019 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:08:01,019 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [81785366] [2023-11-29 05:08:01,019 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [81785366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:08:01,019 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:08:01,019 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:08:01,019 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347411380] [2023-11-29 05:08:01,020 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:08:01,020 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:08:01,020 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:08:01,021 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:08:01,021 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:08:01,028 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:08:01,028 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 69 transitions, 231 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:01,028 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:08:01,028 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:08:01,028 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:08:01,677 INFO L124 PetriNetUnfolderBase]: 3024/5304 cut-off events. [2023-11-29 05:08:01,677 INFO L125 PetriNetUnfolderBase]: For 1962/2242 co-relation queries the response was YES. [2023-11-29 05:08:01,689 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13129 conditions, 5304 events. 3024/5304 cut-off events. For 1962/2242 co-relation queries the response was YES. Maximal size of possible extension queue 311. Compared 35595 event pairs, 988 based on Foata normal form. 16/4960 useless extension candidates. Maximal degree in co-relation 13113. Up to 2407 conditions per place. [2023-11-29 05:08:01,705 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 66 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-11-29 05:08:01,705 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 111 transitions, 529 flow [2023-11-29 05:08:01,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:08:01,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:08:01,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 277 transitions. [2023-11-29 05:08:01,707 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6994949494949495 [2023-11-29 05:08:01,707 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 277 transitions. [2023-11-29 05:08:01,707 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 277 transitions. [2023-11-29 05:08:01,707 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:08:01,707 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 277 transitions. [2023-11-29 05:08:01,708 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.166666666666664) internal successors, (277), 6 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:01,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:01,710 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:01,710 INFO L175 Difference]: Start difference. First operand has 74 places, 69 transitions, 231 flow. Second operand 6 states and 277 transitions. [2023-11-29 05:08:01,710 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 111 transitions, 529 flow [2023-11-29 05:08:01,716 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 528 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:08:01,718 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 313 flow [2023-11-29 05:08:01,718 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=230, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=61, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=313, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-29 05:08:01,718 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 9 predicate places. [2023-11-29 05:08:01,718 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 313 flow [2023-11-29 05:08:01,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:01,719 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:08:01,719 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] [2023-11-29 05:08:01,721 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (17)] Ended with exit code 0 [2023-11-29 05:08:01,919 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:01,919 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-29 05:08:01,919 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:01,919 INFO L85 PathProgramCache]: Analyzing trace with hash 2035544709, now seen corresponding path program 3 times [2023-11-29 05:08:01,920 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:08:01,920 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1548624008] [2023-11-29 05:08:01,920 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 05:08:01,920 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-29 05:08:01,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:08:01,921 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:01,924 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Waiting until timeout for monitored process [2023-11-29 05:08:02,073 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 05:08:02,073 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:08:02,080 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 05:08:02,082 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:08:02,151 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-29 05:08:02,151 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:08:02,151 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:08:02,152 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1548624008] [2023-11-29 05:08:02,152 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1548624008] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:08:02,152 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:08:02,152 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 05:08:02,152 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630330455] [2023-11-29 05:08:02,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:08:02,153 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 05:08:02,153 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:08:02,153 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 05:08:02,154 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 05:08:02,166 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 66 [2023-11-29 05:08:02,166 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 313 flow. Second operand has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:02,167 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:08:02,167 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 66 [2023-11-29 05:08:02,167 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:08:03,357 INFO L124 PetriNetUnfolderBase]: 6749/11558 cut-off events. [2023-11-29 05:08:03,357 INFO L125 PetriNetUnfolderBase]: For 5270/5866 co-relation queries the response was YES. [2023-11-29 05:08:03,388 INFO L83 FinitePrefix]: Finished finitePrefix Result has 28806 conditions, 11558 events. 6749/11558 cut-off events. For 5270/5866 co-relation queries the response was YES. Maximal size of possible extension queue 693. Compared 88414 event pairs, 1212 based on Foata normal form. 16/10739 useless extension candidates. Maximal degree in co-relation 28786. Up to 5041 conditions per place. [2023-11-29 05:08:03,425 INFO L140 encePairwiseOnDemand]: 60/66 looper letters, 71 selfloop transitions, 14 changer transitions 0/123 dead transitions. [2023-11-29 05:08:03,425 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 123 transitions, 699 flow [2023-11-29 05:08:03,426 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 05:08:03,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 05:08:03,427 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-29 05:08:03,427 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.696969696969697 [2023-11-29 05:08:03,427 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-29 05:08:03,427 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-29 05:08:03,428 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:08:03,428 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-29 05:08:03,429 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:03,430 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:03,431 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 66.0) internal successors, (462), 7 states have internal predecessors, (462), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:03,431 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 313 flow. Second operand 6 states and 276 transitions. [2023-11-29 05:08:03,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 123 transitions, 699 flow [2023-11-29 05:08:03,449 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 123 transitions, 698 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:08:03,452 INFO L231 Difference]: Finished difference. Result has 90 places, 89 transitions, 501 flow [2023-11-29 05:08:03,452 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=312, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=76, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=62, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=501, PETRI_PLACES=90, PETRI_TRANSITIONS=89} [2023-11-29 05:08:03,452 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 17 predicate places. [2023-11-29 05:08:03,453 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 89 transitions, 501 flow [2023-11-29 05:08:03,453 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 39.333333333333336) internal successors, (236), 6 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:03,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:08:03,453 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] [2023-11-29 05:08:03,456 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (18)] Ended with exit code 0 [2023-11-29 05:08:03,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:03,654 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-29 05:08:03,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:03,654 INFO L85 PathProgramCache]: Analyzing trace with hash 659544967, now seen corresponding path program 4 times [2023-11-29 05:08:03,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:08:03,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [567421779] [2023-11-29 05:08:03,654 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 05:08:03,654 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-29 05:08:03,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:08:03,655 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:03,656 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (19)] Waiting until timeout for monitored process [2023-11-29 05:08:03,783 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 05:08:03,783 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 05:08:03,789 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 05:08:03,791 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 05:08:04,696 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-29 05:08:04,696 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 05:08:04,696 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 05:08:04,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [567421779] [2023-11-29 05:08:04,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [567421779] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 05:08:04,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 05:08:04,697 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 05:08:04,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [64802262] [2023-11-29 05:08:04,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 05:08:04,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 05:08:04,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 05:08:04,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 05:08:04,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 05:08:04,719 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 66 [2023-11-29 05:08:04,720 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 89 transitions, 501 flow. Second operand has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:04,720 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 05:08:04,720 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 66 [2023-11-29 05:08:04,721 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 05:08:06,335 INFO L124 PetriNetUnfolderBase]: 7896/13838 cut-off events. [2023-11-29 05:08:06,336 INFO L125 PetriNetUnfolderBase]: For 12587/12917 co-relation queries the response was YES. [2023-11-29 05:08:06,376 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38043 conditions, 13838 events. 7896/13838 cut-off events. For 12587/12917 co-relation queries the response was YES. Maximal size of possible extension queue 784. Compared 109860 event pairs, 818 based on Foata normal form. 16/12913 useless extension candidates. Maximal degree in co-relation 38019. Up to 7317 conditions per place. [2023-11-29 05:08:06,422 INFO L140 encePairwiseOnDemand]: 56/66 looper letters, 83 selfloop transitions, 31 changer transitions 0/155 dead transitions. [2023-11-29 05:08:06,422 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 155 transitions, 1159 flow [2023-11-29 05:08:06,423 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 05:08:06,423 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 05:08:06,424 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2023-11-29 05:08:06,425 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6742424242424242 [2023-11-29 05:08:06,425 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 445 transitions. [2023-11-29 05:08:06,425 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 445 transitions. [2023-11-29 05:08:06,426 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 05:08:06,426 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 445 transitions. [2023-11-29 05:08:06,427 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.5) internal successors, (445), 10 states have internal predecessors, (445), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:06,429 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:06,429 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 66.0) internal successors, (726), 11 states have internal predecessors, (726), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:06,430 INFO L175 Difference]: Start difference. First operand has 90 places, 89 transitions, 501 flow. Second operand 10 states and 445 transitions. [2023-11-29 05:08:06,430 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 155 transitions, 1159 flow [2023-11-29 05:08:06,548 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 155 transitions, 1158 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 05:08:06,551 INFO L231 Difference]: Finished difference. Result has 102 places, 115 transitions, 950 flow [2023-11-29 05:08:06,551 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=66, PETRI_DIFFERENCE_MINUEND_FLOW=500, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=950, PETRI_PLACES=102, PETRI_TRANSITIONS=115} [2023-11-29 05:08:06,551 INFO L281 CegarLoopForPetriNet]: 73 programPoint places, 29 predicate places. [2023-11-29 05:08:06,551 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 115 transitions, 950 flow [2023-11-29 05:08:06,551 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 40.0) internal successors, (360), 9 states have internal predecessors, (360), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 05:08:06,551 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 05:08:06,552 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] [2023-11-29 05:08:06,555 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (19)] Ended with exit code 0 [2023-11-29 05:08:06,752 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:06,752 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-29 05:08:06,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 05:08:06,752 INFO L85 PathProgramCache]: Analyzing trace with hash 131097977, now seen corresponding path program 5 times [2023-11-29 05:08:06,753 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 05:08:06,753 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863144619] [2023-11-29 05:08:06,753 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 05:08:06,753 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-29 05:08:06,753 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 05:08:06,754 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:06,755 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (20)] Waiting until timeout for monitored process [2023-11-29 05:08:06,887 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 05:08:06,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 05:08:06,887 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 05:08:06,978 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 05:08:07,051 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 05:08:07,052 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 05:08:07,053 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 05:08:07,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 05:08:07,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 05:08:07,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 05:08:07,055 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 05:08:07,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 05:08:07,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 05:08:07,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 05:08:07,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 05:08:07,056 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 05:08:07,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 05:08:07,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 05:08:07,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 05:08:07,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 05:08:07,057 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 05:08:07,058 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P3Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 05:08:07,063 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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 (20)] Ended with exit code 0 [2023-11-29 05:08:07,263 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/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-29 05:08:07,264 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 05:08:07,269 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 05:08:07,269 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 05:08:07,332 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 05:08:07,335 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 05:08:07,336 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 05:08:07,337 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre13 could not be translated [2023-11-29 05:08:07,354 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:08:07,355 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 05:08:07,369 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 05:08:07 BasicIcfg [2023-11-29 05:08:07,369 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 05:08:07,370 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 05:08:07,370 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 05:08:07,370 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 05:08:07,370 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 05:07:45" (3/4) ... [2023-11-29 05:08:07,372 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 05:08:07,373 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 05:08:07,374 INFO L158 Benchmark]: Toolchain (without parser) took 23138.78ms. Allocated memory was 69.2MB in the beginning and 574.6MB in the end (delta: 505.4MB). Free memory was 37.0MB in the beginning and 195.4MB in the end (delta: -158.4MB). Peak memory consumption was 347.3MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,374 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 05:08:07,374 INFO L158 Benchmark]: CACSL2BoogieTranslator took 603.96ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 42.8MB in the end (delta: -6.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,375 INFO L158 Benchmark]: Boogie Procedure Inliner took 54.87ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 39.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,375 INFO L158 Benchmark]: Boogie Preprocessor took 66.49ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 35.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,375 INFO L158 Benchmark]: RCFGBuilder took 888.00ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 36.2kB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,376 INFO L158 Benchmark]: TraceAbstraction took 21514.49ms. Allocated memory was 83.9MB in the beginning and 574.6MB in the end (delta: 490.7MB). Free memory was 35.3MB in the beginning and 196.4MB in the end (delta: -161.1MB). Peak memory consumption was 329.0MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,376 INFO L158 Benchmark]: Witness Printer took 3.56ms. Allocated memory is still 574.6MB. Free memory was 196.4MB in the beginning and 195.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 05:08:07,378 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.24ms. Allocated memory is still 52.4MB. Free memory is still 29.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 603.96ms. Allocated memory is still 69.2MB. Free memory was 36.8MB in the beginning and 42.8MB in the end (delta: -6.0MB). Peak memory consumption was 10.6MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 54.87ms. Allocated memory is still 69.2MB. Free memory was 42.8MB in the beginning and 39.8MB in the end (delta: 3.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 66.49ms. Allocated memory is still 69.2MB. Free memory was 39.8MB in the beginning and 35.8MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 888.00ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 36.2kB). Peak memory consumption was 20.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21514.49ms. Allocated memory was 83.9MB in the beginning and 574.6MB in the end (delta: 490.7MB). Free memory was 35.3MB in the beginning and 196.4MB in the end (delta: -161.1MB). Peak memory consumption was 329.0MB. Max. memory is 16.1GB. * Witness Printer took 3.56ms. Allocated memory is still 574.6MB. Free memory was 196.4MB in the beginning and 195.4MB in the end (delta: 1.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - 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: IdentifierExpression #t~pre13 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_p0_EAX = 0; [L714] 0 int __unbuffered_p1_EAX = 0; [L716] 0 int __unbuffered_p2_EAX = 0; [L718] 0 int __unbuffered_p3_EAX = 0; [L720] 0 int __unbuffered_p3_EBX = 0; [L722] 0 int a = 0; [L723] 0 _Bool main$tmp_guard0; [L724] 0 _Bool main$tmp_guard1; [L726] 0 int x = 0; [L728] 0 int y = 0; [L730] 0 int z = 0; [L731] 0 _Bool z$flush_delayed; [L732] 0 int z$mem_tmp; [L733] 0 _Bool z$r_buff0_thd0; [L734] 0 _Bool z$r_buff0_thd1; [L735] 0 _Bool z$r_buff0_thd2; [L736] 0 _Bool z$r_buff0_thd3; [L737] 0 _Bool z$r_buff0_thd4; [L738] 0 _Bool z$r_buff1_thd0; [L739] 0 _Bool z$r_buff1_thd1; [L740] 0 _Bool z$r_buff1_thd2; [L741] 0 _Bool z$r_buff1_thd3; [L742] 0 _Bool z$r_buff1_thd4; [L743] 0 _Bool z$read_delayed; [L744] 0 int *z$read_delayed_var; [L745] 0 int z$w_buff0; [L746] 0 _Bool z$w_buff0_used; [L747] 0 int z$w_buff1; [L748] 0 _Bool z$w_buff1_used; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L866] 0 pthread_t t445; [L867] FCALL, FORK 0 pthread_create(&t445, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={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] [L868] 0 pthread_t t446; [L869] FCALL, FORK 0 pthread_create(&t446, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={7:0}, t446={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] [L870] 0 pthread_t t447; [L871] FCALL, FORK 0 pthread_create(&t447, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t445={7:0}, t446={6:0}, t447={-2147483645: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] [L872] 0 pthread_t t448; [L873] FCALL, FORK 0 pthread_create(&t448, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, t445={7:0}, t446={6:0}, t447={-2147483645:0}, t448={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] [L812] 4 z$w_buff1 = z$w_buff0 [L813] 4 z$w_buff0 = 1 [L814] 4 z$w_buff1_used = z$w_buff0_used [L815] 4 z$w_buff0_used = (_Bool)1 [L816] CALL 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L18] COND FALSE 4 !(!expression) [L816] RET 4 __VERIFIER_assert(!(z$w_buff1_used && z$w_buff0_used)) [L817] 4 z$r_buff1_thd0 = z$r_buff0_thd0 [L818] 4 z$r_buff1_thd1 = z$r_buff0_thd1 [L819] 4 z$r_buff1_thd2 = z$r_buff0_thd2 [L820] 4 z$r_buff1_thd3 = z$r_buff0_thd3 [L821] 4 z$r_buff1_thd4 = z$r_buff0_thd4 [L822] 4 z$r_buff0_thd4 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, arg={0:0}, arg={0: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] [L825] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L826] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L827] 4 z$flush_delayed = weak$$choice2 [L828] 4 z$mem_tmp = z [L829] 4 z = !z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff1) [L830] 4 z$w_buff0 = weak$$choice2 ? z$w_buff0 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff0 : z$w_buff0)) [L831] 4 z$w_buff1 = weak$$choice2 ? z$w_buff1 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1 : (z$w_buff0_used && z$r_buff0_thd4 ? z$w_buff1 : z$w_buff1)) [L832] 4 z$w_buff0_used = weak$$choice2 ? z$w_buff0_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff0_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used)) [L833] 4 z$w_buff1_used = weak$$choice2 ? z$w_buff1_used : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$w_buff1_used : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L834] 4 z$r_buff0_thd4 = weak$$choice2 ? z$r_buff0_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff0_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4)) [L835] 4 z$r_buff1_thd4 = weak$$choice2 ? z$r_buff1_thd4 : (!z$w_buff0_used || !z$r_buff0_thd4 && !z$w_buff1_used || !z$r_buff0_thd4 && !z$r_buff1_thd4 ? z$r_buff1_thd4 : (z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L836] 4 __unbuffered_p3_EAX = z [L837] 4 z = z$flush_delayed ? z$mem_tmp : z [L838] 4 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L841] 4 __unbuffered_p3_EBX = a VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L754] 1 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L757] 1 __unbuffered_p0_EAX = x VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L769] 2 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L772] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, 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] [L784] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=2, x=1, 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] [L787] 3 weak$$choice0 = __VERIFIER_nondet_bool() [L788] 3 weak$$choice2 = __VERIFIER_nondet_bool() [L789] 3 z$flush_delayed = weak$$choice2 [L790] 3 z$mem_tmp = z [L791] 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) [L792] 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)) [L793] 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)) [L794] 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)) [L795] 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)) [L796] 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)) [L797] 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)) [L798] 3 __unbuffered_p2_EAX = z [L799] 3 z = z$flush_delayed ? z$mem_tmp : z [L800] 3 z$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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] [L844] 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) [L845] 4 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$w_buff0_used [L846] 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 [L847] 4 z$r_buff0_thd4 = z$w_buff0_used && z$r_buff0_thd4 ? (_Bool)0 : z$r_buff0_thd4 [L848] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L762] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L777] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L805] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L851] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L875] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={7:0}, t446={6:0}, t447={-2147483645:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L877] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L877] RET 0 assume_abort_if_not(main$tmp_guard0) [L879] 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) [L880] 0 z$w_buff0_used = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$w_buff0_used [L881] 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 [L882] 0 z$r_buff0_thd0 = z$w_buff0_used && z$r_buff0_thd0 ? (_Bool)0 : z$r_buff0_thd0 [L883] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={7:0}, t446={6:0}, t447={-2147483645:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L886] 0 main$tmp_guard1 = !(__unbuffered_p0_EAX == 0 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, t445={7:0}, t446={6:0}, t447={-2147483645:0}, t448={3:0}, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L888] 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_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=0, z$w_buff1=0, z$w_buff1_used=0, z=1] [L17] 0 __assert_fail ("0", "mix017_pso.opt_tso.opt.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p0_EAX=0, __unbuffered_p1_EAX=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}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=1, 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=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: 864]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 871]: 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: 873]: 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: 869]: 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: 867]: 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, 99 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: 21.3s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 12.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 867 SdHoareTripleChecker+Valid, 3.0s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 726 mSDsluCounter, 111 SdHoareTripleChecker+Invalid, 2.6s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 69 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 50 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2356 IncrementalHoareTripleChecker+Invalid, 2475 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 50 mSolverCounterUnsat, 31 mSDtfsCounter, 2356 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 395 GetRequests, 325 SyntacticMatches, 0 SemanticMatches, 70 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=950occurred in iteration=18, InterpolantAutomatonStates: 84, 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.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.6s InterpolantComputationTime, 432 NumberOfCodeBlocks, 432 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 372 ConstructedInterpolants, 1 QuantifiedInterpolants, 2991 SizeOfPredicates, 21 NumberOfNonLiveVariables, 2558 ConjunctsInSsa, 105 ConjunctsInUnsatCore, 18 InterpolantComputations, 18 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-29 05:08:07,402 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_68c3b088-36a5-45bd-b12a-2090f2d676ff/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample