./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:47:23,234 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:47:23,307 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:47:23,311 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:47:23,312 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:47:23,336 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:47:23,337 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:47:23,337 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:47:23,338 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:47:23,338 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:47:23,339 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:47:23,339 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:47:23,340 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:47:23,341 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:47:23,341 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:47:23,342 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:47:23,342 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:47:23,343 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:47:23,343 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:47:23,344 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:47:23,344 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:47:23,345 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:47:23,346 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:47:23,346 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:47:23,346 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:47:23,347 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:47:23,347 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:47:23,348 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:47:23,348 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:47:23,349 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:47:23,349 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:47:23,350 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:47:23,350 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:47:23,351 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:47:23,351 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:47:23,351 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:47:23,352 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:47:23,352 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:47:23,352 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:47:23,353 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:47:23,353 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:47:23,354 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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2023-11-29 02:47:23,589 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:47:23,612 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:47:23,615 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:47:23,616 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:47:23,617 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:47:23,618 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:47:26,508 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:47:26,747 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:47:26,747 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:47:26,765 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/037334b8d/08629cc8be90441dbea5617e255e1033/FLAG71019f358 [2023-11-29 02:47:26,779 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/037334b8d/08629cc8be90441dbea5617e255e1033 [2023-11-29 02:47:26,782 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:47:26,784 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:47:26,785 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:47:26,786 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:47:26,792 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:47:26,793 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:47:26" (1/1) ... [2023-11-29 02:47:26,794 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@620203b2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:26, skipping insertion in model container [2023-11-29 02:47:26,795 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:47:26" (1/1) ... [2023-11-29 02:47:26,857 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:47:27,308 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:47:27,323 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:47:27,395 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:47:27,437 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:47:27,438 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:47:27,448 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:47:27,448 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27 WrapperNode [2023-11-29 02:47:27,449 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:47:27,450 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:47:27,450 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:47:27,450 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:47:27,460 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,482 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,518 INFO L138 Inliner]: procedures = 177, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 148 [2023-11-29 02:47:27,519 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:47:27,520 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:47:27,520 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:47:27,520 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:47:27,535 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,536 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,541 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,563 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 02:47:27,564 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,564 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,579 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,582 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,586 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,589 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,595 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:47:27,596 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:47:27,596 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:47:27,596 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:47:27,597 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (1/1) ... [2023-11-29 02:47:27,604 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:47:27,618 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:47:27,637 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:47:27,640 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:47:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-29 02:47:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-29 02:47:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-29 02:47:27,685 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-29 02:47:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-29 02:47:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:47:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:47:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:47:27,686 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:47:27,687 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:47:27,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:47:27,687 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:47:27,687 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:47:27,687 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:47:27,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:47:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:47:27,688 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:47:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:47:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:47:27,688 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:47:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-29 02:47:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-29 02:47:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:47:27,689 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:47:27,689 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:47:27,692 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 02:47:27,894 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:47:27,897 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:47:28,317 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:47:28,594 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:47:28,595 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:47:28,595 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:47:28 BoogieIcfgContainer [2023-11-29 02:47:28,596 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:47:28,599 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:47:28,599 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:47:28,603 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:47:28,603 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:47:26" (1/3) ... [2023-11-29 02:47:28,604 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9c7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:47:28, skipping insertion in model container [2023-11-29 02:47:28,604 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:47:27" (2/3) ... [2023-11-29 02:47:28,605 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d9c7314 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:47:28, skipping insertion in model container [2023-11-29 02:47:28,605 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:47:28" (3/3) ... [2023-11-29 02:47:28,606 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:47:28,631 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:47:28,631 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:47:28,631 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:47:28,709 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:47:28,754 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 02:47:28,800 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-29 02:47:28,800 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:47:28,806 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-29 02:47:28,806 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 02:47:28,811 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-29 02:47:28,824 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:47:28,832 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;@197b5f33, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:47:28,832 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:47:28,837 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:47:28,837 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:47:28,837 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:47:28,837 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:28,838 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:47:28,838 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:28,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:28,845 INFO L85 PathProgramCache]: Analyzing trace with hash 13702, now seen corresponding path program 1 times [2023-11-29 02:47:28,857 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:28,858 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [645130292] [2023-11-29 02:47:28,858 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:28,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:28,999 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:29,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:47:29,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:29,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [645130292] [2023-11-29 02:47:29,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [645130292] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:29,155 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:29,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:47:29,157 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1658601240] [2023-11-29 02:47:29,158 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:29,168 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:29,175 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:29,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:29,199 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:29,232 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:47:29,236 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 02:47:29,236 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:29,236 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:47:29,237 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:31,045 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 02:47:31,045 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:47:31,079 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55188 event pairs, 3179 based on Foata normal form. 360/7046 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 02:47:31,146 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:47:31,146 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-29 02:47:31,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:31,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:31,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:47:31,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:47:31,164 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:47:31,164 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:47:31,166 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:31,169 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:47:31,172 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:47:31,177 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:31,177 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:31,180 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:47:31,181 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-29 02:47:31,188 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:47:31,192 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:47:31,195 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:47:31,199 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-29 02:47:31,200 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:47:31,200 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 02:47:31,200 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:31,200 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:47:31,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:47:31,201 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:31,202 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:31,202 INFO L85 PathProgramCache]: Analyzing trace with hash 13703, now seen corresponding path program 1 times [2023-11-29 02:47:31,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:31,203 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [574237594] [2023-11-29 02:47:31,203 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:31,203 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:31,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:31,320 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 02:47:31,320 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:31,320 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [574237594] [2023-11-29 02:47:31,321 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [574237594] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:31,321 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:31,321 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:47:31,321 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1776267140] [2023-11-29 02:47:31,322 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:31,323 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:31,323 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:31,324 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:31,324 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:31,352 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:47:31,352 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 02:47:31,352 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:31,353 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:47:31,353 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:32,841 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-29 02:47:32,842 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:47:32,864 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55143 event pairs, 3179 based on Foata normal form. 1/6686 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-29 02:47:32,909 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 02:47:32,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 02:47:32,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:32,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:32,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:47:32,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:47:32,911 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:47:32,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:47:32,912 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:32,912 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:47:32,913 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:47:32,914 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:32,914 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:32,915 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:47:32,915 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 02:47:32,935 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:32,936 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 02:47:32,936 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:47:32,937 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-29 02:47:32,937 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 02:47:32,938 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 02:47:32,938 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:32,938 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:47:32,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:47:32,938 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:32,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:32,939 INFO L85 PathProgramCache]: Analyzing trace with hash 408629074, now seen corresponding path program 1 times [2023-11-29 02:47:32,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:32,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1007126839] [2023-11-29 02:47:32,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:32,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:32,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:32,998 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 02:47:32,998 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:32,998 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1007126839] [2023-11-29 02:47:32,999 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1007126839] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:32,999 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:32,999 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:32,999 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950434809] [2023-11-29 02:47:32,999 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:33,000 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:33,000 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:33,018 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:47:33,019 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 02:47:33,019 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:33,019 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:47:33,019 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:34,207 INFO L124 PetriNetUnfolderBase]: 4221/7281 cut-off events. [2023-11-29 02:47:34,207 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:47:34,222 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13394 conditions, 7281 events. 4221/7281 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55852 event pairs, 2503 based on Foata normal form. 0/6696 useless extension candidates. Maximal degree in co-relation 13383. Up to 4393 conditions per place. [2023-11-29 02:47:34,252 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 02:47:34,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 220 flow [2023-11-29 02:47:34,253 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:34,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:34,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:47:34,254 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2023-11-29 02:47:34,254 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:47:34,254 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:47:34,255 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:34,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:47:34,256 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 02:47:34,257 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:34,257 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:34,258 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:47:34,258 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 220 flow [2023-11-29 02:47:34,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:34,280 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 02:47:34,280 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:47:34,281 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 02:47:34,281 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 02:47:34,281 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 02:47:34,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:34,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:47:34,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:47:34,282 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:34,283 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:34,283 INFO L85 PathProgramCache]: Analyzing trace with hash 408629075, now seen corresponding path program 1 times [2023-11-29 02:47:34,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:34,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075624045] [2023-11-29 02:47:34,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:34,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:34,300 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:34,353 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 02:47:34,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:34,354 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075624045] [2023-11-29 02:47:34,354 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075624045] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:34,354 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:34,354 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:34,354 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1117525556] [2023-11-29 02:47:34,355 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:34,355 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:34,355 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:34,356 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:34,356 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:34,373 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:47:34,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 02:47:34,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:34,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:47:34,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:35,230 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-29 02:47:35,230 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 02:47:35,247 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13380 conditions, 7272 events. 4217/7272 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55761 event pairs, 2503 based on Foata normal form. 5/6693 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-29 02:47:35,278 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 02:47:35,278 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 216 flow [2023-11-29 02:47:35,279 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:35,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:35,280 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:47:35,280 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:47:35,280 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:47:35,281 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:47:35,281 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:35,281 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:47:35,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:47:35,284 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:35,284 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:35,284 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:47:35,285 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 216 flow [2023-11-29 02:47:35,289 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:35,291 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 02:47:35,291 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:47:35,292 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-29 02:47:35,293 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 02:47:35,293 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 02:47:35,293 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:35,293 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:47:35,294 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:47:35,294 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:35,294 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:35,295 INFO L85 PathProgramCache]: Analyzing trace with hash 408629263, now seen corresponding path program 1 times [2023-11-29 02:47:35,295 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:35,295 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497204820] [2023-11-29 02:47:35,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:35,295 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:35,313 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:35,403 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 02:47:35,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:35,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497204820] [2023-11-29 02:47:35,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497204820] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:35,404 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:35,405 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:47:35,405 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1963952566] [2023-11-29 02:47:35,405 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:35,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:35,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:35,406 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:35,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:35,407 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-29 02:47:35,408 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:47:35,408 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:35,408 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-29 02:47:35,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:36,393 INFO L124 PetriNetUnfolderBase]: 3311/5494 cut-off events. [2023-11-29 02:47:36,394 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:47:36,409 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 5494 events. 3311/5494 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 318. Compared 39992 event pairs, 593 based on Foata normal form. 0/5435 useless extension candidates. Maximal degree in co-relation 10309. Up to 3661 conditions per place. [2023-11-29 02:47:36,433 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2023-11-29 02:47:36,433 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 258 flow [2023-11-29 02:47:36,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:36,434 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:36,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 02:47:36,435 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-29 02:47:36,435 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 02:47:36,435 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 02:47:36,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:36,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 02:47:36,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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 02:47:36,438 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:36,438 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:36,438 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 154 transitions. [2023-11-29 02:47:36,439 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 258 flow [2023-11-29 02:47:36,441 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:36,443 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-29 02:47:36,444 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 02:47:36,445 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-29 02:47:36,445 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-29 02:47:36,446 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:47:36,446 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:36,446 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:36,446 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:47:36,447 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:36,447 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:36,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1531854139, now seen corresponding path program 1 times [2023-11-29 02:47:36,448 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:36,448 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1830173273] [2023-11-29 02:47:36,448 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:36,448 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:36,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:36,520 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:47:36,521 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:36,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1830173273] [2023-11-29 02:47:36,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1830173273] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:36,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:36,522 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:36,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1575861199] [2023-11-29 02:47:36,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:36,523 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:36,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:36,524 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:36,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:36,546 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:47:36,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 02:47:36,547 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:36,547 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:47:36,547 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:37,290 INFO L124 PetriNetUnfolderBase]: 2920/5157 cut-off events. [2023-11-29 02:47:37,290 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 02:47:37,303 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9593 conditions, 5157 events. 2920/5157 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37948 event pairs, 1892 based on Foata normal form. 0/4962 useless extension candidates. Maximal degree in co-relation 9582. Up to 3460 conditions per place. [2023-11-29 02:47:37,322 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:47:37,322 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 206 flow [2023-11-29 02:47:37,322 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:37,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:37,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 02:47:37,324 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 02:47:37,324 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 02:47:37,324 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 02:47:37,324 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:37,324 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 02:47:37,325 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:47:37,326 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:37,326 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:37,327 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-29 02:47:37,327 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 206 flow [2023-11-29 02:47:37,328 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:37,329 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:47:37,329 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:47:37,330 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 02:47:37,330 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:47:37,331 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 02:47:37,331 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:37,331 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:37,331 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:47:37,331 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:37,332 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:37,332 INFO L85 PathProgramCache]: Analyzing trace with hash 1531854140, now seen corresponding path program 1 times [2023-11-29 02:47:37,332 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:37,332 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1322531098] [2023-11-29 02:47:37,332 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:37,333 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:37,349 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:37,401 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 02:47:37,402 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:37,402 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1322531098] [2023-11-29 02:47:37,402 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1322531098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:37,403 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:37,403 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:37,403 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1093317593] [2023-11-29 02:47:37,403 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:37,404 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:37,404 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:37,405 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:37,405 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:37,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:47:37,427 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:47:37,427 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:37,427 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:47:37,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:38,095 INFO L124 PetriNetUnfolderBase]: 2903/5180 cut-off events. [2023-11-29 02:47:38,095 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:47:38,105 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9461 conditions, 5180 events. 2903/5180 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38434 event pairs, 1356 based on Foata normal form. 12/5009 useless extension candidates. Maximal degree in co-relation 9451. Up to 3431 conditions per place. [2023-11-29 02:47:38,121 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:47:38,122 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 02:47:38,122 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:38,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:38,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 02:47:38,123 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 02:47:38,123 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 02:47:38,124 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 02:47:38,124 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:38,124 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 02:47:38,125 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 02:47:38,126 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:38,126 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:38,126 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-29 02:47:38,127 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 02:47:38,129 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:38,130 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:47:38,131 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 02:47:38,132 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-29 02:47:38,132 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:47:38,132 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:47:38,132 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:38,132 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:38,133 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:47:38,133 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:38,133 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:38,133 INFO L85 PathProgramCache]: Analyzing trace with hash 1439569096, now seen corresponding path program 1 times [2023-11-29 02:47:38,133 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:38,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1604796183] [2023-11-29 02:47:38,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:38,134 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:38,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:38,190 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 02:47:38,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:38,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1604796183] [2023-11-29 02:47:38,191 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1604796183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:38,191 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:38,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:38,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1638661476] [2023-11-29 02:47:38,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:38,191 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:38,192 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:38,192 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:38,192 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:38,213 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:47:38,213 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 02:47:38,213 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:38,214 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:47:38,214 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:38,853 INFO L124 PetriNetUnfolderBase]: 2978/5219 cut-off events. [2023-11-29 02:47:38,853 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:47:38,866 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 5219 events. 2978/5219 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38091 event pairs, 920 based on Foata normal form. 0/5112 useless extension candidates. Maximal degree in co-relation 9601. Up to 3426 conditions per place. [2023-11-29 02:47:38,885 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 02:47:38,885 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2023-11-29 02:47:38,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:38,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:38,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 02:47:38,887 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 02:47:38,887 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 02:47:38,887 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 02:47:38,887 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:38,887 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 02:47:38,888 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:47:38,888 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:38,889 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:38,889 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 138 transitions. [2023-11-29 02:47:38,889 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2023-11-29 02:47:38,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:38,891 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 02:47:38,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 02:47:38,892 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-29 02:47:38,892 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 02:47:38,893 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 02:47:38,893 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:38,893 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:38,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:47:38,893 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:38,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:38,893 INFO L85 PathProgramCache]: Analyzing trace with hash 1439569097, now seen corresponding path program 1 times [2023-11-29 02:47:38,894 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:38,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1152635583] [2023-11-29 02:47:38,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:38,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:38,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:38,992 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:47:38,992 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:38,992 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1152635583] [2023-11-29 02:47:38,992 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1152635583] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:38,993 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:38,993 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:47:38,993 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602520497] [2023-11-29 02:47:38,993 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:38,993 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:47:38,994 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:38,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:47:38,994 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:47:39,015 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:47:39,015 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 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 02:47:39,015 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:39,016 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:47:39,016 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:39,639 INFO L124 PetriNetUnfolderBase]: 2903/5048 cut-off events. [2023-11-29 02:47:39,639 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:47:39,650 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9353 conditions, 5048 events. 2903/5048 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36428 event pairs, 1400 based on Foata normal form. 36/4997 useless extension candidates. Maximal degree in co-relation 9343. Up to 3315 conditions per place. [2023-11-29 02:47:39,668 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 02:47:39,668 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 196 flow [2023-11-29 02:47:39,669 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:47:39,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:47:39,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 02:47:39,669 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 02:47:39,670 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 02:47:39,670 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 02:47:39,670 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:39,670 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 02:47:39,670 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 02:47:39,671 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:39,671 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:47:39,671 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 140 transitions. [2023-11-29 02:47:39,672 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 196 flow [2023-11-29 02:47:39,673 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:39,675 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-29 02:47:39,675 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 02:47:39,676 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-29 02:47:39,676 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-29 02:47:39,676 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 02:47:39,676 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:39,676 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 02:47:39,677 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:47:39,677 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:39,677 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:39,677 INFO L85 PathProgramCache]: Analyzing trace with hash -1928005311, now seen corresponding path program 1 times [2023-11-29 02:47:39,678 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:39,678 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [40146703] [2023-11-29 02:47:39,678 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:39,678 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:39,735 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:40,450 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 02:47:40,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:40,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [40146703] [2023-11-29 02:47:40,451 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [40146703] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:40,451 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:40,451 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-29 02:47:40,451 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480394798] [2023-11-29 02:47:40,452 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:40,452 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:47:40,453 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:40,453 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:47:40,454 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:47:40,736 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2023-11-29 02:47:40,737 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 10 states, 10 states have (on average 30.7) internal successors, (307), 10 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 02:47:40,737 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:40,737 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2023-11-29 02:47:40,738 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:41,847 INFO L124 PetriNetUnfolderBase]: 2923/4988 cut-off events. [2023-11-29 02:47:41,847 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:47:41,859 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9330 conditions, 4988 events. 2923/4988 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 293. Compared 35367 event pairs, 552 based on Foata normal form. 144/5050 useless extension candidates. Maximal degree in co-relation 9319. Up to 3315 conditions per place. [2023-11-29 02:47:41,878 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 37 selfloop transitions, 4 changer transitions 11/72 dead transitions. [2023-11-29 02:47:41,878 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 72 transitions, 260 flow [2023-11-29 02:47:41,879 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:47:41,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:47:41,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 256 transitions. [2023-11-29 02:47:41,881 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5626373626373626 [2023-11-29 02:47:41,881 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 256 transitions. [2023-11-29 02:47:41,881 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 256 transitions. [2023-11-29 02:47:41,882 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:41,882 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 256 transitions. [2023-11-29 02:47:41,883 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 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 02:47:41,884 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:47:41,884 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:47:41,885 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 7 states and 256 transitions. [2023-11-29 02:47:41,885 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 72 transitions, 260 flow [2023-11-29 02:47:41,886 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 72 transitions, 256 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:47:41,888 INFO L231 Difference]: Finished difference. Result has 62 places, 46 transitions, 108 flow [2023-11-29 02:47:41,888 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=102, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=108, PETRI_PLACES=62, PETRI_TRANSITIONS=46} [2023-11-29 02:47:41,889 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 02:47:41,889 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 46 transitions, 108 flow [2023-11-29 02:47:41,889 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 30.7) internal successors, (307), 10 states have internal predecessors, (307), 0 states have call successors, (0), 0 states 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 02:47:41,889 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:41,889 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 02:47:41,890 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:47:41,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:41,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:41,890 INFO L85 PathProgramCache]: Analyzing trace with hash -1928004003, now seen corresponding path program 1 times [2023-11-29 02:47:41,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:41,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2031111524] [2023-11-29 02:47:41,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:41,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:41,922 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:42,202 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 02:47:42,203 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:42,203 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2031111524] [2023-11-29 02:47:42,203 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2031111524] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:42,203 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:42,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:47:42,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [108353766] [2023-11-29 02:47:42,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:42,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:47:42,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:42,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:47:42,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:47:42,223 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2023-11-29 02:47:42,224 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 46 transitions, 108 flow. Second operand has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 02:47:42,224 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:42,224 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2023-11-29 02:47:42,224 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:46,544 INFO L124 PetriNetUnfolderBase]: 30055/43512 cut-off events. [2023-11-29 02:47:46,545 INFO L125 PetriNetUnfolderBase]: For 235/235 co-relation queries the response was YES. [2023-11-29 02:47:46,645 INFO L83 FinitePrefix]: Finished finitePrefix Result has 84701 conditions, 43512 events. 30055/43512 cut-off events. For 235/235 co-relation queries the response was YES. Maximal size of possible extension queue 1950. Compared 313281 event pairs, 6841 based on Foata normal form. 0/42461 useless extension candidates. Maximal degree in co-relation 84690. Up to 15129 conditions per place. [2023-11-29 02:47:46,738 INFO L140 encePairwiseOnDemand]: 54/65 looper letters, 46 selfloop transitions, 7 changer transitions 97/166 dead transitions. [2023-11-29 02:47:46,738 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 166 transitions, 656 flow [2023-11-29 02:47:46,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:47:46,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:47:46,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2023-11-29 02:47:46,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.705982905982906 [2023-11-29 02:47:46,741 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 413 transitions. [2023-11-29 02:47:46,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 413 transitions. [2023-11-29 02:47:46,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:46,741 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 413 transitions. [2023-11-29 02:47:46,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 45.888888888888886) internal successors, (413), 9 states have internal predecessors, (413), 0 states have call successors, (0), 0 states 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 02:47:46,744 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:47:46,744 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:47:46,745 INFO L175 Difference]: Start difference. First operand has 62 places, 46 transitions, 108 flow. Second operand 9 states and 413 transitions. [2023-11-29 02:47:46,745 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 166 transitions, 656 flow [2023-11-29 02:47:46,746 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 166 transitions, 646 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:47:46,749 INFO L231 Difference]: Finished difference. Result has 72 places, 51 transitions, 197 flow [2023-11-29 02:47:46,750 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=101, PETRI_DIFFERENCE_MINUEND_PLACES=56, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=197, PETRI_PLACES=72, PETRI_TRANSITIONS=51} [2023-11-29 02:47:46,750 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-29 02:47:46,751 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 51 transitions, 197 flow [2023-11-29 02:47:46,751 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 31.8) internal successors, (159), 5 states have internal predecessors, (159), 0 states have call successors, (0), 0 states 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 02:47:46,751 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:46,751 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:46,751 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:47:46,751 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:46,752 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:46,752 INFO L85 PathProgramCache]: Analyzing trace with hash -448811146, now seen corresponding path program 1 times [2023-11-29 02:47:46,752 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:46,752 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106947982] [2023-11-29 02:47:46,752 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:46,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:46,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:46,970 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 02:47:46,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:46,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106947982] [2023-11-29 02:47:46,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106947982] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:46,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:46,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:47:46,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [811605041] [2023-11-29 02:47:46,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:46,971 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:47:46,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:46,972 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:47:46,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:47:46,984 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2023-11-29 02:47:46,985 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 51 transitions, 197 flow. Second operand has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 02:47:46,985 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:46,985 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2023-11-29 02:47:46,985 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:51,698 INFO L124 PetriNetUnfolderBase]: 22992/33992 cut-off events. [2023-11-29 02:47:51,698 INFO L125 PetriNetUnfolderBase]: For 48144/48397 co-relation queries the response was YES. [2023-11-29 02:47:51,818 INFO L83 FinitePrefix]: Finished finitePrefix Result has 97995 conditions, 33992 events. 22992/33992 cut-off events. For 48144/48397 co-relation queries the response was YES. Maximal size of possible extension queue 1547. Compared 245247 event pairs, 3634 based on Foata normal form. 893/34817 useless extension candidates. Maximal degree in co-relation 97976. Up to 14004 conditions per place. [2023-11-29 02:47:51,985 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 62 selfloop transitions, 11 changer transitions 92/181 dead transitions. [2023-11-29 02:47:51,985 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 181 transitions, 1125 flow [2023-11-29 02:47:51,986 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:47:51,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 02:47:51,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 445 transitions. [2023-11-29 02:47:51,987 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6846153846153846 [2023-11-29 02:47:51,987 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 445 transitions. [2023-11-29 02:47:51,987 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 445 transitions. [2023-11-29 02:47:51,988 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:51,988 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 445 transitions. [2023-11-29 02:47:51,989 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 02:47:51,991 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 02:47:51,991 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 02:47:51,991 INFO L175 Difference]: Start difference. First operand has 72 places, 51 transitions, 197 flow. Second operand 10 states and 445 transitions. [2023-11-29 02:47:51,991 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 181 transitions, 1125 flow [2023-11-29 02:47:52,186 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 181 transitions, 995 flow, removed 31 selfloop flow, removed 4 redundant places. [2023-11-29 02:47:52,188 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 295 flow [2023-11-29 02:47:52,188 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=295, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-11-29 02:47:52,189 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 7 predicate places. [2023-11-29 02:47:52,189 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 295 flow [2023-11-29 02:47:52,189 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 31.5) internal successors, (189), 6 states have internal predecessors, (189), 0 states have call successors, (0), 0 states 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 02:47:52,189 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:52,190 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:47:52,190 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:47:52,190 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:52,190 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:52,190 INFO L85 PathProgramCache]: Analyzing trace with hash -234508028, now seen corresponding path program 1 times [2023-11-29 02:47:52,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:52,191 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1377606910] [2023-11-29 02:47:52,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:52,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:52,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:52,339 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 02:47:52,339 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:52,340 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1377606910] [2023-11-29 02:47:52,340 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1377606910] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:52,340 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:52,340 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:47:52,340 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1858071651] [2023-11-29 02:47:52,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:52,340 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:47:52,341 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:52,341 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:47:52,341 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:47:52,347 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 32 out of 65 [2023-11-29 02:47:52,347 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 58 transitions, 295 flow. Second operand has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 02:47:52,347 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:52,347 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 32 of 65 [2023-11-29 02:47:52,347 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:47:56,236 INFO L124 PetriNetUnfolderBase]: 18097/28618 cut-off events. [2023-11-29 02:47:56,236 INFO L125 PetriNetUnfolderBase]: For 63576/64394 co-relation queries the response was YES. [2023-11-29 02:47:56,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 82928 conditions, 28618 events. 18097/28618 cut-off events. For 63576/64394 co-relation queries the response was YES. Maximal size of possible extension queue 1413. Compared 229508 event pairs, 8789 based on Foata normal form. 1140/29403 useless extension candidates. Maximal degree in co-relation 82902. Up to 19008 conditions per place. [2023-11-29 02:47:56,475 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 47 selfloop transitions, 6 changer transitions 49/128 dead transitions. [2023-11-29 02:47:56,476 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 128 transitions, 826 flow [2023-11-29 02:47:56,476 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:47:56,476 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:47:56,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 312 transitions. [2023-11-29 02:47:56,477 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6857142857142857 [2023-11-29 02:47:56,477 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 312 transitions. [2023-11-29 02:47:56,478 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 312 transitions. [2023-11-29 02:47:56,478 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:47:56,478 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 312 transitions. [2023-11-29 02:47:56,479 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.57142857142857) internal successors, (312), 7 states have internal predecessors, (312), 0 states have call successors, (0), 0 states 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 02:47:56,480 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:47:56,480 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:47:56,480 INFO L175 Difference]: Start difference. First operand has 79 places, 58 transitions, 295 flow. Second operand 7 states and 312 transitions. [2023-11-29 02:47:56,480 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 128 transitions, 826 flow [2023-11-29 02:47:56,881 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 128 transitions, 810 flow, removed 8 selfloop flow, removed 0 redundant places. [2023-11-29 02:47:56,883 INFO L231 Difference]: Finished difference. Result has 84 places, 63 transitions, 377 flow [2023-11-29 02:47:56,883 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=287, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=52, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=377, PETRI_PLACES=84, PETRI_TRANSITIONS=63} [2023-11-29 02:47:56,883 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 12 predicate places. [2023-11-29 02:47:56,883 INFO L495 AbstractCegarLoop]: Abstraction has has 84 places, 63 transitions, 377 flow [2023-11-29 02:47:56,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.8) internal successors, (174), 5 states have internal predecessors, (174), 0 states have call successors, (0), 0 states 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 02:47:56,883 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:47:56,884 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] [2023-11-29 02:47:56,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:47:56,884 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:47:56,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:47:56,884 INFO L85 PathProgramCache]: Analyzing trace with hash -583621547, now seen corresponding path program 1 times [2023-11-29 02:47:56,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:47:56,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138236682] [2023-11-29 02:47:56,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:47:56,884 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:47:56,909 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:47:57,030 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 02:47:57,030 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:47:57,030 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138236682] [2023-11-29 02:47:57,031 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138236682] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:47:57,031 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:47:57,031 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:47:57,031 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223344543] [2023-11-29 02:47:57,031 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:47:57,031 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:47:57,032 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:47:57,032 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:47:57,032 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:47:57,044 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:47:57,044 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 84 places, 63 transitions, 377 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:47:57,044 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:47:57,044 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:47:57,044 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:03,420 INFO L124 PetriNetUnfolderBase]: 34339/51291 cut-off events. [2023-11-29 02:48:03,421 INFO L125 PetriNetUnfolderBase]: For 70493/73484 co-relation queries the response was YES. [2023-11-29 02:48:03,799 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131160 conditions, 51291 events. 34339/51291 cut-off events. For 70493/73484 co-relation queries the response was YES. Maximal size of possible extension queue 2166. Compared 389848 event pairs, 5875 based on Foata normal form. 2159/51896 useless extension candidates. Maximal degree in co-relation 131127. Up to 27699 conditions per place. [2023-11-29 02:48:04,211 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 60 selfloop transitions, 6 changer transitions 0/99 dead transitions. [2023-11-29 02:48:04,211 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 83 places, 99 transitions, 628 flow [2023-11-29 02:48:04,211 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:48:04,211 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:48:04,213 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 186 transitions. [2023-11-29 02:48:04,213 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7153846153846154 [2023-11-29 02:48:04,213 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 186 transitions. [2023-11-29 02:48:04,213 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 186 transitions. [2023-11-29 02:48:04,214 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:04,214 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 186 transitions. [2023-11-29 02:48:04,215 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.5) internal successors, (186), 4 states have internal predecessors, (186), 0 states have call successors, (0), 0 states 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 02:48:04,216 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 02:48:04,216 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 02:48:04,216 INFO L175 Difference]: Start difference. First operand has 84 places, 63 transitions, 377 flow. Second operand 4 states and 186 transitions. [2023-11-29 02:48:04,217 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 83 places, 99 transitions, 628 flow [2023-11-29 02:48:04,391 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 76 places, 99 transitions, 586 flow, removed 18 selfloop flow, removed 7 redundant places. [2023-11-29 02:48:04,393 INFO L231 Difference]: Finished difference. Result has 78 places, 68 transitions, 389 flow [2023-11-29 02:48:04,393 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=343, PETRI_DIFFERENCE_MINUEND_PLACES=73, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=389, PETRI_PLACES=78, PETRI_TRANSITIONS=68} [2023-11-29 02:48:04,393 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 6 predicate places. [2023-11-29 02:48:04,394 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 68 transitions, 389 flow [2023-11-29 02:48:04,394 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:48:04,394 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:04,394 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] [2023-11-29 02:48:04,394 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:48:04,394 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:04,395 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:04,395 INFO L85 PathProgramCache]: Analyzing trace with hash -338530637, now seen corresponding path program 1 times [2023-11-29 02:48:04,395 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:04,395 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [826042764] [2023-11-29 02:48:04,395 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:04,395 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:04,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:04,734 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 02:48:04,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:04,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [826042764] [2023-11-29 02:48:04,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [826042764] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:04,735 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:04,735 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:48:04,735 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036819733] [2023-11-29 02:48:04,735 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:04,736 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:48:04,736 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:04,736 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:48:04,737 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:48:04,755 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 65 [2023-11-29 02:48:04,756 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 68 transitions, 389 flow. Second operand has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 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 02:48:04,756 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:04,756 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 65 [2023-11-29 02:48:04,756 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:14,277 INFO L124 PetriNetUnfolderBase]: 44189/66631 cut-off events. [2023-11-29 02:48:14,277 INFO L125 PetriNetUnfolderBase]: For 141148/144174 co-relation queries the response was YES. [2023-11-29 02:48:14,660 INFO L83 FinitePrefix]: Finished finitePrefix Result has 203789 conditions, 66631 events. 44189/66631 cut-off events. For 141148/144174 co-relation queries the response was YES. Maximal size of possible extension queue 3091. Compared 544784 event pairs, 12444 based on Foata normal form. 1290/64340 useless extension candidates. Maximal degree in co-relation 203759. Up to 22021 conditions per place. [2023-11-29 02:48:15,060 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 137 selfloop transitions, 30 changer transitions 4/192 dead transitions. [2023-11-29 02:48:15,060 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 192 transitions, 1303 flow [2023-11-29 02:48:15,061 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:48:15,061 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 02:48:15,063 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 441 transitions. [2023-11-29 02:48:15,063 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6784615384615384 [2023-11-29 02:48:15,063 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 441 transitions. [2023-11-29 02:48:15,063 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 441 transitions. [2023-11-29 02:48:15,064 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:15,064 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 441 transitions. [2023-11-29 02:48:15,065 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 44.1) internal successors, (441), 10 states have internal predecessors, (441), 0 states have call successors, (0), 0 states 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 02:48:15,066 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 02:48:15,067 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 65.0) internal successors, (715), 11 states have internal predecessors, (715), 0 states have call successors, (0), 0 states 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 02:48:15,067 INFO L175 Difference]: Start difference. First operand has 78 places, 68 transitions, 389 flow. Second operand 10 states and 441 transitions. [2023-11-29 02:48:15,067 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 192 transitions, 1303 flow [2023-11-29 02:48:15,735 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 192 transitions, 1291 flow, removed 5 selfloop flow, removed 1 redundant places. [2023-11-29 02:48:15,737 INFO L231 Difference]: Finished difference. Result has 95 places, 87 transitions, 701 flow [2023-11-29 02:48:15,737 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=381, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=48, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=701, PETRI_PLACES=95, PETRI_TRANSITIONS=87} [2023-11-29 02:48:15,738 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-11-29 02:48:15,738 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 87 transitions, 701 flow [2023-11-29 02:48:15,738 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 32.0) internal successors, (192), 6 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 02:48:15,738 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:15,739 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:15,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:48:15,739 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:15,739 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:15,739 INFO L85 PathProgramCache]: Analyzing trace with hash -1692445722, now seen corresponding path program 1 times [2023-11-29 02:48:15,739 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:15,739 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1602292341] [2023-11-29 02:48:15,739 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:15,739 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:15,786 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:48:15,931 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:15,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1602292341] [2023-11-29 02:48:15,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1602292341] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:15,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:15,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:48:15,932 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1574305646] [2023-11-29 02:48:15,932 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:15,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:48:15,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:15,933 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:48:15,933 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:48:15,939 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:48:15,940 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 87 transitions, 701 flow. Second operand has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 02:48:15,940 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:15,940 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:48:15,940 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:24,736 INFO L124 PetriNetUnfolderBase]: 43591/64693 cut-off events. [2023-11-29 02:48:24,736 INFO L125 PetriNetUnfolderBase]: For 123000/128140 co-relation queries the response was YES. [2023-11-29 02:48:25,274 INFO L83 FinitePrefix]: Finished finitePrefix Result has 184754 conditions, 64693 events. 43591/64693 cut-off events. For 123000/128140 co-relation queries the response was YES. Maximal size of possible extension queue 2455. Compared 492960 event pairs, 5781 based on Foata normal form. 3111/65959 useless extension candidates. Maximal degree in co-relation 184714. Up to 25465 conditions per place. [2023-11-29 02:48:25,432 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 81 selfloop transitions, 10 changer transitions 8/141 dead transitions. [2023-11-29 02:48:25,432 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 141 transitions, 1109 flow [2023-11-29 02:48:25,433 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:48:25,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:48:25,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-29 02:48:25,434 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7292307692307692 [2023-11-29 02:48:25,434 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-29 02:48:25,434 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-29 02:48:25,435 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:25,435 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-29 02:48:25,436 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 02:48:25,437 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:48:25,437 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:48:25,437 INFO L175 Difference]: Start difference. First operand has 95 places, 87 transitions, 701 flow. Second operand 5 states and 237 transitions. [2023-11-29 02:48:25,437 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 141 transitions, 1109 flow [2023-11-29 02:48:26,524 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 99 places, 141 transitions, 1073 flow, removed 18 selfloop flow, removed 0 redundant places. [2023-11-29 02:48:26,526 INFO L231 Difference]: Finished difference. Result has 101 places, 84 transitions, 648 flow [2023-11-29 02:48:26,526 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=665, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=77, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=648, PETRI_PLACES=101, PETRI_TRANSITIONS=84} [2023-11-29 02:48:26,527 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 29 predicate places. [2023-11-29 02:48:26,527 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 84 transitions, 648 flow [2023-11-29 02:48:26,527 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.2) internal successors, (171), 5 states have internal predecessors, (171), 0 states have call successors, (0), 0 states 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 02:48:26,527 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:26,527 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 02:48:26,527 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:48:26,528 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:26,528 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:26,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1266715939, now seen corresponding path program 1 times [2023-11-29 02:48:26,528 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:26,528 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349412610] [2023-11-29 02:48:26,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:26,529 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:26,587 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:26,778 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 02:48:26,778 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:26,779 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349412610] [2023-11-29 02:48:26,779 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349412610] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:26,779 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:26,779 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:48:26,779 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [712669431] [2023-11-29 02:48:26,780 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:26,780 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:48:26,780 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:26,781 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:48:26,781 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:48:26,787 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:48:26,787 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 84 transitions, 648 flow. Second operand has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 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 02:48:26,787 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:26,787 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:48:26,788 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:34,025 INFO L124 PetriNetUnfolderBase]: 32035/47001 cut-off events. [2023-11-29 02:48:34,025 INFO L125 PetriNetUnfolderBase]: For 83268/87503 co-relation queries the response was YES. [2023-11-29 02:48:34,397 INFO L83 FinitePrefix]: Finished finitePrefix Result has 142316 conditions, 47001 events. 32035/47001 cut-off events. For 83268/87503 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 341998 event pairs, 3583 based on Foata normal form. 1853/47217 useless extension candidates. Maximal degree in co-relation 142272. Up to 16074 conditions per place. [2023-11-29 02:48:34,485 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 95 selfloop transitions, 14 changer transitions 2/152 dead transitions. [2023-11-29 02:48:34,486 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 103 places, 152 transitions, 1150 flow [2023-11-29 02:48:34,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:48:34,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:48:34,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 286 transitions. [2023-11-29 02:48:34,488 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:48:34,488 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 286 transitions. [2023-11-29 02:48:34,488 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 286 transitions. [2023-11-29 02:48:34,488 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:34,488 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 286 transitions. [2023-11-29 02:48:34,489 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.666666666666664) internal successors, (286), 6 states have internal predecessors, (286), 0 states have call successors, (0), 0 states 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 02:48:34,490 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:48:34,490 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:48:34,490 INFO L175 Difference]: Start difference. First operand has 101 places, 84 transitions, 648 flow. Second operand 6 states and 286 transitions. [2023-11-29 02:48:34,490 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 103 places, 152 transitions, 1150 flow [2023-11-29 02:48:34,632 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 152 transitions, 1122 flow, removed 10 selfloop flow, removed 3 redundant places. [2023-11-29 02:48:34,634 INFO L231 Difference]: Finished difference. Result has 102 places, 88 transitions, 694 flow [2023-11-29 02:48:34,634 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=609, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=69, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=694, PETRI_PLACES=102, PETRI_TRANSITIONS=88} [2023-11-29 02:48:34,635 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 30 predicate places. [2023-11-29 02:48:34,635 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 88 transitions, 694 flow [2023-11-29 02:48:34,635 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.0) internal successors, (204), 6 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 02:48:34,635 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:34,635 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 02:48:34,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:48:34,635 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:34,636 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:34,636 INFO L85 PathProgramCache]: Analyzing trace with hash -990918694, now seen corresponding path program 1 times [2023-11-29 02:48:34,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:34,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [375658950] [2023-11-29 02:48:34,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:34,636 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:34,693 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:34,862 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 02:48:34,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:34,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [375658950] [2023-11-29 02:48:34,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [375658950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:34,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:34,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:48:34,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [280447805] [2023-11-29 02:48:34,864 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:34,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:48:34,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:34,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:48:34,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:48:34,880 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:48:34,881 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 88 transitions, 694 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 02:48:34,881 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:34,881 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:48:34,881 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:41,168 INFO L124 PetriNetUnfolderBase]: 29187/42409 cut-off events. [2023-11-29 02:48:41,168 INFO L125 PetriNetUnfolderBase]: For 98831/103018 co-relation queries the response was YES. [2023-11-29 02:48:41,487 INFO L83 FinitePrefix]: Finished finitePrefix Result has 136127 conditions, 42409 events. 29187/42409 cut-off events. For 98831/103018 co-relation queries the response was YES. Maximal size of possible extension queue 2123. Compared 305885 event pairs, 3443 based on Foata normal form. 881/41669 useless extension candidates. Maximal degree in co-relation 136082. Up to 16074 conditions per place. [2023-11-29 02:48:41,546 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 85 selfloop transitions, 18 changer transitions 11/144 dead transitions. [2023-11-29 02:48:41,546 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 144 transitions, 1096 flow [2023-11-29 02:48:41,547 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:48:41,547 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:48:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2023-11-29 02:48:41,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6879120879120879 [2023-11-29 02:48:41,548 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 313 transitions. [2023-11-29 02:48:41,548 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 313 transitions. [2023-11-29 02:48:41,548 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:41,549 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 313 transitions. [2023-11-29 02:48:41,549 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.714285714285715) internal successors, (313), 7 states have internal predecessors, (313), 0 states have call successors, (0), 0 states 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 02:48:41,550 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:48:41,551 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:48:41,551 INFO L175 Difference]: Start difference. First operand has 102 places, 88 transitions, 694 flow. Second operand 7 states and 313 transitions. [2023-11-29 02:48:41,551 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 144 transitions, 1096 flow [2023-11-29 02:48:42,953 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 144 transitions, 1014 flow, removed 33 selfloop flow, removed 13 redundant places. [2023-11-29 02:48:42,955 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 566 flow [2023-11-29 02:48:42,955 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=589, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=86, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=566, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2023-11-29 02:48:42,956 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 23 predicate places. [2023-11-29 02:48:42,956 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 566 flow [2023-11-29 02:48:42,956 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 02:48:42,956 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:42,956 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] [2023-11-29 02:48:42,956 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:48:42,956 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:42,956 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:42,957 INFO L85 PathProgramCache]: Analyzing trace with hash 763441836, now seen corresponding path program 1 times [2023-11-29 02:48:42,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:42,957 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [805502489] [2023-11-29 02:48:42,957 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:42,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:42,995 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:44,224 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 02:48:44,224 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:48:44,224 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [805502489] [2023-11-29 02:48:44,224 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [805502489] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:44,224 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:44,224 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:48:44,224 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [285711428] [2023-11-29 02:48:44,225 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:44,225 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:48:44,225 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:48:44,226 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:48:44,226 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:48:44,230 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:48:44,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 566 flow. Second operand has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 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 02:48:44,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:44,231 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:48:44,231 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:47,123 INFO L124 PetriNetUnfolderBase]: 10371/18363 cut-off events. [2023-11-29 02:48:47,123 INFO L125 PetriNetUnfolderBase]: For 40282/43436 co-relation queries the response was YES. [2023-11-29 02:48:47,316 INFO L83 FinitePrefix]: Finished finitePrefix Result has 54477 conditions, 18363 events. 10371/18363 cut-off events. For 40282/43436 co-relation queries the response was YES. Maximal size of possible extension queue 1357. Compared 165642 event pairs, 2827 based on Foata normal form. 311/16666 useless extension candidates. Maximal degree in co-relation 54440. Up to 5214 conditions per place. [2023-11-29 02:48:47,364 INFO L140 encePairwiseOnDemand]: 57/65 looper letters, 61 selfloop transitions, 8 changer transitions 17/136 dead transitions. [2023-11-29 02:48:47,364 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 136 transitions, 944 flow [2023-11-29 02:48:47,365 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:48:47,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:48:47,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 384 transitions. [2023-11-29 02:48:47,367 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6564102564102564 [2023-11-29 02:48:47,367 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 384 transitions. [2023-11-29 02:48:47,367 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 384 transitions. [2023-11-29 02:48:47,368 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:47,368 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 384 transitions. [2023-11-29 02:48:47,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 42.666666666666664) internal successors, (384), 9 states have internal predecessors, (384), 0 states have call successors, (0), 0 states 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 02:48:47,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:48:47,371 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:48:47,372 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 566 flow. Second operand 9 states and 384 transitions. [2023-11-29 02:48:47,372 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 136 transitions, 944 flow [2023-11-29 02:48:47,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 136 transitions, 828 flow, removed 32 selfloop flow, removed 10 redundant places. [2023-11-29 02:48:47,987 INFO L231 Difference]: Finished difference. Result has 96 places, 82 transitions, 534 flow [2023-11-29 02:48:47,987 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=465, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=534, PETRI_PLACES=96, PETRI_TRANSITIONS=82} [2023-11-29 02:48:47,988 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 24 predicate places. [2023-11-29 02:48:47,988 INFO L495 AbstractCegarLoop]: Abstraction has has 96 places, 82 transitions, 534 flow [2023-11-29 02:48:47,988 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 36.0) internal successors, (360), 10 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 02:48:47,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:47,988 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] [2023-11-29 02:48:47,988 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:48:47,989 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:47,989 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:47,989 INFO L85 PathProgramCache]: Analyzing trace with hash 207575866, now seen corresponding path program 2 times [2023-11-29 02:48:47,989 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:48:47,989 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [363173909] [2023-11-29 02:48:47,989 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:47,989 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:48:48,058 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:48:48,059 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:48:48,259 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:48:48,293 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-29 02:48:48,294 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:48:48,294 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:48:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:48:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:48:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:48:48,296 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:48:48,297 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:48:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:48:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:48:48,298 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:48:48,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:48:48,298 INFO L445 BasicCegarLoop]: Path program histogram: [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:48:48,304 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:48:48,304 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:48:48,369 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:48:48,370 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:48:48,371 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:48:48,373 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:48:48,389 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:48:48,390 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:48:48,403 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:48:48 BasicIcfg [2023-11-29 02:48:48,404 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:48:48,404 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:48:48,404 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:48:48,404 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:48:48,405 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:47:28" (3/4) ... [2023-11-29 02:48:48,406 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:48:48,407 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:48:48,407 INFO L158 Benchmark]: Toolchain (without parser) took 81624.10ms. Allocated memory was 159.4MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 125.2MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 3.0GB. Max. memory is 16.1GB. [2023-11-29 02:48:48,408 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:48:48,408 INFO L158 Benchmark]: CACSL2BoogieTranslator took 663.68ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 100.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-29 02:48:48,408 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.19ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 97.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:48:48,409 INFO L158 Benchmark]: Boogie Preprocessor took 74.96ms. Allocated memory is still 159.4MB. Free memory was 97.9MB in the beginning and 94.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:48:48,409 INFO L158 Benchmark]: RCFGBuilder took 1000.21ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 104.3MB in the end (delta: -10.3MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. [2023-11-29 02:48:48,410 INFO L158 Benchmark]: TraceAbstraction took 79804.95ms. Allocated memory was 159.4MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 103.4MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. [2023-11-29 02:48:48,410 INFO L158 Benchmark]: Witness Printer took 2.82ms. Allocated memory is still 9.3GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:48:48,412 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.18ms. Allocated memory is still 117.4MB. Free memory is still 71.7MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 663.68ms. Allocated memory is still 159.4MB. Free memory was 124.9MB in the beginning and 100.6MB in the end (delta: 24.3MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.19ms. Allocated memory is still 159.4MB. Free memory was 100.6MB in the beginning and 97.9MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.96ms. Allocated memory is still 159.4MB. Free memory was 97.9MB in the beginning and 94.0MB in the end (delta: 3.9MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1000.21ms. Allocated memory is still 159.4MB. Free memory was 94.0MB in the beginning and 104.3MB in the end (delta: -10.3MB). Peak memory consumption was 41.5MB. Max. memory is 16.1GB. * TraceAbstraction took 79804.95ms. Allocated memory was 159.4MB in the beginning and 9.3GB in the end (delta: 9.1GB). Free memory was 103.4MB in the beginning and 6.2GB in the end (delta: -6.1GB). Peak memory consumption was 3.8GB. Max. memory is 16.1GB. * Witness Printer took 2.82ms. Allocated memory is still 9.3GB. Free memory is still 6.2GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice2=1, x=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice2=1, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={5:0}, t1410={6:0}, t1411={7:0}, t1412={3:0}, weak$$choice2=1, x=2, y=2, z=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix053_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=1, x=2, y=2, 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 860]: 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, 97 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: 79.6s, OverallIterations: 20, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 74.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1297 SdHoareTripleChecker+Valid, 4.3s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1117 mSDsluCounter, 263 SdHoareTripleChecker+Invalid, 3.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 171 mSDsCounter, 87 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2836 IncrementalHoareTripleChecker+Invalid, 2923 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 87 mSolverCounterUnsat, 92 mSDtfsCounter, 2836 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 102 GetRequests, 16 SyntacticMatches, 0 SemanticMatches, 86 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 72 ImplicationChecksByTransitivity, 0.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=701occurred in iteration=15, InterpolantAutomatonStates: 101, 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.1s InterpolantComputationTime, 375 NumberOfCodeBlocks, 375 NumberOfCodeBlocksAsserted, 20 NumberOfCheckSat, 315 ConstructedInterpolants, 0 QuantifiedInterpolants, 2127 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 19 InterpolantComputations, 19 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 02:48:48,438 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:48:51,081 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:48:51,163 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 02:48:51,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:48:51,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:48:51,200 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:48:51,201 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:48:51,202 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:48:51,203 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:48:51,204 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:48:51,204 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:48:51,205 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:48:51,206 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:48:51,207 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:48:51,208 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:48:51,208 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:48:51,209 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:48:51,210 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:48:51,210 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:48:51,211 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:48:51,212 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:48:51,215 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:48:51,215 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:48:51,216 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:48:51,216 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:48:51,217 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 02:48:51,217 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 02:48:51,218 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:48:51,218 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:48:51,218 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:48:51,219 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:48:51,219 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:48:51,220 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:48:51,220 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:48:51,220 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:51,221 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:48:51,221 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:48:51,221 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 02:48:51,222 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 02:48:51,222 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:48:51,222 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:48:51,223 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:48:51,223 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:48:51,223 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 02:48:51,223 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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 -> 03b62196b25662d8efd4f9890b2a9ba3be7263fa8e2874a92734800e01910b00 [2023-11-29 02:48:51,537 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:48:51,558 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:48:51,561 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:48:51,562 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:48:51,562 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:48:51,563 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:48:54,526 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:48:54,804 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:48:54,805 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/sv-benchmarks/c/pthread-wmm/mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:48:54,825 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/563fcd3be/3a901f92ceba4f0aa9cdb9972f474f80/FLAG2c808a7c5 [2023-11-29 02:48:54,843 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/data/563fcd3be/3a901f92ceba4f0aa9cdb9972f474f80 [2023-11-29 02:48:54,846 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:48:54,848 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:48:54,850 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:54,850 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:48:54,856 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:48:54,857 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:54" (1/1) ... [2023-11-29 02:48:54,858 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1f595017 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:54, skipping insertion in model container [2023-11-29 02:48:54,859 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:48:54" (1/1) ... [2023-11-29 02:48:54,927 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:48:55,369 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:55,413 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:48:55,488 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:48:55,529 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:48:55,529 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-29 02:48:55,537 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:48:55,538 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55 WrapperNode [2023-11-29 02:48:55,538 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:48:55,539 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:55,540 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:48:55,540 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:48:55,548 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,571 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,600 INFO L138 Inliner]: procedures = 180, calls = 68, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 149 [2023-11-29 02:48:55,601 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:48:55,602 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:48:55,602 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:48:55,602 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:48:55,614 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,615 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,618 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,638 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 02:48:55,638 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,639 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,651 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,654 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,657 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,660 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,666 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:48:55,667 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:48:55,668 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:48:55,668 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:48:55,669 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (1/1) ... [2023-11-29 02:48:55,676 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:48:55,686 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:48:55,700 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:48:55,714 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:48:55,744 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-29 02:48:55,744 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 02:48:55,745 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 02:48:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-29 02:48:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 02:48:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 02:48:55,746 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 02:48:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 02:48:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-29 02:48:55,747 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-29 02:48:55,747 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-29 02:48:55,748 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-29 02:48:55,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-29 02:48:55,748 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-29 02:48:55,748 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-29 02:48:55,749 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-29 02:48:55,749 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-29 02:48:55,749 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-29 02:48:55,749 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:48:55,749 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:48:55,751 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 02:48:55,931 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:48:55,933 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:48:56,338 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:48:56,588 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:48:56,588 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-29 02:48:56,589 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:56 BoogieIcfgContainer [2023-11-29 02:48:56,589 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:48:56,591 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:48:56,592 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:48:56,595 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:48:56,595 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:48:54" (1/3) ... [2023-11-29 02:48:56,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f69352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:56, skipping insertion in model container [2023-11-29 02:48:56,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:48:55" (2/3) ... [2023-11-29 02:48:56,596 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@34f69352 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:48:56, skipping insertion in model container [2023-11-29 02:48:56,596 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:56" (3/3) ... [2023-11-29 02:48:56,598 INFO L112 eAbstractionObserver]: Analyzing ICFG mix053_power.oepc_pso.oepc_rmo.oepc.i [2023-11-29 02:48:56,617 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:48:56,617 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-29 02:48:56,617 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 02:48:56,680 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-29 02:48:56,723 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 02:48:56,759 INFO L124 PetriNetUnfolderBase]: 2/61 cut-off events. [2023-11-29 02:48:56,759 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:48:56,764 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74 conditions, 61 events. 2/61 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 127 event pairs, 0 based on Foata normal form. 0/48 useless extension candidates. Maximal degree in co-relation 62. Up to 2 conditions per place. [2023-11-29 02:48:56,764 INFO L82 GeneralOperation]: Start removeDead. Operand has 76 places, 65 transitions, 146 flow [2023-11-29 02:48:56,768 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 72 places, 61 transitions, 134 flow [2023-11-29 02:48:56,780 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:48:56,786 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;@6f32656b, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:48:56,786 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-29 02:48:56,790 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 02:48:56,790 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-29 02:48:56,790 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 02:48:56,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:56,791 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:48:56,791 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:56,796 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:56,796 INFO L85 PathProgramCache]: Analyzing trace with hash 13766, now seen corresponding path program 1 times [2023-11-29 02:48:56,810 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:56,810 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1862120740] [2023-11-29 02:48:56,810 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:56,811 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 02:48:56,811 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:56,815 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:56,827 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:56,951 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:48:56,956 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:57,027 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 02:48:57,040 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 02:48:57,040 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:57,041 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:57,041 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1862120740] [2023-11-29 02:48:57,042 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1862120740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:57,042 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:57,042 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:48:57,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [673654483] [2023-11-29 02:48:57,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:57,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:48:57,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:57,087 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:48:57,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:48:57,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:48:57,146 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 61 transitions, 134 flow. Second operand has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 02:48:57,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:57,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:48:57,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:48:58,657 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-29 02:48:58,657 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-29 02:48:58,686 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13210 conditions, 7283 events. 4217/7283 cut-off events. For 65/65 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55188 event pairs, 3179 based on Foata normal form. 360/7046 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-29 02:48:58,752 INFO L140 encePairwiseOnDemand]: 60/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-29 02:48:58,752 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 72 places, 68 transitions, 224 flow [2023-11-29 02:48:58,754 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:48:58,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:48:58,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:48:58,767 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:48:58,768 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:48:58,768 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:48:58,770 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:48:58,773 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:48:58,776 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:48:58,780 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:48:58,780 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:48:58,783 INFO L175 Difference]: Start difference. First operand has 72 places, 61 transitions, 134 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:48:58,784 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 72 places, 68 transitions, 224 flow [2023-11-29 02:48:58,791 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 02:48:58,794 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-29 02:48:58,797 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:48:58,801 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -4 predicate places. [2023-11-29 02:48:58,801 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-29 02:48:58,802 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 34.666666666666664) internal successors, (104), 3 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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 02:48:58,802 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:48:58,802 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-29 02:48:58,807 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:59,003 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:59,003 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:48:59,004 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:48:59,004 INFO L85 PathProgramCache]: Analyzing trace with hash 13767, now seen corresponding path program 1 times [2023-11-29 02:48:59,005 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:48:59,005 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948156009] [2023-11-29 02:48:59,005 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:48:59,005 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 02:48:59,006 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:48:59,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:59,008 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:48:59,096 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:48:59,098 INFO L262 TraceCheckSpWp]: Trace formula consists of 53 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:48:59,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:48:59,110 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 02:48:59,121 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 02:48:59,121 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:48:59,122 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:48:59,122 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948156009] [2023-11-29 02:48:59,122 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948156009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:48:59,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:48:59,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:48:59,123 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [769730363] [2023-11-29 02:48:59,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:48:59,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:48:59,125 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:48:59,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:48:59,126 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:48:59,172 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:48:59,173 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 02:48:59,173 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:48:59,173 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:48:59,174 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:00,363 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-29 02:49:00,363 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:49:00,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13386 conditions, 7282 events. 4217/7282 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 419. Compared 55143 event pairs, 3179 based on Foata normal form. 1/6686 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-29 02:49:00,438 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-29 02:49:00,438 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-29 02:49:00,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:00,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:00,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:49:00,440 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:49:00,440 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:49:00,441 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:49:00,441 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:00,441 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:49:00,443 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:49:00,444 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:00,444 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:00,445 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:49:00,445 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-29 02:49:00,467 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:00,469 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-29 02:49:00,469 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:49:00,470 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -5 predicate places. [2023-11-29 02:49:00,470 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-29 02:49:00,471 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.666666666666664) internal successors, (107), 3 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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 02:49:00,471 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:00,471 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:49:00,474 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:00,671 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:00,672 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:00,672 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:00,673 INFO L85 PathProgramCache]: Analyzing trace with hash 410537684, now seen corresponding path program 1 times [2023-11-29 02:49:00,673 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:00,673 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1607148528] [2023-11-29 02:49:00,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:00,674 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 02:49:00,674 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:00,675 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:00,676 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:00,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:00,762 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:49:00,764 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:00,769 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 02:49:00,775 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:49:00,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:00,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:00,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1607148528] [2023-11-29 02:49:00,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1607148528] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:00,776 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:00,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:00,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401328084] [2023-11-29 02:49:00,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:00,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:00,778 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:00,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:00,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:00,809 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:49:00,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 02:49:00,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:00,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:49:00,810 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:02,014 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-29 02:49:02,014 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-29 02:49:02,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13358 conditions, 7245 events. 4221/7245 cut-off events. For 180/180 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 54850 event pairs, 3251 based on Foata normal form. 0/6658 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-29 02:49:02,073 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 36 selfloop transitions, 2 changer transitions 0/66 dead transitions. [2023-11-29 02:49:02,073 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 66 transitions, 220 flow [2023-11-29 02:49:02,073 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:02,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:02,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 141 transitions. [2023-11-29 02:49:02,075 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7230769230769231 [2023-11-29 02:49:02,075 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 141 transitions. [2023-11-29 02:49:02,075 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 141 transitions. [2023-11-29 02:49:02,076 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:02,076 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 141 transitions. [2023-11-29 02:49:02,077 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.0) internal successors, (141), 3 states have internal predecessors, (141), 0 states have call successors, (0), 0 states 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 02:49:02,078 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:02,079 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:02,079 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 141 transitions. [2023-11-29 02:49:02,079 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 66 transitions, 220 flow [2023-11-29 02:49:02,088 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 66 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:02,089 INFO L231 Difference]: Finished difference. Result has 66 places, 55 transitions, 122 flow [2023-11-29 02:49:02,089 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:49:02,090 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 02:49:02,091 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 55 transitions, 122 flow [2023-11-29 02:49:02,091 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 35.333333333333336) internal successors, (106), 3 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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 02:49:02,091 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:02,091 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:49:02,093 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:02,291 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:02,292 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:02,293 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:02,293 INFO L85 PathProgramCache]: Analyzing trace with hash 410537685, now seen corresponding path program 1 times [2023-11-29 02:49:02,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:02,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [445692694] [2023-11-29 02:49:02,294 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:02,294 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 02:49:02,294 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:02,295 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:02,296 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:02,413 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:02,415 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:49:02,416 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:02,425 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 02:49:02,438 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 02:49:02,438 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:02,439 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:02,439 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [445692694] [2023-11-29 02:49:02,439 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [445692694] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:02,439 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:02,439 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:02,439 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204431317] [2023-11-29 02:49:02,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:02,440 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:02,440 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:02,441 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:02,441 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:02,485 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:49:02,485 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 55 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 02:49:02,485 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:02,485 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:49:02,486 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:03,325 INFO L124 PetriNetUnfolderBase]: 4217/7224 cut-off events. [2023-11-29 02:49:03,325 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-29 02:49:03,340 INFO L83 FinitePrefix]: Finished finitePrefix Result has 13332 conditions, 7224 events. 4217/7224 cut-off events. For 184/184 co-relation queries the response was YES. Maximal size of possible extension queue 418. Compared 55190 event pairs, 3247 based on Foata normal form. 5/6650 useless extension candidates. Maximal degree in co-relation 13322. Up to 4384 conditions per place. [2023-11-29 02:49:03,380 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 35 selfloop transitions, 2 changer transitions 0/65 dead transitions. [2023-11-29 02:49:03,380 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 65 transitions, 216 flow [2023-11-29 02:49:03,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:03,381 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:03,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 143 transitions. [2023-11-29 02:49:03,382 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7333333333333333 [2023-11-29 02:49:03,382 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 143 transitions. [2023-11-29 02:49:03,382 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 143 transitions. [2023-11-29 02:49:03,383 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:03,383 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 143 transitions. [2023-11-29 02:49:03,384 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 47.666666666666664) internal successors, (143), 3 states have internal predecessors, (143), 0 states have call successors, (0), 0 states 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 02:49:03,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:03,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:03,386 INFO L175 Difference]: Start difference. First operand has 66 places, 55 transitions, 122 flow. Second operand 3 states and 143 transitions. [2023-11-29 02:49:03,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 65 transitions, 216 flow [2023-11-29 02:49:03,395 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 65 transitions, 212 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:03,396 INFO L231 Difference]: Finished difference. Result has 65 places, 54 transitions, 120 flow [2023-11-29 02:49:03,397 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:49:03,397 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -7 predicate places. [2023-11-29 02:49:03,398 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 54 transitions, 120 flow [2023-11-29 02:49:03,398 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.333333333333336) internal successors, (109), 3 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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 02:49:03,398 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:03,398 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 02:49:03,401 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:49:03,599 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:03,599 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P0Err0ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:03,600 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:03,600 INFO L85 PathProgramCache]: Analyzing trace with hash 410537873, now seen corresponding path program 1 times [2023-11-29 02:49:03,600 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:03,600 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1791602183] [2023-11-29 02:49:03,600 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:03,601 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 02:49:03,601 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:03,602 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:03,604 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:03,689 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:03,691 INFO L262 TraceCheckSpWp]: Trace formula consists of 72 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:49:03,693 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:03,704 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 02:49:03,704 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:03,704 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:03,705 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1791602183] [2023-11-29 02:49:03,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1791602183] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:03,705 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:03,705 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:49:03,705 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1040874533] [2023-11-29 02:49:03,705 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:03,706 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:03,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:03,707 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:03,707 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:03,707 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 65 [2023-11-29 02:49:03,708 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:49:03,708 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:03,708 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 65 [2023-11-29 02:49:03,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:04,496 INFO L124 PetriNetUnfolderBase]: 3311/5494 cut-off events. [2023-11-29 02:49:04,497 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-29 02:49:04,510 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10319 conditions, 5494 events. 3311/5494 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 322. Compared 40041 event pairs, 593 based on Foata normal form. 0/5436 useless extension candidates. Maximal degree in co-relation 10309. Up to 3661 conditions per place. [2023-11-29 02:49:04,539 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 41 selfloop transitions, 2 changer transitions 2/73 dead transitions. [2023-11-29 02:49:04,539 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 73 transitions, 258 flow [2023-11-29 02:49:04,540 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:04,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:04,541 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 154 transitions. [2023-11-29 02:49:04,541 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7897435897435897 [2023-11-29 02:49:04,541 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 154 transitions. [2023-11-29 02:49:04,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 154 transitions. [2023-11-29 02:49:04,542 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:04,542 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 154 transitions. [2023-11-29 02:49:04,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 51.333333333333336) internal successors, (154), 3 states have internal predecessors, (154), 0 states have call successors, (0), 0 states 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 02:49:04,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:04,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:04,544 INFO L175 Difference]: Start difference. First operand has 65 places, 54 transitions, 120 flow. Second operand 3 states and 154 transitions. [2023-11-29 02:49:04,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 73 transitions, 258 flow [2023-11-29 02:49:04,546 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 73 transitions, 250 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:04,547 INFO L231 Difference]: Finished difference. Result has 64 places, 52 transitions, 116 flow [2023-11-29 02:49:04,548 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=116, PETRI_PLACES=64, PETRI_TRANSITIONS=52} [2023-11-29 02:49:04,548 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -8 predicate places. [2023-11-29 02:49:04,548 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 52 transitions, 116 flow [2023-11-29 02:49:04,549 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:49:04,549 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:04,549 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:04,552 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:04,749 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:04,750 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:04,750 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:04,750 INFO L85 PathProgramCache]: Analyzing trace with hash -1738285509, now seen corresponding path program 1 times [2023-11-29 02:49:04,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:04,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [483100098] [2023-11-29 02:49:04,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:04,751 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 02:49:04,751 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:04,752 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:04,754 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:04,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:04,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:49:04,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:04,872 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 02:49:04,879 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 02:49:04,880 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:04,880 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:04,880 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [483100098] [2023-11-29 02:49:04,880 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [483100098] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:04,881 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:04,881 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:04,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1694966855] [2023-11-29 02:49:04,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:04,882 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:04,882 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:04,883 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:04,883 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:04,918 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:49:04,919 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 02:49:04,919 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:04,919 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:49:04,920 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:05,738 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-29 02:49:05,739 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-29 02:49:05,755 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9645 conditions, 5209 events. 2920/5209 cut-off events. For 281/281 co-relation queries the response was YES. Maximal size of possible extension queue 303. Compared 38677 event pairs, 1356 based on Foata normal form. 0/5019 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-29 02:49:05,792 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-29 02:49:05,792 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 206 flow [2023-11-29 02:49:05,793 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:05,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:05,793 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 02:49:05,794 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 02:49:05,794 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 02:49:05,794 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 02:49:05,794 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:05,795 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 02:49:05,796 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:49:05,797 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:05,798 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:05,798 INFO L175 Difference]: Start difference. First operand has 64 places, 52 transitions, 116 flow. Second operand 3 states and 138 transitions. [2023-11-29 02:49:05,798 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 206 flow [2023-11-29 02:49:05,799 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:05,801 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-29 02:49:05,801 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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 02:49:05,803 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 02:49:05,803 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-29 02:49:05,803 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.0) internal successors, (108), 3 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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 02:49:05,804 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:05,804 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:05,807 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:06,006 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:06,007 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:06,007 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:06,008 INFO L85 PathProgramCache]: Analyzing trace with hash -1738285508, now seen corresponding path program 1 times [2023-11-29 02:49:06,008 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:06,008 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [519739843] [2023-11-29 02:49:06,008 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:06,009 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 02:49:06,009 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:06,010 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:06,011 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:06,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:06,118 INFO L262 TraceCheckSpWp]: Trace formula consists of 96 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:49:06,120 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:06,132 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 02:49:06,144 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 02:49:06,145 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:06,145 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:06,145 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [519739843] [2023-11-29 02:49:06,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [519739843] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:06,146 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:06,146 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:06,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1869798154] [2023-11-29 02:49:06,146 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:06,147 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:06,147 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:06,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:06,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:06,194 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:49:06,195 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:49:06,195 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:06,195 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:49:06,196 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:07,061 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-29 02:49:07,061 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:49:07,075 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9409 conditions, 5128 events. 2903/5128 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 37767 event pairs, 1884 based on Foata normal form. 12/4954 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-29 02:49:07,100 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-29 02:49:07,100 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-29 02:49:07,100 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:07,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:07,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 02:49:07,102 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 02:49:07,102 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 02:49:07,102 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 02:49:07,103 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:07,103 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 02:49:07,104 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 02:49:07,105 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:07,106 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:07,106 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 140 transitions. [2023-11-29 02:49:07,106 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-29 02:49:07,109 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:07,110 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-29 02:49:07,110 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=112, PETRI_PLACES=61, PETRI_TRANSITIONS=50} [2023-11-29 02:49:07,111 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -11 predicate places. [2023-11-29 02:49:07,111 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-29 02:49:07,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.0) internal successors, (111), 3 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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 02:49:07,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:07,112 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:07,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:07,312 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:07,313 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:07,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:07,314 INFO L85 PathProgramCache]: Analyzing trace with hash -842474614, now seen corresponding path program 1 times [2023-11-29 02:49:07,314 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:07,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [417780772] [2023-11-29 02:49:07,315 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:07,315 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 02:49:07,315 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:07,316 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:07,318 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:07,428 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:07,431 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:49:07,433 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:07,441 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 02:49:07,448 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 02:49:07,448 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:07,448 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:07,449 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [417780772] [2023-11-29 02:49:07,449 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [417780772] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:07,449 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:07,449 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:07,450 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1349926381] [2023-11-29 02:49:07,450 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:07,451 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:07,451 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:07,451 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:07,452 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:07,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 65 [2023-11-29 02:49:07,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 02:49:07,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:07,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 65 [2023-11-29 02:49:07,489 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:08,190 INFO L124 PetriNetUnfolderBase]: 2978/5219 cut-off events. [2023-11-29 02:49:08,190 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-29 02:49:08,200 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9611 conditions, 5219 events. 2978/5219 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 302. Compared 38098 event pairs, 920 based on Foata normal form. 0/5109 useless extension candidates. Maximal degree in co-relation 9601. Up to 3426 conditions per place. [2023-11-29 02:49:08,217 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 33 selfloop transitions, 2 changer transitions 0/59 dead transitions. [2023-11-29 02:49:08,217 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 59 transitions, 200 flow [2023-11-29 02:49:08,218 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:08,218 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:08,218 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2023-11-29 02:49:08,219 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7076923076923077 [2023-11-29 02:49:08,219 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 138 transitions. [2023-11-29 02:49:08,219 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 138 transitions. [2023-11-29 02:49:08,219 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:08,219 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 138 transitions. [2023-11-29 02:49:08,220 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.0) internal successors, (138), 3 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:49:08,221 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:08,222 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:08,222 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 3 states and 138 transitions. [2023-11-29 02:49:08,222 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 59 transitions, 200 flow [2023-11-29 02:49:08,224 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 59 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:08,225 INFO L231 Difference]: Finished difference. Result has 60 places, 49 transitions, 110 flow [2023-11-29 02:49:08,226 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, 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=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=110, PETRI_PLACES=60, PETRI_TRANSITIONS=49} [2023-11-29 02:49:08,226 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -12 predicate places. [2023-11-29 02:49:08,227 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 49 transitions, 110 flow [2023-11-29 02:49:08,227 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 36.666666666666664) internal successors, (110), 3 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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 02:49:08,227 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:08,227 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:08,231 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:08,428 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:08,428 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:08,429 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:08,429 INFO L85 PathProgramCache]: Analyzing trace with hash -842474613, now seen corresponding path program 1 times [2023-11-29 02:49:08,429 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:08,429 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [626188828] [2023-11-29 02:49:08,430 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:08,430 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 02:49:08,430 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:08,431 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:08,432 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:08,542 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:08,546 INFO L262 TraceCheckSpWp]: Trace formula consists of 119 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:49:08,548 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:08,560 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 02:49:08,572 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 02:49:08,572 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:08,572 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:08,572 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [626188828] [2023-11-29 02:49:08,573 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [626188828] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:08,573 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:08,573 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:49:08,573 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1504769897] [2023-11-29 02:49:08,573 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:08,574 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:49:08,574 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:08,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:49:08,575 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:49:08,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:49:08,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 49 transitions, 110 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 02:49:08,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:08,620 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:49:08,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:09,268 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-29 02:49:09,268 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-29 02:49:09,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9413 conditions, 5108 events. 2903/5108 cut-off events. For 168/168 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37470 event pairs, 920 based on Foata normal form. 36/5046 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-29 02:49:09,299 INFO L140 encePairwiseOnDemand]: 62/65 looper letters, 32 selfloop transitions, 2 changer transitions 0/58 dead transitions. [2023-11-29 02:49:09,299 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 58 transitions, 196 flow [2023-11-29 02:49:09,299 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:49:09,299 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 02:49:09,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 140 transitions. [2023-11-29 02:49:09,300 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.717948717948718 [2023-11-29 02:49:09,300 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 140 transitions. [2023-11-29 02:49:09,300 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 140 transitions. [2023-11-29 02:49:09,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:09,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 140 transitions. [2023-11-29 02:49:09,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 46.666666666666664) internal successors, (140), 3 states have internal predecessors, (140), 0 states have call successors, (0), 0 states 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 02:49:09,302 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:09,302 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 65.0) internal successors, (260), 4 states have internal predecessors, (260), 0 states have call successors, (0), 0 states 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 02:49:09,303 INFO L175 Difference]: Start difference. First operand has 60 places, 49 transitions, 110 flow. Second operand 3 states and 140 transitions. [2023-11-29 02:49:09,303 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 58 transitions, 196 flow [2023-11-29 02:49:09,305 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 58 transitions, 192 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:09,306 INFO L231 Difference]: Finished difference. Result has 59 places, 48 transitions, 108 flow [2023-11-29 02:49:09,306 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=46, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=108, PETRI_PLACES=59, PETRI_TRANSITIONS=48} [2023-11-29 02:49:09,307 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -13 predicate places. [2023-11-29 02:49:09,308 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 48 transitions, 108 flow [2023-11-29 02:49:09,308 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 02:49:09,308 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:09,308 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 02:49:09,311 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:09,509 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:09,509 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:09,509 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:09,510 INFO L85 PathProgramCache]: Analyzing trace with hash -632219965, now seen corresponding path program 1 times [2023-11-29 02:49:09,510 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:09,510 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1515823498] [2023-11-29 02:49:09,510 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:09,510 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 02:49:09,511 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:09,512 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:09,515 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:09,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:09,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 02:49:09,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:09,726 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 02:49:09,726 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:09,726 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:09,727 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1515823498] [2023-11-29 02:49:09,727 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1515823498] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:09,727 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:09,727 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:49:09,728 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1537526798] [2023-11-29 02:49:09,728 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:09,728 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:49:09,729 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:09,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:49:09,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:49:09,745 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:49:09,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 48 transitions, 108 flow. Second operand has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:49:09,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:09,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:49:09,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:11,350 INFO L124 PetriNetUnfolderBase]: 9971/15461 cut-off events. [2023-11-29 02:49:11,350 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-29 02:49:11,385 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29686 conditions, 15461 events. 9971/15461 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 835. Compared 111974 event pairs, 1033 based on Foata normal form. 400/15783 useless extension candidates. Maximal degree in co-relation 29676. Up to 8761 conditions per place. [2023-11-29 02:49:11,437 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 54 selfloop transitions, 6 changer transitions 1/80 dead transitions. [2023-11-29 02:49:11,437 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 80 transitions, 302 flow [2023-11-29 02:49:11,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:49:11,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 02:49:11,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 187 transitions. [2023-11-29 02:49:11,439 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7192307692307692 [2023-11-29 02:49:11,439 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 187 transitions. [2023-11-29 02:49:11,439 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 187 transitions. [2023-11-29 02:49:11,440 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:11,440 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 187 transitions. [2023-11-29 02:49:11,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 46.75) internal successors, (187), 4 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 02:49:11,441 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 02:49:11,442 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 65.0) internal successors, (325), 5 states have internal predecessors, (325), 0 states have call successors, (0), 0 states 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 02:49:11,442 INFO L175 Difference]: Start difference. First operand has 59 places, 48 transitions, 108 flow. Second operand 4 states and 187 transitions. [2023-11-29 02:49:11,442 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 80 transitions, 302 flow [2023-11-29 02:49:11,450 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 60 places, 80 transitions, 296 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:11,451 INFO L231 Difference]: Finished difference. Result has 62 places, 52 transitions, 146 flow [2023-11-29 02:49:11,451 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=104, PETRI_DIFFERENCE_MINUEND_PLACES=57, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=146, PETRI_PLACES=62, PETRI_TRANSITIONS=52} [2023-11-29 02:49:11,452 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -10 predicate places. [2023-11-29 02:49:11,452 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 52 transitions, 146 flow [2023-11-29 02:49:11,452 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 34.5) internal successors, (138), 4 states have internal predecessors, (138), 0 states have call successors, (0), 0 states 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 02:49:11,453 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:11,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] [2023-11-29 02:49:11,459 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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)] Forceful destruction successful, exit code 0 [2023-11-29 02:49:11,653 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:11,653 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:11,654 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:11,654 INFO L85 PathProgramCache]: Analyzing trace with hash -1792567432, now seen corresponding path program 1 times [2023-11-29 02:49:11,654 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:11,654 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1041408976] [2023-11-29 02:49:11,655 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:11,655 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 02:49:11,655 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:11,656 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:11,657 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:11,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:11,790 INFO L262 TraceCheckSpWp]: Trace formula consists of 173 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 02:49:11,792 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:11,866 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 02:49:11,866 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:11,866 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:11,866 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1041408976] [2023-11-29 02:49:11,866 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1041408976] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:11,866 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:11,867 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:49:11,867 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1797888845] [2023-11-29 02:49:11,867 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:11,867 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:49:11,868 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:11,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:49:11,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:49:11,878 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:49:11,878 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 52 transitions, 146 flow. Second operand has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 02:49:11,878 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:11,878 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:49:11,878 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:13,128 INFO L124 PetriNetUnfolderBase]: 7427/11561 cut-off events. [2023-11-29 02:49:13,128 INFO L125 PetriNetUnfolderBase]: For 2544/2544 co-relation queries the response was YES. [2023-11-29 02:49:13,157 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25489 conditions, 11561 events. 7427/11561 cut-off events. For 2544/2544 co-relation queries the response was YES. Maximal size of possible extension queue 593. Compared 79296 event pairs, 451 based on Foata normal form. 364/11853 useless extension candidates. Maximal degree in co-relation 25476. Up to 5521 conditions per place. [2023-11-29 02:49:13,194 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 69 selfloop transitions, 10 changer transitions 1/99 dead transitions. [2023-11-29 02:49:13,194 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 99 transitions, 429 flow [2023-11-29 02:49:13,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:49:13,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:49:13,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 237 transitions. [2023-11-29 02:49:13,196 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7292307692307692 [2023-11-29 02:49:13,196 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 237 transitions. [2023-11-29 02:49:13,196 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 237 transitions. [2023-11-29 02:49:13,197 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:13,197 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 237 transitions. [2023-11-29 02:49:13,198 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 47.4) internal successors, (237), 5 states have internal predecessors, (237), 0 states have call successors, (0), 0 states 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 02:49:13,199 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:13,199 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:13,199 INFO L175 Difference]: Start difference. First operand has 62 places, 52 transitions, 146 flow. Second operand 5 states and 237 transitions. [2023-11-29 02:49:13,199 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 99 transitions, 429 flow [2023-11-29 02:49:13,202 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 99 transitions, 418 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-29 02:49:13,204 INFO L231 Difference]: Finished difference. Result has 66 places, 56 transitions, 198 flow [2023-11-29 02:49:13,204 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=137, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=198, PETRI_PLACES=66, PETRI_TRANSITIONS=56} [2023-11-29 02:49:13,205 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -6 predicate places. [2023-11-29 02:49:13,205 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 56 transitions, 198 flow [2023-11-29 02:49:13,206 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 34.4) internal successors, (172), 5 states have internal predecessors, (172), 0 states have call successors, (0), 0 states 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 02:49:13,206 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:13,206 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 02:49:13,210 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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)] Ended with exit code 0 [2023-11-29 02:49:13,406 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:13,407 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:13,407 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:13,407 INFO L85 PathProgramCache]: Analyzing trace with hash 1501344810, now seen corresponding path program 1 times [2023-11-29 02:49:13,407 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:13,408 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1353676978] [2023-11-29 02:49:13,408 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:13,408 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 02:49:13,408 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:13,409 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:13,410 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:13,527 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:13,532 INFO L262 TraceCheckSpWp]: Trace formula consists of 183 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:49:13,534 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:13,607 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 02:49:13,607 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:13,608 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:13,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1353676978] [2023-11-29 02:49:13,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1353676978] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:13,608 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:13,608 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:49:13,609 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1458860632] [2023-11-29 02:49:13,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:13,609 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:49:13,609 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:13,610 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:49:13,610 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:49:13,620 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:49:13,620 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 56 transitions, 198 flow. Second operand has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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 02:49:13,620 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:13,621 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:49:13,621 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:14,608 INFO L124 PetriNetUnfolderBase]: 4491/6877 cut-off events. [2023-11-29 02:49:14,608 INFO L125 PetriNetUnfolderBase]: For 4686/4686 co-relation queries the response was YES. [2023-11-29 02:49:14,623 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17111 conditions, 6877 events. 4491/6877 cut-off events. For 4686/4686 co-relation queries the response was YES. Maximal size of possible extension queue 250. Compared 41011 event pairs, 289 based on Foata normal form. 244/7049 useless extension candidates. Maximal degree in co-relation 17096. Up to 1969 conditions per place. [2023-11-29 02:49:14,646 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 82 selfloop transitions, 14 changer transitions 1/116 dead transitions. [2023-11-29 02:49:14,647 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 116 transitions, 560 flow [2023-11-29 02:49:14,647 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:49:14,647 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:49:14,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 285 transitions. [2023-11-29 02:49:14,649 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7307692307692307 [2023-11-29 02:49:14,649 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 285 transitions. [2023-11-29 02:49:14,649 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 285 transitions. [2023-11-29 02:49:14,650 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:14,650 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 285 transitions. [2023-11-29 02:49:14,651 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 47.5) internal successors, (285), 6 states have internal predecessors, (285), 0 states have call successors, (0), 0 states 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 02:49:14,653 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:49:14,653 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:49:14,653 INFO L175 Difference]: Start difference. First operand has 66 places, 56 transitions, 198 flow. Second operand 6 states and 285 transitions. [2023-11-29 02:49:14,653 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 116 transitions, 560 flow [2023-11-29 02:49:14,671 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 116 transitions, 530 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-29 02:49:14,673 INFO L231 Difference]: Finished difference. Result has 69 places, 60 transitions, 248 flow [2023-11-29 02:49:14,673 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=171, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=248, PETRI_PLACES=69, PETRI_TRANSITIONS=60} [2023-11-29 02:49:14,674 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-29 02:49:14,674 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 60 transitions, 248 flow [2023-11-29 02:49:14,674 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 34.166666666666664) internal successors, (205), 6 states have internal predecessors, (205), 0 states have call successors, (0), 0 states 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 02:49:14,674 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:14,675 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 02:49:14,678 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:14,875 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:14,875 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:14,876 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:14,876 INFO L85 PathProgramCache]: Analyzing trace with hash -968935618, now seen corresponding path program 1 times [2023-11-29 02:49:14,876 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:14,876 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594795366] [2023-11-29 02:49:14,877 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:14,877 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 02:49:14,877 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:14,878 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:14,879 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:15,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:15,020 INFO L262 TraceCheckSpWp]: Trace formula consists of 193 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:49:15,023 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:15,117 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 02:49:15,117 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:15,118 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:15,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594795366] [2023-11-29 02:49:15,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594795366] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:15,118 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:15,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:49:15,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [717500344] [2023-11-29 02:49:15,119 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:15,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:49:15,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:15,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:49:15,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:49:15,132 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 65 [2023-11-29 02:49:15,132 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 60 transitions, 248 flow. Second operand has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 02:49:15,132 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:15,133 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 65 [2023-11-29 02:49:15,133 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:16,111 INFO L124 PetriNetUnfolderBase]: 2927/4285 cut-off events. [2023-11-29 02:49:16,112 INFO L125 PetriNetUnfolderBase]: For 4826/4826 co-relation queries the response was YES. [2023-11-29 02:49:16,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11808 conditions, 4285 events. 2927/4285 cut-off events. For 4826/4826 co-relation queries the response was YES. Maximal size of possible extension queue 211. Compared 22560 event pairs, 231 based on Foata normal form. 96/4309 useless extension candidates. Maximal degree in co-relation 11792. Up to 1316 conditions per place. [2023-11-29 02:49:16,135 INFO L140 encePairwiseOnDemand]: 58/65 looper letters, 73 selfloop transitions, 18 changer transitions 1/111 dead transitions. [2023-11-29 02:49:16,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 111 transitions, 550 flow [2023-11-29 02:49:16,136 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:49:16,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:49:16,137 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 311 transitions. [2023-11-29 02:49:16,137 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6835164835164835 [2023-11-29 02:49:16,138 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 311 transitions. [2023-11-29 02:49:16,138 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 311 transitions. [2023-11-29 02:49:16,138 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:16,138 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 311 transitions. [2023-11-29 02:49:16,139 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 44.42857142857143) internal successors, (311), 7 states have internal predecessors, (311), 0 states have call successors, (0), 0 states 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 02:49:16,140 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:49:16,141 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:49:16,141 INFO L175 Difference]: Start difference. First operand has 69 places, 60 transitions, 248 flow. Second operand 7 states and 311 transitions. [2023-11-29 02:49:16,141 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 111 transitions, 550 flow [2023-11-29 02:49:16,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 111 transitions, 504 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-29 02:49:16,172 INFO L231 Difference]: Finished difference. Result has 72 places, 60 transitions, 258 flow [2023-11-29 02:49:16,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=205, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=258, PETRI_PLACES=72, PETRI_TRANSITIONS=60} [2023-11-29 02:49:16,173 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 0 predicate places. [2023-11-29 02:49:16,173 INFO L495 AbstractCegarLoop]: Abstraction has has 72 places, 60 transitions, 258 flow [2023-11-29 02:49:16,173 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 34.0) internal successors, (238), 7 states have internal predecessors, (238), 0 states have call successors, (0), 0 states 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 02:49:16,174 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:16,174 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] [2023-11-29 02:49:16,177 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:16,374 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:16,374 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:16,375 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:16,375 INFO L85 PathProgramCache]: Analyzing trace with hash 1917036690, now seen corresponding path program 1 times [2023-11-29 02:49:16,375 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:16,375 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [420011209] [2023-11-29 02:49:16,375 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:16,376 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-29 02:49:16,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:16,377 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:16,378 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:16,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:16,640 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 02:49:16,644 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:17,456 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t1412~0#1.base_47| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1409~0#1.base_51| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1410~0#1.base_65| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t1411~0#1.base_55| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1409~0#1.base_51| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t1410~0#1.base_65| (_ bv1 1)))) (and (= (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1409~0#1.base_51| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1410~0#1.base_65| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1411~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t1412~0#1.base_47| (_ bv0 1)) |c_#valid|) (= (select .cse0 |v_ULTIMATE.start_main_~#t1410~0#1.base_65|) (_ bv0 1)) (= (_ bv0 1) (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t1409~0#1.base_51|)) (= (select .cse1 |v_ULTIMATE.start_main_~#t1411~0#1.base_55|) (_ bv0 1)) (= (select (store .cse1 |v_ULTIMATE.start_main_~#t1411~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t1412~0#1.base_47|) (_ bv0 1)))))) is different from true [2023-11-29 02:49:17,457 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 02:49:17,458 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:17,458 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:17,458 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [420011209] [2023-11-29 02:49:17,458 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [420011209] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:17,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:17,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:49:17,459 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1354518981] [2023-11-29 02:49:17,459 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:17,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:49:17,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:17,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:49:17,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-29 02:49:17,572 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 65 [2023-11-29 02:49:17,573 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 72 places, 60 transitions, 258 flow. Second operand has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 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 02:49:17,573 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:17,573 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 65 [2023-11-29 02:49:17,573 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:18,292 INFO L124 PetriNetUnfolderBase]: 1588/2728 cut-off events. [2023-11-29 02:49:18,293 INFO L125 PetriNetUnfolderBase]: For 1080/1165 co-relation queries the response was YES. [2023-11-29 02:49:18,301 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6169 conditions, 2728 events. 1588/2728 cut-off events. For 1080/1165 co-relation queries the response was YES. Maximal size of possible extension queue 156. Compared 16432 event pairs, 204 based on Foata normal form. 16/2582 useless extension candidates. Maximal degree in co-relation 6151. Up to 1876 conditions per place. [2023-11-29 02:49:18,311 INFO L140 encePairwiseOnDemand]: 55/65 looper letters, 43 selfloop transitions, 9 changer transitions 0/83 dead transitions. [2023-11-29 02:49:18,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 78 places, 83 transitions, 408 flow [2023-11-29 02:49:18,311 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:49:18,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 02:49:18,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 214 transitions. [2023-11-29 02:49:18,313 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4703296703296703 [2023-11-29 02:49:18,313 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 214 transitions. [2023-11-29 02:49:18,313 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 214 transitions. [2023-11-29 02:49:18,313 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:18,313 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 214 transitions. [2023-11-29 02:49:18,314 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 30.571428571428573) internal successors, (214), 7 states have internal predecessors, (214), 0 states have call successors, (0), 0 states 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 02:49:18,315 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:49:18,316 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 65.0) internal successors, (520), 8 states have internal predecessors, (520), 0 states have call successors, (0), 0 states 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 02:49:18,316 INFO L175 Difference]: Start difference. First operand has 72 places, 60 transitions, 258 flow. Second operand 7 states and 214 transitions. [2023-11-29 02:49:18,316 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 78 places, 83 transitions, 408 flow [2023-11-29 02:49:18,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 83 transitions, 312 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-29 02:49:18,325 INFO L231 Difference]: Finished difference. Result has 69 places, 64 transitions, 203 flow [2023-11-29 02:49:18,325 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=162, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=60, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=203, PETRI_PLACES=69, PETRI_TRANSITIONS=64} [2023-11-29 02:49:18,325 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, -3 predicate places. [2023-11-29 02:49:18,325 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 64 transitions, 203 flow [2023-11-29 02:49:18,325 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 26.428571428571427) internal successors, (185), 7 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 02:49:18,326 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:18,326 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] [2023-11-29 02:49:18,329 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:18,526 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:18,526 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:18,527 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:18,527 INFO L85 PathProgramCache]: Analyzing trace with hash 1917037998, now seen corresponding path program 1 times [2023-11-29 02:49:18,527 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:18,527 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [473315291] [2023-11-29 02:49:18,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:49:18,528 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 02:49:18,528 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:18,529 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:18,530 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:18,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:49:18,668 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-29 02:49:18,671 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:19,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 02:49:19,250 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:19,251 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:19,251 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [473315291] [2023-11-29 02:49:19,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [473315291] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:19,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:19,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:49:19,252 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [218048148] [2023-11-29 02:49:19,252 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:19,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 02:49:19,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:19,253 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 02:49:19,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-29 02:49:19,271 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 65 [2023-11-29 02:49:19,272 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 64 transitions, 203 flow. Second operand has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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 02:49:19,272 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:19,272 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 65 [2023-11-29 02:49:19,272 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:20,023 INFO L124 PetriNetUnfolderBase]: 2294/3759 cut-off events. [2023-11-29 02:49:20,023 INFO L125 PetriNetUnfolderBase]: For 1146/1376 co-relation queries the response was YES. [2023-11-29 02:49:20,033 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9150 conditions, 3759 events. 2294/3759 cut-off events. For 1146/1376 co-relation queries the response was YES. Maximal size of possible extension queue 209. Compared 22652 event pairs, 539 based on Foata normal form. 16/3574 useless extension candidates. Maximal degree in co-relation 9137. Up to 1499 conditions per place. [2023-11-29 02:49:20,046 INFO L140 encePairwiseOnDemand]: 56/65 looper letters, 78 selfloop transitions, 9 changer transitions 0/122 dead transitions. [2023-11-29 02:49:20,047 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 122 transitions, 578 flow [2023-11-29 02:49:20,047 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:49:20,047 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-29 02:49:20,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 395 transitions. [2023-11-29 02:49:20,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6752136752136753 [2023-11-29 02:49:20,049 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 395 transitions. [2023-11-29 02:49:20,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 395 transitions. [2023-11-29 02:49:20,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:20,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 395 transitions. [2023-11-29 02:49:20,051 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 43.888888888888886) internal successors, (395), 9 states have internal predecessors, (395), 0 states have call successors, (0), 0 states 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 02:49:20,052 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:49:20,053 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 65.0) internal successors, (650), 10 states have internal predecessors, (650), 0 states have call successors, (0), 0 states 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 02:49:20,053 INFO L175 Difference]: Start difference. First operand has 69 places, 64 transitions, 203 flow. Second operand 9 states and 395 transitions. [2023-11-29 02:49:20,053 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 122 transitions, 578 flow [2023-11-29 02:49:20,055 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 122 transitions, 548 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-29 02:49:20,056 INFO L231 Difference]: Finished difference. Result has 76 places, 69 transitions, 240 flow [2023-11-29 02:49:20,057 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=190, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=64, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=240, PETRI_PLACES=76, PETRI_TRANSITIONS=69} [2023-11-29 02:49:20,057 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 4 predicate places. [2023-11-29 02:49:20,057 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 69 transitions, 240 flow [2023-11-29 02:49:20,057 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 37.0) internal successors, (370), 10 states have internal predecessors, (370), 0 states have call successors, (0), 0 states 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 02:49:20,058 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:20,058 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] [2023-11-29 02:49:20,062 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:20,258 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:20,258 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:20,259 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:20,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1705246164, now seen corresponding path program 2 times [2023-11-29 02:49:20,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:20,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [51955548] [2023-11-29 02:49:20,259 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:49:20,260 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 02:49:20,260 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:20,261 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:20,262 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:20,396 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 02:49:20,396 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:49:20,402 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 02:49:20,403 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:20,459 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 02:49:20,459 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:20,459 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:20,459 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [51955548] [2023-11-29 02:49:20,459 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [51955548] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:20,459 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:20,459 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:49:20,460 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2098973640] [2023-11-29 02:49:20,460 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:20,460 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:49:20,460 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:20,461 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:49:20,461 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:49:20,472 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 02:49:20,472 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 69 transitions, 240 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 02:49:20,472 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:20,472 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 02:49:20,472 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:21,466 INFO L124 PetriNetUnfolderBase]: 4988/8003 cut-off events. [2023-11-29 02:49:21,466 INFO L125 PetriNetUnfolderBase]: For 3695/3975 co-relation queries the response was YES. [2023-11-29 02:49:21,495 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20280 conditions, 8003 events. 4988/8003 cut-off events. For 3695/3975 co-relation queries the response was YES. Maximal size of possible extension queue 492. Compared 52701 event pairs, 998 based on Foata normal form. 16/7583 useless extension candidates. Maximal degree in co-relation 20263. Up to 3160 conditions per place. [2023-11-29 02:49:21,526 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 70 selfloop transitions, 8 changer transitions 0/111 dead transitions. [2023-11-29 02:49:21,526 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 81 places, 111 transitions, 561 flow [2023-11-29 02:49:21,527 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:49:21,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 02:49:21,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 259 transitions. [2023-11-29 02:49:21,528 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6641025641025641 [2023-11-29 02:49:21,528 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 259 transitions. [2023-11-29 02:49:21,528 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 259 transitions. [2023-11-29 02:49:21,529 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:21,529 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 259 transitions. [2023-11-29 02:49:21,530 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 43.166666666666664) internal successors, (259), 6 states have internal predecessors, (259), 0 states have call successors, (0), 0 states 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 02:49:21,531 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:49:21,531 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 65.0) internal successors, (455), 7 states have internal predecessors, (455), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:49:21,531 INFO L175 Difference]: Start difference. First operand has 76 places, 69 transitions, 240 flow. Second operand 6 states and 259 transitions. [2023-11-29 02:49:21,531 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 81 places, 111 transitions, 561 flow [2023-11-29 02:49:21,536 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 111 transitions, 548 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 02:49:21,538 INFO L231 Difference]: Finished difference. Result has 82 places, 76 transitions, 317 flow [2023-11-29 02:49:21,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=234, 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=317, PETRI_PLACES=82, PETRI_TRANSITIONS=76} [2023-11-29 02:49:21,539 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 10 predicate places. [2023-11-29 02:49:21,539 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 76 transitions, 317 flow [2023-11-29 02:49:21,539 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 02:49:21,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:21,539 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] [2023-11-29 02:49:21,543 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:21,740 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:21,740 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:21,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:21,741 INFO L85 PathProgramCache]: Analyzing trace with hash 1643247334, now seen corresponding path program 3 times [2023-11-29 02:49:21,741 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:21,741 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1101276670] [2023-11-29 02:49:21,741 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 02:49:21,741 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 02:49:21,742 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:21,743 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:21,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:21,876 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 02:49:21,876 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:49:21,883 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:49:21,884 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:21,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 02:49:21,918 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:21,919 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:21,919 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1101276670] [2023-11-29 02:49:21,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1101276670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:21,919 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:21,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:49:21,919 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1384998803] [2023-11-29 02:49:21,919 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:21,920 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:49:21,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:21,921 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:49:21,921 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:49:21,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 02:49:21,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 76 transitions, 317 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 02:49:21,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:21,928 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 02:49:21,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:23,607 INFO L124 PetriNetUnfolderBase]: 9409/15274 cut-off events. [2023-11-29 02:49:23,608 INFO L125 PetriNetUnfolderBase]: For 6730/7420 co-relation queries the response was YES. [2023-11-29 02:49:23,676 INFO L83 FinitePrefix]: Finished finitePrefix Result has 38835 conditions, 15274 events. 9409/15274 cut-off events. For 6730/7420 co-relation queries the response was YES. Maximal size of possible extension queue 925. Compared 114162 event pairs, 4265 based on Foata normal form. 33/14321 useless extension candidates. Maximal degree in co-relation 38815. Up to 6577 conditions per place. [2023-11-29 02:49:23,732 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 73 selfloop transitions, 14 changer transitions 0/121 dead transitions. [2023-11-29 02:49:23,732 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 121 transitions, 711 flow [2023-11-29 02:49:23,733 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:49:23,733 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:49:23,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 223 transitions. [2023-11-29 02:49:23,734 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6861538461538461 [2023-11-29 02:49:23,734 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 223 transitions. [2023-11-29 02:49:23,734 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 223 transitions. [2023-11-29 02:49:23,735 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:23,735 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 223 transitions. [2023-11-29 02:49:23,736 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 44.6) internal successors, (223), 5 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 02:49:23,737 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:23,737 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:23,737 INFO L175 Difference]: Start difference. First operand has 82 places, 76 transitions, 317 flow. Second operand 5 states and 223 transitions. [2023-11-29 02:49:23,737 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 121 transitions, 711 flow [2023-11-29 02:49:23,756 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 121 transitions, 710 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:49:23,758 INFO L231 Difference]: Finished difference. Result has 88 places, 89 transitions, 504 flow [2023-11-29 02:49:23,758 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=316, 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=5, PETRI_FLOW=504, PETRI_PLACES=88, PETRI_TRANSITIONS=89} [2023-11-29 02:49:23,759 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 16 predicate places. [2023-11-29 02:49:23,759 INFO L495 AbstractCegarLoop]: Abstraction has has 88 places, 89 transitions, 504 flow [2023-11-29 02:49:23,759 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 02:49:23,759 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:23,759 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] [2023-11-29 02:49:23,764 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:23,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:23,960 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:23,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:23,960 INFO L85 PathProgramCache]: Analyzing trace with hash 31849266, now seen corresponding path program 4 times [2023-11-29 02:49:23,961 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:23,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1061868701] [2023-11-29 02:49:23,961 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 02:49:23,961 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 02:49:23,961 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:23,962 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:23,963 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:24,101 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 02:49:24,102 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:49:24,108 INFO L262 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 02:49:24,109 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:49:24,141 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 02:49:24,141 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:49:24,141 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 02:49:24,142 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1061868701] [2023-11-29 02:49:24,142 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1061868701] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:49:24,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:49:24,142 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:49:24,142 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [894909450] [2023-11-29 02:49:24,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:49:24,142 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:49:24,143 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 02:49:24,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:49:24,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:49:24,155 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 65 [2023-11-29 02:49:24,155 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 88 places, 89 transitions, 504 flow. Second operand has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 02:49:24,155 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 02:49:24,155 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 65 [2023-11-29 02:49:24,155 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 02:49:27,610 INFO L124 PetriNetUnfolderBase]: 18256/29275 cut-off events. [2023-11-29 02:49:27,610 INFO L125 PetriNetUnfolderBase]: For 17419/18574 co-relation queries the response was YES. [2023-11-29 02:49:27,780 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76180 conditions, 29275 events. 18256/29275 cut-off events. For 17419/18574 co-relation queries the response was YES. Maximal size of possible extension queue 1863. Compared 233834 event pairs, 7054 based on Foata normal form. 16/27269 useless extension candidates. Maximal degree in co-relation 76157. Up to 12062 conditions per place. [2023-11-29 02:49:27,908 INFO L140 encePairwiseOnDemand]: 59/65 looper letters, 84 selfloop transitions, 26 changer transitions 0/145 dead transitions. [2023-11-29 02:49:27,909 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 92 places, 145 transitions, 1116 flow [2023-11-29 02:49:27,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:49:27,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 02:49:27,910 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 222 transitions. [2023-11-29 02:49:27,911 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.683076923076923 [2023-11-29 02:49:27,911 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 222 transitions. [2023-11-29 02:49:27,911 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 222 transitions. [2023-11-29 02:49:27,911 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 02:49:27,911 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 222 transitions. [2023-11-29 02:49:27,912 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 44.4) internal successors, (222), 5 states have internal predecessors, (222), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:49:27,913 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:27,913 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 65.0) internal successors, (390), 6 states have internal predecessors, (390), 0 states have call successors, (0), 0 states 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 02:49:27,913 INFO L175 Difference]: Start difference. First operand has 88 places, 89 transitions, 504 flow. Second operand 5 states and 222 transitions. [2023-11-29 02:49:27,913 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 92 places, 145 transitions, 1116 flow [2023-11-29 02:49:28,029 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 145 transitions, 1114 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 02:49:28,032 INFO L231 Difference]: Finished difference. Result has 94 places, 114 transitions, 938 flow [2023-11-29 02:49:28,032 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=65, PETRI_DIFFERENCE_MINUEND_FLOW=502, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=89, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=938, PETRI_PLACES=94, PETRI_TRANSITIONS=114} [2023-11-29 02:49:28,033 INFO L281 CegarLoopForPetriNet]: 72 programPoint places, 22 predicate places. [2023-11-29 02:49:28,033 INFO L495 AbstractCegarLoop]: Abstraction has has 94 places, 114 transitions, 938 flow [2023-11-29 02:49:28,033 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.4) internal successors, (187), 5 states have internal predecessors, (187), 0 states have call successors, (0), 0 states 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 02:49:28,033 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 02:49:28,033 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] [2023-11-29 02:49:28,037 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,234 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-29 02:49:28,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:49:28,234 INFO L85 PathProgramCache]: Analyzing trace with hash 231493770, now seen corresponding path program 5 times [2023-11-29 02:49:28,235 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 02:49:28,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [172139673] [2023-11-29 02:49:28,235 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 02:49:28,235 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 02:49:28,236 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 02:49:28,237 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,238 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,449 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 02:49:28,449 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-29 02:49:28,449 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-29 02:49:28,585 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-29 02:49:28,679 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-29 02:49:28,679 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-29 02:49:28,680 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-29 02:49:28,682 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-29 02:49:28,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-29 02:49:28,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-29 02:49:28,683 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-29 02:49:28,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-29 02:49:28,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-29 02:49:28,684 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-29 02:49:28,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-29 02:49:28,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-29 02:49:28,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-29 02:49:28,685 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-29 02:49:28,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-29 02:49:28,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-29 02:49:28,686 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-29 02:49:28,687 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-29 02:49:28,693 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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 02:49:28,893 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:49:28,899 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-29 02:49:28,899 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-29 02:49:28,988 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-29 02:49:28,993 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-29 02:49:28,995 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-29 02:49:29,001 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-29 02:49:29,014 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:49:29,015 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-29 02:49:29,030 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 29.11 02:49:29 BasicIcfg [2023-11-29 02:49:29,031 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-29 02:49:29,031 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-29 02:49:29,031 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-29 02:49:29,032 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-29 02:49:29,032 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:48:56" (3/4) ... [2023-11-29 02:49:29,033 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-29 02:49:29,034 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-29 02:49:29,035 INFO L158 Benchmark]: Toolchain (without parser) took 34187.28ms. Allocated memory was 79.7MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 55.3MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 567.7MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,035 INFO L158 Benchmark]: CDTParser took 0.29ms. Allocated memory is still 54.5MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:49:29,035 INFO L158 Benchmark]: CACSL2BoogieTranslator took 689.02ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 48.4MB in the end (delta: 6.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,036 INFO L158 Benchmark]: Boogie Procedure Inliner took 61.85ms. Allocated memory is still 79.7MB. Free memory was 48.4MB in the beginning and 45.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,036 INFO L158 Benchmark]: Boogie Preprocessor took 64.77ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 42.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,036 INFO L158 Benchmark]: RCFGBuilder took 921.39ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 41.9MB in the beginning and 56.0MB in the end (delta: -14.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,037 INFO L158 Benchmark]: TraceAbstraction took 32439.42ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 54.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. [2023-11-29 02:49:29,037 INFO L158 Benchmark]: Witness Printer took 3.02ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 02:49:29,039 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.29ms. Allocated memory is still 54.5MB. Free memory is still 31.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 689.02ms. Allocated memory is still 79.7MB. Free memory was 55.1MB in the beginning and 48.4MB in the end (delta: 6.7MB). Peak memory consumption was 17.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 61.85ms. Allocated memory is still 79.7MB. Free memory was 48.4MB in the beginning and 45.8MB in the end (delta: 2.7MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 64.77ms. Allocated memory is still 79.7MB. Free memory was 45.8MB in the beginning and 42.2MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 921.39ms. Allocated memory was 79.7MB in the beginning and 96.5MB in the end (delta: 16.8MB). Free memory was 41.9MB in the beginning and 56.0MB in the end (delta: -14.1MB). Peak memory consumption was 15.8MB. Max. memory is 16.1GB. * TraceAbstraction took 32439.42ms. Allocated memory was 96.5MB in the beginning and 1.8GB in the end (delta: 1.8GB). Free memory was 54.9MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 547.5MB. Max. memory is 16.1GB. * Witness Printer took 3.02ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation Unfinished Backtranslation: unknown boogie variable #t~nondet0 - GenericResult: Unfinished Backtranslation The program execution was not completely translated back. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - UnprovableResult [Line: 17]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 17. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p2_EAX = 0; [L714] 0 int __unbuffered_p3_EAX = 0; [L716] 0 int a = 0; [L717] 0 _Bool a$flush_delayed; [L718] 0 int a$mem_tmp; [L719] 0 _Bool a$r_buff0_thd0; [L720] 0 _Bool a$r_buff0_thd1; [L721] 0 _Bool a$r_buff0_thd2; [L722] 0 _Bool a$r_buff0_thd3; [L723] 0 _Bool a$r_buff0_thd4; [L724] 0 _Bool a$r_buff1_thd0; [L725] 0 _Bool a$r_buff1_thd1; [L726] 0 _Bool a$r_buff1_thd2; [L727] 0 _Bool a$r_buff1_thd3; [L728] 0 _Bool a$r_buff1_thd4; [L729] 0 _Bool a$read_delayed; [L730] 0 int *a$read_delayed_var; [L731] 0 int a$w_buff0; [L732] 0 _Bool a$w_buff0_used; [L733] 0 int a$w_buff1; [L734] 0 _Bool a$w_buff1_used; [L735] 0 _Bool main$tmp_guard0; [L736] 0 _Bool main$tmp_guard1; [L738] 0 int x = 0; [L740] 0 int y = 0; [L742] 0 int z = 0; [L743] 0 _Bool weak$$choice0; [L744] 0 _Bool weak$$choice2; [L859] 0 pthread_t t1409; [L860] FCALL, FORK 0 pthread_create(&t1409, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=0, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=0, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=0, a=0, main$tmp_guard0=0, main$tmp_guard1=0, t1409={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L748] 1 a$w_buff1 = a$w_buff0 [L749] 1 a$w_buff0 = 1 [L750] 1 a$w_buff1_used = a$w_buff0_used [L751] 1 a$w_buff0_used = (_Bool)1 [L752] CALL 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L752] RET 1 __VERIFIER_assert(!(a$w_buff1_used && a$w_buff0_used)) [L753] 1 a$r_buff1_thd0 = a$r_buff0_thd0 [L754] 1 a$r_buff1_thd1 = a$r_buff0_thd1 [L755] 1 a$r_buff1_thd2 = a$r_buff0_thd2 [L756] 1 a$r_buff1_thd3 = a$r_buff0_thd3 [L757] 1 a$r_buff1_thd4 = a$r_buff0_thd4 [L758] 1 a$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=0] [L761] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L861] 0 pthread_t t1410; [L862] FCALL, FORK 0 pthread_create(&t1410, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={6:0}, t1410={3:0}, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L778] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L863] 0 pthread_t t1411; [L864] FCALL, FORK 0 pthread_create(&t1411, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t1409={6:0}, t1410={3:0}, t1411={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L781] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=0] [L784] 2 a = a$w_buff0_used && a$r_buff0_thd2 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd2 ? a$w_buff1 : a) [L785] 2 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$w_buff0_used [L786] 2 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$w_buff1_used [L787] 2 a$r_buff0_thd2 = a$w_buff0_used && a$r_buff0_thd2 ? (_Bool)0 : a$r_buff0_thd2 [L788] 2 a$r_buff1_thd2 = a$w_buff0_used && a$r_buff0_thd2 || a$w_buff1_used && a$r_buff1_thd2 ? (_Bool)0 : a$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=1, z=0] [L798] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=0] [L801] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=0] [L804] 3 a = a$w_buff0_used && a$r_buff0_thd3 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd3 ? a$w_buff1 : a) [L805] 3 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$w_buff0_used [L806] 3 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$w_buff1_used [L807] 3 a$r_buff0_thd3 = a$w_buff0_used && a$r_buff0_thd3 ? (_Bool)0 : a$r_buff0_thd3 [L808] 3 a$r_buff1_thd3 = a$w_buff0_used && a$r_buff0_thd3 || a$w_buff1_used && a$r_buff1_thd3 ? (_Bool)0 : a$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=0, a=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=2, y=2, z=0] [L865] 0 pthread_t t1412; [L866] FCALL, FORK 0 pthread_create(&t1412, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, t1409={6:0}, t1410={3:0}, t1411={7:0}, t1412={-2147483646:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=0] [L818] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice0=0, weak$$choice2=0, x=2, y=2, z=1] [L821] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L822] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L823] 4 a$flush_delayed = weak$$choice2 [L824] 4 a$mem_tmp = a [L825] 4 a = !a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff1) [L826] 4 a$w_buff0 = weak$$choice2 ? a$w_buff0 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : a$w_buff0)) [L827] 4 a$w_buff1 = weak$$choice2 ? a$w_buff1 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1 : (a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff1 : a$w_buff1)) [L828] 4 a$w_buff0_used = weak$$choice2 ? a$w_buff0_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff0_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used)) [L829] 4 a$w_buff1_used = weak$$choice2 ? a$w_buff1_used : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$w_buff1_used : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L830] 4 a$r_buff0_thd4 = weak$$choice2 ? a$r_buff0_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff0_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4)) [L831] 4 a$r_buff1_thd4 = weak$$choice2 ? a$r_buff1_thd4 : (!a$w_buff0_used || !a$r_buff0_thd4 && !a$w_buff1_used || !a$r_buff0_thd4 && !a$r_buff1_thd4 ? a$r_buff1_thd4 : (a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L832] 4 __unbuffered_p3_EAX = a [L833] 4 a = a$flush_delayed ? a$mem_tmp : a [L834] 4 a$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=1, a$w_buff1=0, a$w_buff1_used=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, weak$$choice2=0, x=2, y=2, z=1] [L764] 1 a = a$w_buff0_used && a$r_buff0_thd1 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd1 ? a$w_buff1 : a) [L765] 1 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$w_buff0_used [L766] 1 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$w_buff1_used [L767] 1 a$r_buff0_thd1 = a$w_buff0_used && a$r_buff0_thd1 ? (_Bool)0 : a$r_buff0_thd1 [L768] 1 a$r_buff1_thd1 = a$w_buff0_used && a$r_buff0_thd1 || a$w_buff1_used && a$r_buff1_thd1 ? (_Bool)0 : a$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L771] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L791] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L811] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L837] 4 a = a$w_buff0_used && a$r_buff0_thd4 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd4 ? a$w_buff1 : a) [L838] 4 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$w_buff0_used [L839] 4 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$w_buff1_used [L840] 4 a$r_buff0_thd4 = a$w_buff0_used && a$r_buff0_thd4 ? (_Bool)0 : a$r_buff0_thd4 [L841] 4 a$r_buff1_thd4 = a$w_buff0_used && a$r_buff0_thd4 || a$w_buff1_used && a$r_buff1_thd4 ? (_Bool)0 : a$r_buff1_thd4 VAL [__unbuffered_cnt=3, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L844] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L868] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={6:0}, t1410={3:0}, t1411={7:0}, t1412={-2147483646:0}, weak$$choice2=0, x=2, y=2, z=1] [L870] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L870] RET 0 assume_abort_if_not(main$tmp_guard0) [L872] 0 a = a$w_buff0_used && a$r_buff0_thd0 ? a$w_buff0 : (a$w_buff1_used && a$r_buff1_thd0 ? a$w_buff1 : a) [L873] 0 a$w_buff0_used = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$w_buff0_used [L874] 0 a$w_buff1_used = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$w_buff1_used [L875] 0 a$r_buff0_thd0 = a$w_buff0_used && a$r_buff0_thd0 ? (_Bool)0 : a$r_buff0_thd0 [L876] 0 a$r_buff1_thd0 = a$w_buff0_used && a$r_buff0_thd0 || a$w_buff1_used && a$r_buff1_thd0 ? (_Bool)0 : a$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={6:0}, t1410={3:0}, t1411={7:0}, t1412={-2147483646:0}, weak$$choice2=0, x=2, y=2, z=1] [L879] 0 main$tmp_guard1 = !(x == 2 && y == 2 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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, t1409={6:0}, t1410={3:0}, t1411={7:0}, t1412={-2147483646:0}, weak$$choice2=0, x=2, y=2, z=1] [L881] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L18] COND TRUE 0 !expression [L18] CALL 0 reach_error() [L17] COND FALSE 0 !(0) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, z=1] [L17] 0 __assert_fail ("0", "mix053_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, a$flush_delayed=0, a$mem_tmp=0, a$r_buff0_thd0=0, a$r_buff0_thd1=1, a$r_buff0_thd2=0, a$r_buff0_thd3=0, a$r_buff0_thd4=0, a$r_buff1_thd0=0, a$r_buff1_thd1=0, a$r_buff1_thd2=0, a$r_buff1_thd3=0, a$r_buff1_thd4=0, a$read_delayed=0, a$read_delayed_var={0:0}, a$w_buff0=1, a$w_buff0_used=0, a$w_buff1=0, a$w_buff1_used=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=2, y=2, 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: 857]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 864]: 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: 866]: 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: 862]: 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: 860]: 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, 97 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: 32.2s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 23.2s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 954 SdHoareTripleChecker+Valid, 3.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 801 mSDsluCounter, 109 SdHoareTripleChecker+Invalid, 3.1s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 82 IncrementalHoareTripleChecker+Unchecked, 82 mSDsCounter, 59 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2422 IncrementalHoareTripleChecker+Invalid, 2563 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 59 mSolverCounterUnsat, 27 mSDtfsCounter, 2422 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 380 GetRequests, 313 SyntacticMatches, 0 SemanticMatches, 67 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=938occurred in iteration=18, InterpolantAutomatonStates: 81, 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.4s SsaConstructionTime, 1.2s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 417 NumberOfCodeBlocks, 417 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 358 ConstructedInterpolants, 1 QuantifiedInterpolants, 2697 SizeOfPredicates, 17 NumberOfNonLiveVariables, 2496 ConjunctsInSsa, 102 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 02:49:29,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_93f194c1-9359-42a7-bfc3-e2b41106ef67/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