./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/mix037_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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:41:09,960 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:41:10,055 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-28 23:41:10,062 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:41:10,063 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:41:10,095 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:41:10,096 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:41:10,097 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:41:10,098 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:41:10,099 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:41:10,100 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:41:10,100 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:41:10,101 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:41:10,102 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:41:10,102 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:41:10,103 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:41:10,104 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:41:10,104 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:41:10,105 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:41:10,106 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:41:10,106 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:41:10,107 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:41:10,107 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:41:10,108 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:41:10,109 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:41:10,109 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:41:10,110 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:41:10,110 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:41:10,111 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:41:10,111 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:41:10,112 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:41:10,112 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:41:10,113 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:41:10,113 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:41:10,113 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:41:10,114 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-28 23:41:10,114 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-28 23:41:10,114 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:41:10,114 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:41:10,115 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:41:10,115 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:41:10,115 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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2023-11-28 23:41:10,368 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:41:10,404 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:41:10,406 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:41:10,407 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:41:10,409 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:41:10,410 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:41:13,789 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:41:14,073 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:41:14,074 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:41:14,102 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/00f757a7c/e1ff7e7ff01f441c94bc3162917b3a35/FLAG30dc28fd9 [2023-11-28 23:41:14,118 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/00f757a7c/e1ff7e7ff01f441c94bc3162917b3a35 [2023-11-28 23:41:14,121 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:41:14,123 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:41:14,125 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:41:14,125 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:41:14,131 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:41:14,132 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,133 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c1d98a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14, skipping insertion in model container [2023-11-28 23:41:14,133 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,190 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:41:14,668 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:41:14,683 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:41:14,761 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:41:14,809 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:41:14,809 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:41:14,818 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:41:14,818 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14 WrapperNode [2023-11-28 23:41:14,819 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:41:14,820 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:41:14,820 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:41:14,821 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:41:14,830 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,853 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,889 INFO L138 Inliner]: procedures = 177, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 151 [2023-11-28 23:41:14,889 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:41:14,890 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:41:14,891 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:41:14,891 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:41:14,904 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,905 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,910 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,935 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-28 23:41:14,935 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,936 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,949 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,952 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,956 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,959 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,965 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:41:14,966 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:41:14,966 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:41:14,966 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:41:14,968 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (1/1) ... [2023-11-28 23:41:14,974 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:41:14,985 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:41:14,999 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:41:15,009 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:41:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-28 23:41:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-28 23:41:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-28 23:41:15,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#4 [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:41:15,037 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:41:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:41:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:41:15,038 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:41:15,038 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:41:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:41:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 23:41:15,039 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 23:41:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-28 23:41:15,039 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-28 23:41:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-28 23:41:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-28 23:41:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#4 [2023-11-28 23:41:15,040 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:41:15,041 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:41:15,041 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:41:15,043 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:41:15,229 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:41:15,232 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:41:15,649 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:41:15,862 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:41:15,862 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:41:15,863 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:15 BoogieIcfgContainer [2023-11-28 23:41:15,863 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:41:15,867 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:41:15,867 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:41:15,871 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:41:15,871 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:41:14" (1/3) ... [2023-11-28 23:41:15,872 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6b6a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:15, skipping insertion in model container [2023-11-28 23:41:15,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:41:14" (2/3) ... [2023-11-28 23:41:15,873 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@c6b6a85 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:41:15, skipping insertion in model container [2023-11-28 23:41:15,873 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:15" (3/3) ... [2023-11-28 23:41:15,875 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:41:15,901 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:41:15,901 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 23:41:15,902 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:41:15,980 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:41:16,026 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-28 23:41:16,072 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-28 23:41:16,072 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:41:16,078 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-28 23:41:16,078 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-28 23:41:16,084 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-28 23:41:16,097 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:41:16,105 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;@71807bc9, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:41:16,106 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 23:41:16,109 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:41:16,109 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:41:16,109 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:41:16,110 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:16,110 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:41:16,111 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-28 23:41:16,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:16,118 INFO L85 PathProgramCache]: Analyzing trace with hash 14366, now seen corresponding path program 1 times [2023-11-28 23:41:16,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:16,131 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683758802] [2023-11-28 23:41:16,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:16,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:16,271 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:16,440 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-28 23:41:16,441 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:16,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683758802] [2023-11-28 23:41:16,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683758802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:16,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:16,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:41:16,444 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [338176176] [2023-11-28 23:41:16,445 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:16,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:16,463 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:16,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:16,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:16,548 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:41:16,552 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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-28 23:41:16,552 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:16,552 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:41:16,553 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:18,302 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-28 23:41:18,302 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-28 23:41:18,332 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 54556 event pairs, 3179 based on Foata normal form. 360/6916 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-28 23:41:18,387 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-28 23:41:18,387 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-28 23:41:18,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:18,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:18,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:41:18,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:41:18,402 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:41:18,402 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:41:18,403 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:18,406 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:41:18,409 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:18,413 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:18,413 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:18,415 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:41:18,415 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-28 23:41:18,422 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:41:18,425 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-28 23:41:18,428 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-28 23:41:18,431 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-28 23:41:18,432 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-28 23:41:18,432 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-28 23:41:18,432 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:18,432 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:41:18,433 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-28 23:41:18,433 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-28 23:41:18,433 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:18,434 INFO L85 PathProgramCache]: Analyzing trace with hash 14367, now seen corresponding path program 1 times [2023-11-28 23:41:18,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:18,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [865991634] [2023-11-28 23:41:18,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:18,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:18,457 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:18,537 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-28 23:41:18,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:18,538 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [865991634] [2023-11-28 23:41:18,538 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [865991634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:18,538 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:18,538 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:41:18,538 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [40210] [2023-11-28 23:41:18,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:18,540 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:18,540 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:18,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:18,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:18,561 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:41:18,561 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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-28 23:41:18,561 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:18,562 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:41:18,562 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:20,114 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-28 23:41:20,115 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 23:41:20,137 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 54711 event pairs, 3179 based on Foata normal form. 1/6556 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-28 23:41:20,194 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-28 23:41:20,195 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-28 23:41:20,195 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:20,195 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:20,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:41:20,198 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:41:20,198 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:41:20,198 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:41:20,199 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:20,199 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:41:20,200 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:20,202 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:20,202 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:20,203 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:41:20,203 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-28 23:41:20,218 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:20,220 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-28 23:41:20,220 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-28 23:41:20,221 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-28 23:41:20,221 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-28 23:41:20,222 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-28 23:41:20,222 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:20,222 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:41:20,222 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-28 23:41:20,223 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-28 23:41:20,223 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:20,224 INFO L85 PathProgramCache]: Analyzing trace with hash 428416841, now seen corresponding path program 1 times [2023-11-28 23:41:20,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:20,224 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1200634802] [2023-11-28 23:41:20,224 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:20,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:20,246 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:20,298 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-28 23:41:20,299 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:20,299 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1200634802] [2023-11-28 23:41:20,299 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1200634802] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:20,299 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:20,300 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:20,300 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [991166898] [2023-11-28 23:41:20,300 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:20,300 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:20,301 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:20,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:20,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:20,322 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:41:20,323 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:20,323 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:20,323 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:41:20,323 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:21,714 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-28 23:41:21,714 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 23:41:21,733 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 417. Compared 54264 event pairs, 3251 based on Foata normal form. 0/6528 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-28 23:41:21,782 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-28 23:41:21,782 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-28 23:41:21,783 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:21,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:21,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-28 23:41:21,785 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-28 23:41:21,785 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-28 23:41:21,785 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-28 23:41:21,786 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:21,786 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-28 23:41:21,787 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:21,789 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:21,789 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:21,789 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-28 23:41:21,790 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-28 23:41:21,797 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:21,799 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 23:41:21,799 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-28 23:41:21,800 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-28 23:41:21,801 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 23:41:21,801 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:21,801 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:21,801 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:41:21,802 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-28 23:41:21,802 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-28 23:41:21,803 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:21,803 INFO L85 PathProgramCache]: Analyzing trace with hash 428416842, now seen corresponding path program 1 times [2023-11-28 23:41:21,803 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:21,803 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1492747949] [2023-11-28 23:41:21,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:21,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:21,822 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:21,897 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-28 23:41:21,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:21,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1492747949] [2023-11-28 23:41:21,898 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1492747949] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:21,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:21,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:21,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [711620710] [2023-11-28 23:41:21,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:21,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:21,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:21,901 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:21,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:21,924 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:41:21,925 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:21,925 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:21,925 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:41:21,925 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:23,067 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-28 23:41:23,068 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-28 23:41:23,082 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 55027 event pairs, 2503 based on Foata normal form. 5/6563 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-28 23:41:23,116 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-28 23:41:23,116 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-28 23:41:23,117 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:23,117 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:23,118 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:41:23,118 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:41:23,119 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:41:23,119 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:41:23,119 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:23,119 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:41:23,120 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:23,122 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:23,122 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:23,122 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:41:23,123 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-28 23:41:23,126 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:23,128 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 23:41:23,128 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-28 23:41:23,129 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-28 23:41:23,129 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 23:41:23,130 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:23,130 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:23,130 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:41:23,130 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-28 23:41:23,130 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-28 23:41:23,131 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash 428418495, now seen corresponding path program 1 times [2023-11-28 23:41:23,131 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:23,132 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [804314077] [2023-11-28 23:41:23,132 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:23,132 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:23,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:23,252 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-28 23:41:23,253 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:23,253 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [804314077] [2023-11-28 23:41:23,253 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [804314077] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:23,254 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:23,254 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:41:23,254 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1174747592] [2023-11-28 23:41:23,255 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:23,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:23,255 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:23,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:23,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:23,257 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-28 23:41:23,258 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:23,258 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:23,258 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-28 23:41:23,259 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:24,074 INFO L124 PetriNetUnfolderBase]: 3311/5485 cut-off events. [2023-11-28 23:41:24,074 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 23:41:24,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 5485 events. 3311/5485 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 39115 event pairs, 593 based on Foata normal form. 0/5382 useless extension candidates. Maximal degree in co-relation 10300. Up to 3661 conditions per place. [2023-11-28 23:41:24,105 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-28 23:41:24,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-28 23:41:24,106 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:24,106 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:24,107 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-28 23:41:24,107 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-28 23:41:24,107 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-28 23:41:24,108 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-28 23:41:24,108 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:24,108 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-28 23:41:24,109 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,110 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,111 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,111 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-28 23:41:24,111 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-28 23:41:24,113 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:24,114 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-28 23:41:24,115 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-28 23:41:24,116 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-28 23:41:24,116 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-28 23:41:24,116 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,117 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:24,117 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:41:24,117 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-28 23:41:24,117 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-28 23:41:24,118 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:24,118 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249144, now seen corresponding path program 1 times [2023-11-28 23:41:24,118 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:24,119 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1012472156] [2023-11-28 23:41:24,119 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:24,119 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:24,135 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:24,181 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-28 23:41:24,181 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:24,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1012472156] [2023-11-28 23:41:24,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1012472156] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:24,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:24,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:24,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226836722] [2023-11-28 23:41:24,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:24,183 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:24,183 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:24,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:24,184 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:24,205 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:41:24,206 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,206 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:24,206 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:41:24,206 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:24,855 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-28 23:41:24,855 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-28 23:41:24,865 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 302. Compared 38221 event pairs, 1356 based on Foata normal form. 0/4914 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-28 23:41:24,882 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 23:41:24,882 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-28 23:41:24,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:24,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:24,884 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 23:41:24,884 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-28 23:41:24,884 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 23:41:24,884 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 23:41:24,885 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:24,885 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 23:41:24,885 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,887 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,887 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,887 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-28 23:41:24,888 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-28 23:41:24,889 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:24,890 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 23:41:24,891 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-28 23:41:24,891 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-28 23:41:24,892 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 23:41:24,892 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,892 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:24,892 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:41:24,893 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-28 23:41:24,893 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-28 23:41:24,893 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:24,893 INFO L85 PathProgramCache]: Analyzing trace with hash -1676249143, now seen corresponding path program 1 times [2023-11-28 23:41:24,893 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:24,894 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [611368421] [2023-11-28 23:41:24,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:24,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:24,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:24,964 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-28 23:41:24,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:24,965 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [611368421] [2023-11-28 23:41:24,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [611368421] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:24,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:24,966 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:24,966 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2005622702] [2023-11-28 23:41:24,966 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:24,967 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:24,967 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:24,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:24,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:24,988 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:41:24,988 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:24,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:24,989 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:41:24,989 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:25,794 INFO L124 PetriNetUnfolderBase]: 2903/5128 cut-off events. [2023-11-28 23:41:25,794 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 23:41:25,801 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 301. Compared 37360 event pairs, 1884 based on Foata normal form. 12/4849 useless extension candidates. Maximal degree in co-relation 9399. Up to 3431 conditions per place. [2023-11-28 23:41:25,817 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 23:41:25,817 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-28 23:41:25,818 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:25,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:25,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 23:41:25,819 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-28 23:41:25,819 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 23:41:25,819 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 23:41:25,820 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:25,820 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 23:41:25,821 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:25,822 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:25,822 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:25,822 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-28 23:41:25,823 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-28 23:41:25,824 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:25,826 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 23:41:25,826 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-28 23:41:25,827 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-28 23:41:25,828 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 23:41:25,828 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:25,828 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:25,828 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:41:25,828 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-28 23:41:25,828 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-28 23:41:25,829 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:25,829 INFO L85 PathProgramCache]: Analyzing trace with hash 446943736, now seen corresponding path program 1 times [2023-11-28 23:41:25,829 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:25,829 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2015291868] [2023-11-28 23:41:25,829 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:25,830 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:25,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:25,898 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-28 23:41:25,898 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:25,898 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2015291868] [2023-11-28 23:41:25,899 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2015291868] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:25,899 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:25,899 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:25,899 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1604150251] [2023-11-28 23:41:25,899 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:25,900 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:25,900 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:25,900 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:25,901 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:25,928 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:41:25,928 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:25,928 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:25,929 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:41:25,929 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:26,657 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-28 23:41:26,657 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 23:41:26,667 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37018 event pairs, 1424 based on Foata normal form. 0/4932 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-28 23:41:26,685 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 23:41:26,685 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-28 23:41:26,686 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:26,686 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:26,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 23:41:26,687 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-28 23:41:26,687 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 23:41:26,687 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 23:41:26,687 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:26,687 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 23:41:26,688 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:26,688 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:26,689 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:26,689 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-28 23:41:26,689 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-28 23:41:26,690 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:26,692 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 23:41:26,692 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 23:41:26,692 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-28 23:41:26,692 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 23:41:26,693 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:26,693 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:26,693 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:41:26,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-28 23:41:26,693 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-28 23:41:26,693 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:26,693 INFO L85 PathProgramCache]: Analyzing trace with hash 446943737, now seen corresponding path program 1 times [2023-11-28 23:41:26,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:26,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2138045860] [2023-11-28 23:41:26,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:26,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:26,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:26,793 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-28 23:41:26,793 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:26,793 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2138045860] [2023-11-28 23:41:26,793 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2138045860] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:26,793 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:26,794 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:41:26,794 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1118882401] [2023-11-28 23:41:26,794 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:26,794 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:41:26,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:26,795 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:41:26,795 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:41:26,817 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:41:26,817 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:26,818 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:26,818 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:41:26,818 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:27,741 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-28 23:41:27,741 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-28 23:41:27,752 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 302. Compared 37094 event pairs, 920 based on Foata normal form. 36/4953 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-28 23:41:27,773 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 23:41:27,773 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-28 23:41:27,774 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:41:27,774 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:41:27,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 23:41:27,775 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-28 23:41:27,775 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 23:41:27,775 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 23:41:27,775 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:27,776 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 23:41:27,777 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:27,778 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:27,778 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:27,778 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-28 23:41:27,779 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-28 23:41:27,780 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:27,781 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 23:41:27,782 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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-28 23:41:27,782 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-28 23:41:27,782 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 23:41:27,783 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:27,783 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:27,783 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-28 23:41:27,783 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-28 23:41:27,784 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-28 23:41:27,784 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:27,784 INFO L85 PathProgramCache]: Analyzing trace with hash 698157759, now seen corresponding path program 1 times [2023-11-28 23:41:27,784 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:27,784 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [810613909] [2023-11-28 23:41:27,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:27,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:27,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:28,945 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-28 23:41:28,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:28,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [810613909] [2023-11-28 23:41:28,947 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [810613909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:28,947 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:28,947 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 23:41:28,947 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2018541794] [2023-11-28 23:41:28,948 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:28,948 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-28 23:41:28,949 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:28,949 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-28 23:41:28,950 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2023-11-28 23:41:29,541 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:41:29,542 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:29,543 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:29,543 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:41:29,543 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:30,796 INFO L124 PetriNetUnfolderBase]: 3664/5653 cut-off events. [2023-11-28 23:41:30,796 INFO L125 PetriNetUnfolderBase]: For 204/204 co-relation queries the response was YES. [2023-11-28 23:41:30,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11024 conditions, 5653 events. 3664/5653 cut-off events. For 204/204 co-relation queries the response was YES. Maximal size of possible extension queue 324. Compared 35883 event pairs, 0 based on Foata normal form. 180/5745 useless extension candidates. Maximal degree in co-relation 11013. Up to 3384 conditions per place. [2023-11-28 23:41:30,824 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 49 selfloop transitions, 5 changer transitions 13/88 dead transitions. [2023-11-28 23:41:30,825 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 67 places, 88 transitions, 324 flow [2023-11-28 23:41:30,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-28 23:41:30,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-28 23:41:30,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2023-11-28 23:41:30,827 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6194029850746269 [2023-11-28 23:41:30,827 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 332 transitions. [2023-11-28 23:41:30,827 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 332 transitions. [2023-11-28 23:41:30,827 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:30,827 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 332 transitions. [2023-11-28 23:41:30,829 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 41.5) internal successors, (332), 8 states have internal predecessors, (332), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:30,830 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:30,830 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 67.0) internal successors, (603), 9 states have internal predecessors, (603), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:30,830 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 8 states and 332 transitions. [2023-11-28 23:41:30,830 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 67 places, 88 transitions, 324 flow [2023-11-28 23:41:30,831 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 88 transitions, 318 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:41:30,833 INFO L231 Difference]: Finished difference. Result has 65 places, 48 transitions, 114 flow [2023-11-28 23:41:30,833 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=106, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=114, PETRI_PLACES=65, PETRI_TRANSITIONS=48} [2023-11-28 23:41:30,834 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -9 predicate places. [2023-11-28 23:41:30,834 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 48 transitions, 114 flow [2023-11-28 23:41:30,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 34.63636363636363) internal successors, (381), 11 states have internal predecessors, (381), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:30,835 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:30,835 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-28 23:41:30,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-28 23:41:30,835 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-28 23:41:30,835 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:30,836 INFO L85 PathProgramCache]: Analyzing trace with hash 698159135, now seen corresponding path program 1 times [2023-11-28 23:41:30,836 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:30,836 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1330829570] [2023-11-28 23:41:30,836 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:30,836 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:30,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:31,084 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-28 23:41:31,084 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:31,084 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1330829570] [2023-11-28 23:41:31,085 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1330829570] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:31,085 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:31,085 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:41:31,085 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [455990024] [2023-11-28 23:41:31,085 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:31,086 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:41:31,086 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:31,086 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:41:31,087 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:41:31,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-28 23:41:31,110 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 48 transitions, 114 flow. Second operand has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:31,110 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:31,110 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-28 23:41:31,111 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:35,702 INFO L124 PetriNetUnfolderBase]: 26337/38302 cut-off events. [2023-11-28 23:41:35,702 INFO L125 PetriNetUnfolderBase]: For 1896/1896 co-relation queries the response was YES. [2023-11-28 23:41:35,763 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76095 conditions, 38302 events. 26337/38302 cut-off events. For 1896/1896 co-relation queries the response was YES. Maximal size of possible extension queue 1702. Compared 277501 event pairs, 7125 based on Foata normal form. 0/37247 useless extension candidates. Maximal degree in co-relation 76084. Up to 16162 conditions per place. [2023-11-28 23:41:35,847 INFO L140 encePairwiseOnDemand]: 56/67 looper letters, 46 selfloop transitions, 7 changer transitions 95/166 dead transitions. [2023-11-28 23:41:35,847 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 166 transitions, 668 flow [2023-11-28 23:41:35,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:41:35,848 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:41:35,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 429 transitions. [2023-11-28 23:41:35,851 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7114427860696517 [2023-11-28 23:41:35,851 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 429 transitions. [2023-11-28 23:41:35,851 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 429 transitions. [2023-11-28 23:41:35,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:35,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 429 transitions. [2023-11-28 23:41:35,853 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.666666666666664) internal successors, (429), 9 states have internal predecessors, (429), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:35,854 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:35,855 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:35,855 INFO L175 Difference]: Start difference. First operand has 65 places, 48 transitions, 114 flow. Second operand 9 states and 429 transitions. [2023-11-28 23:41:35,855 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 166 transitions, 668 flow [2023-11-28 23:41:35,857 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 166 transitions, 648 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-28 23:41:35,859 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 202 flow [2023-11-28 23:41:35,859 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=105, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=48, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=202, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-28 23:41:35,860 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-28 23:41:35,860 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 202 flow [2023-11-28 23:41:35,860 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 33.8) internal successors, (169), 5 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:35,860 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:35,861 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-28 23:41:35,861 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-28 23:41:35,861 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-28 23:41:35,861 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:35,861 INFO L85 PathProgramCache]: Analyzing trace with hash -937436226, now seen corresponding path program 1 times [2023-11-28 23:41:35,861 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:35,861 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [831444520] [2023-11-28 23:41:35,861 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:35,862 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:35,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:36,082 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-28 23:41:36,082 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:36,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [831444520] [2023-11-28 23:41:36,083 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [831444520] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:36,083 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:36,083 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:41:36,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [288760463] [2023-11-28 23:41:36,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:36,084 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:41:36,084 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:36,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:41:36,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:41:36,091 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-28 23:41:36,091 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 202 flow. Second operand has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 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-28 23:41:36,091 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:36,091 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-28 23:41:36,091 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:39,485 INFO L124 PetriNetUnfolderBase]: 14782/23928 cut-off events. [2023-11-28 23:41:39,485 INFO L125 PetriNetUnfolderBase]: For 22140/24118 co-relation queries the response was YES. [2023-11-28 23:41:39,588 INFO L83 FinitePrefix]: Finished finitePrefix Result has 63410 conditions, 23928 events. 14782/23928 cut-off events. For 22140/24118 co-relation queries the response was YES. Maximal size of possible extension queue 1154. Compared 192167 event pairs, 4633 based on Foata normal form. 844/24115 useless extension candidates. Maximal degree in co-relation 63391. Up to 13009 conditions per place. [2023-11-28 23:41:39,676 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 34 selfloop transitions, 3 changer transitions 43/106 dead transitions. [2023-11-28 23:41:39,677 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 106 transitions, 530 flow [2023-11-28 23:41:39,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:41:39,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:41:39,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 321 transitions. [2023-11-28 23:41:39,679 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6844349680170576 [2023-11-28 23:41:39,679 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 321 transitions. [2023-11-28 23:41:39,679 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 321 transitions. [2023-11-28 23:41:39,680 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:39,680 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 321 transitions. [2023-11-28 23:41:39,682 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 45.857142857142854) internal successors, (321), 7 states have internal predecessors, (321), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:39,683 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:39,683 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:39,684 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 202 flow. Second operand 7 states and 321 transitions. [2023-11-28 23:41:39,684 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 106 transitions, 530 flow [2023-11-28 23:41:39,837 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 106 transitions, 480 flow, removed 14 selfloop flow, removed 4 redundant places. [2023-11-28 23:41:39,840 INFO L231 Difference]: Finished difference. Result has 74 places, 53 transitions, 191 flow [2023-11-28 23:41:39,840 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=172, PETRI_DIFFERENCE_MINUEND_PLACES=63, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=191, PETRI_PLACES=74, PETRI_TRANSITIONS=53} [2023-11-28 23:41:39,841 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-28 23:41:39,841 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 53 transitions, 191 flow [2023-11-28 23:41:39,841 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 37.8) internal successors, (189), 5 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-28 23:41:39,841 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:39,841 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-28 23:41:39,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-28 23:41:39,842 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-28 23:41:39,842 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:39,842 INFO L85 PathProgramCache]: Analyzing trace with hash -1621319587, now seen corresponding path program 1 times [2023-11-28 23:41:39,842 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:39,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723267004] [2023-11-28 23:41:39,843 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:39,843 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:39,867 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:40,075 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-28 23:41:40,075 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:40,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723267004] [2023-11-28 23:41:40,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723267004] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:40,076 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:40,076 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:41:40,076 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030960580] [2023-11-28 23:41:40,076 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:40,077 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:41:40,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:40,077 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:41:40,078 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:41:40,094 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 31 out of 67 [2023-11-28 23:41:40,095 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 53 transitions, 191 flow. Second operand has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:40,095 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:40,095 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 31 of 67 [2023-11-28 23:41:40,095 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:44,148 INFO L124 PetriNetUnfolderBase]: 18071/26711 cut-off events. [2023-11-28 23:41:44,149 INFO L125 PetriNetUnfolderBase]: For 27843/28030 co-relation queries the response was YES. [2023-11-28 23:41:44,238 INFO L83 FinitePrefix]: Finished finitePrefix Result has 74161 conditions, 26711 events. 18071/26711 cut-off events. For 27843/28030 co-relation queries the response was YES. Maximal size of possible extension queue 1119. Compared 185560 event pairs, 5479 based on Foata normal form. 649/27324 useless extension candidates. Maximal degree in co-relation 74139. Up to 13648 conditions per place. [2023-11-28 23:41:44,343 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 63 selfloop transitions, 11 changer transitions 74/166 dead transitions. [2023-11-28 23:41:44,343 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 166 transitions, 905 flow [2023-11-28 23:41:44,343 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-28 23:41:44,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-28 23:41:44,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 457 transitions. [2023-11-28 23:41:44,346 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.682089552238806 [2023-11-28 23:41:44,346 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 457 transitions. [2023-11-28 23:41:44,346 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 457 transitions. [2023-11-28 23:41:44,347 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:44,347 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 457 transitions. [2023-11-28 23:41:44,348 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 45.7) internal successors, (457), 10 states have internal predecessors, (457), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:44,350 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:44,350 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 67.0) internal successors, (737), 11 states have internal predecessors, (737), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:44,350 INFO L175 Difference]: Start difference. First operand has 74 places, 53 transitions, 191 flow. Second operand 10 states and 457 transitions. [2023-11-28 23:41:44,350 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 166 transitions, 905 flow [2023-11-28 23:41:45,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 71 places, 166 transitions, 863 flow, removed 16 selfloop flow, removed 8 redundant places. [2023-11-28 23:41:45,367 INFO L231 Difference]: Finished difference. Result has 79 places, 58 transitions, 262 flow [2023-11-28 23:41:45,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=173, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=262, PETRI_PLACES=79, PETRI_TRANSITIONS=58} [2023-11-28 23:41:45,368 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 5 predicate places. [2023-11-28 23:41:45,368 INFO L495 AbstractCegarLoop]: Abstraction has has 79 places, 58 transitions, 262 flow [2023-11-28 23:41:45,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 33.5) internal successors, (201), 6 states have internal predecessors, (201), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:45,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:45,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:41:45,369 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-28 23:41:45,369 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-28 23:41:45,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:45,369 INFO L85 PathProgramCache]: Analyzing trace with hash 47499102, now seen corresponding path program 1 times [2023-11-28 23:41:45,369 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:45,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [366828289] [2023-11-28 23:41:45,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:45,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:45,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:45,501 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-28 23:41:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [366828289] [2023-11-28 23:41:45,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [366828289] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:45,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:45,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:41:45,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [369388701] [2023-11-28 23:41:45,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:45,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:41:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:45,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:41:45,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:41:45,517 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:41:45,517 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 79 places, 58 transitions, 262 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:45,517 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:45,518 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:41:45,518 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:50,955 INFO L124 PetriNetUnfolderBase]: 28938/43345 cut-off events. [2023-11-28 23:41:50,955 INFO L125 PetriNetUnfolderBase]: For 35241/38208 co-relation queries the response was YES. [2023-11-28 23:41:51,131 INFO L83 FinitePrefix]: Finished finitePrefix Result has 107081 conditions, 43345 events. 28938/43345 cut-off events. For 35241/38208 co-relation queries the response was YES. Maximal size of possible extension queue 1644. Compared 317450 event pairs, 5152 based on Foata normal form. 1569/43545 useless extension candidates. Maximal degree in co-relation 107057. Up to 23158 conditions per place. [2023-11-28 23:41:51,301 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 57 selfloop transitions, 6 changer transitions 0/92 dead transitions. [2023-11-28 23:41:51,301 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 76 places, 92 transitions, 484 flow [2023-11-28 23:41:51,302 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:41:51,302 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:41:51,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 194 transitions. [2023-11-28 23:41:51,303 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7238805970149254 [2023-11-28 23:41:51,303 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 194 transitions. [2023-11-28 23:41:51,304 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 194 transitions. [2023-11-28 23:41:51,304 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:51,304 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 194 transitions. [2023-11-28 23:41:51,305 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.5) internal successors, (194), 4 states have internal predecessors, (194), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:51,306 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:51,306 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:51,306 INFO L175 Difference]: Start difference. First operand has 79 places, 58 transitions, 262 flow. Second operand 4 states and 194 transitions. [2023-11-28 23:41:51,306 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 76 places, 92 transitions, 484 flow [2023-11-28 23:41:51,964 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 92 transitions, 468 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-28 23:41:51,965 INFO L231 Difference]: Finished difference. Result has 74 places, 63 transitions, 292 flow [2023-11-28 23:41:51,966 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=246, PETRI_DIFFERENCE_MINUEND_PLACES=69, 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=4, PETRI_FLOW=292, PETRI_PLACES=74, PETRI_TRANSITIONS=63} [2023-11-28 23:41:51,966 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-28 23:41:51,966 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 63 transitions, 292 flow [2023-11-28 23:41:51,966 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:51,966 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:51,966 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] [2023-11-28 23:41:51,967 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-28 23:41:51,967 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-28 23:41:51,967 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:51,967 INFO L85 PathProgramCache]: Analyzing trace with hash 400558442, now seen corresponding path program 1 times [2023-11-28 23:41:51,967 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:51,967 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2112933908] [2023-11-28 23:41:51,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:51,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:51,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:52,218 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-28 23:41:52,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:52,218 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2112933908] [2023-11-28 23:41:52,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2112933908] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:52,219 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:52,219 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:41:52,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [651431298] [2023-11-28 23:41:52,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:52,220 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:41:52,221 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:52,221 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:41:52,221 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:41:52,231 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 34 out of 67 [2023-11-28 23:41:52,231 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 292 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-28 23:41:52,231 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:52,232 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 34 of 67 [2023-11-28 23:41:52,232 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:41:54,355 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, 36#L881true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:54,355 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,355 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,355 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,356 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,357 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, 37#L883true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:54,357 INFO L294 olderBase$Statistics]: this new event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:54,357 INFO L297 olderBase$Statistics]: existing Event has 32 ancestors and is cut-off event [2023-11-28 23:41:55,018 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,018 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,018 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,018 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,018 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,044 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][77], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, 70#L795true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 51#L831true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, 49#L892true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-28 23:41:55,044 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,044 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,044 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,044 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,045 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,045 INFO L294 olderBase$Statistics]: this new event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,045 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,045 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,045 INFO L297 olderBase$Statistics]: existing Event has 33 ancestors and is cut-off event [2023-11-28 23:41:55,471 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][77], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 51#L831true, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, 49#L892true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-28 23:41:55,471 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,471 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,471 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,471 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,472 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), 70#L795true, P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,472 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,472 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,472 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,472 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,514 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, 50#P0EXITtrue, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 36#L881true, P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,514 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,514 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,514 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,515 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,516 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,516 INFO L294 olderBase$Statistics]: this new event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,516 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,516 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,516 INFO L297 olderBase$Statistics]: existing Event has 34 ancestors and is cut-off event [2023-11-28 23:41:55,950 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 37#L883true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 204#true, Black: 172#(= ~x~0 0), 23#L847true]) [2023-11-28 23:41:55,951 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,951 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,951 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,951 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,983 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][77], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 51#L831true, 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, 49#L892true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), 204#true, Black: 172#(= ~x~0 0)]) [2023-11-28 23:41:55,984 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,984 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,984 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,984 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,984 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 56#L778true, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, 10#L889true, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:55,985 INFO L294 olderBase$Statistics]: this new event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,985 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,985 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:55,985 INFO L297 olderBase$Statistics]: existing Event has 35 ancestors and is cut-off event [2023-11-28 23:41:56,397 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([389] L889-->L892: Formula: (= v_~main$tmp_guard1~0_2 (ite (= (ite (not (and (= v_~__unbuffered_p1_EAX~0_3 0) (= v_~__unbuffered_p3_EBX~0_3 0) (= v_~__unbuffered_p2_EAX~0_3 0) (= 2 v_~x~0_4) (= v_~__unbuffered_p3_EAX~0_3 1))) 1 0) 0) 0 1)) InVars {~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~x~0=v_~x~0_4} OutVars{~__unbuffered_p1_EAX~0=v_~__unbuffered_p1_EAX~0_3, ~__unbuffered_p3_EAX~0=v_~__unbuffered_p3_EAX~0_3, ~main$tmp_guard1~0=v_~main$tmp_guard1~0_2, ~__unbuffered_p2_EAX~0=v_~__unbuffered_p2_EAX~0_3, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_3, ~x~0=v_~x~0_4} AuxVars[] AssignedVars[~main$tmp_guard1~0][77], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 51#L831true, 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, 49#L892true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true]) [2023-11-28 23:41:56,398 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L292 olderBase$Statistics]: inserting event number 4 for the transition-marking pair ([470] L831-->L847: Formula: (let ((.cse10 (= (mod v_~b$r_buff1_thd4~0_66 256) 0)) (.cse7 (= (mod v_~b$r_buff0_thd4~0_68 256) 0))) (let ((.cse8 (not .cse7)) (.cse1 (and (= (mod v_~b$w_buff1_used~0_127 256) 0) .cse7)) (.cse3 (and .cse10 .cse7)) (.cse11 (= (mod v_~b$w_buff0_used~0_138 256) 0))) (let ((.cse4 (or .cse1 .cse3 .cse11)) (.cse5 (and .cse8 (not .cse11))) (.cse6 (= (mod v_~b$w_buff1_used~0_126 256) 0)) (.cse2 (= (mod v_~b$w_buff0_used~0_137 256) 0)) (.cse0 (not (= (mod v_~weak$$choice2~0_30 256) 0)))) (and (= (ite .cse0 v_~b$w_buff1_used~0_127 (ite (or .cse1 .cse2 .cse3) v_~b$w_buff1_used~0_127 0)) v_~b$w_buff1_used~0_126) (= v_~b$flush_delayed~0_33 0) (= (ite .cse0 v_~b$w_buff0_used~0_138 (ite .cse4 v_~b$w_buff0_used~0_138 (ite .cse5 0 v_~b$w_buff0_used~0_138))) v_~b$w_buff0_used~0_137) (= v_~b$w_buff1~0_44 v_~b$w_buff1~0_43) (= v_~b$w_buff0~0_53 v_~b$w_buff0~0_52) (= v_~b$mem_tmp~0_20 v_~b~0_73) (= (ite .cse0 v_~b$r_buff0_thd4~0_68 (ite (or (and .cse6 .cse7) .cse2 .cse3) v_~b$r_buff0_thd4~0_68 (ite (and .cse8 (not .cse2)) 0 v_~b$r_buff0_thd4~0_68))) v_~b$r_buff0_thd4~0_67) (= (ite .cse4 v_~b~0_73 (ite .cse5 v_~b$w_buff0~0_53 v_~b$w_buff1~0_44)) v_~__unbuffered_p3_EBX~0_18) (= v_~b$r_buff1_thd4~0_65 (ite .cse0 v_~b$r_buff1_thd4~0_66 (ite (let ((.cse9 (= (mod v_~b$r_buff0_thd4~0_67 256) 0))) (or (and .cse6 .cse9) .cse2 (and .cse10 .cse9))) v_~b$r_buff1_thd4~0_66 0))) (= v_~b~0_72 (ite .cse0 v_~b$mem_tmp~0_20 v_~__unbuffered_p3_EBX~0_18)))))) InVars {~b$w_buff0_used~0=v_~b$w_buff0_used~0_138, ~b~0=v_~b~0_73, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_127, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_66, ~b$w_buff1~0=v_~b$w_buff1~0_44, ~b$w_buff0~0=v_~b$w_buff0~0_53, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_68} OutVars{~b$mem_tmp~0=v_~b$mem_tmp~0_20, ~b$flush_delayed~0=v_~b$flush_delayed~0_33, ~__unbuffered_p3_EBX~0=v_~__unbuffered_p3_EBX~0_18, ~b$w_buff0_used~0=v_~b$w_buff0_used~0_137, P3Thread1of1ForFork3_#t~nondet3=|v_P3Thread1of1ForFork3_#t~nondet3_1|, ~weak$$choice0~0=v_~weak$$choice0~0_7, P3Thread1of1ForFork3_#t~nondet4=|v_P3Thread1of1ForFork3_#t~nondet4_1|, ~b~0=v_~b~0_72, ~b$w_buff1_used~0=v_~b$w_buff1_used~0_126, ~b$r_buff1_thd4~0=v_~b$r_buff1_thd4~0_65, ~b$w_buff1~0=v_~b$w_buff1~0_43, ~b$w_buff0~0=v_~b$w_buff0~0_52, ~weak$$choice2~0=v_~weak$$choice2~0_30, ~b$r_buff0_thd4~0=v_~b$r_buff0_thd4~0_67} AuxVars[] AssignedVars[~b$mem_tmp~0, ~b$flush_delayed~0, ~__unbuffered_p3_EBX~0, ~b$w_buff0_used~0, P3Thread1of1ForFork3_#t~nondet3, ~weak$$choice0~0, P3Thread1of1ForFork3_#t~nondet4, ~b~0, ~b$w_buff1_used~0, ~b$r_buff1_thd4~0, ~b$w_buff1~0, ~b$w_buff0~0, ~weak$$choice2~0, ~b$r_buff0_thd4~0][60], [Black: 173#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), 170#true, 33#L808true, Black: 155#(= ~__unbuffered_p3_EAX~0 0), P2Thread1of1ForFork1InUse, Black: 200#(and (= ~__unbuffered_cnt~0 0) (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), 50#P0EXITtrue, Black: 198#(and (<= ~main$tmp_guard0~0 (* (div ~main$tmp_guard0~0 256) 256)) (<= 0 ~main$tmp_guard0~0)), P1Thread1of1ForFork2InUse, P0Thread1of1ForFork0InUse, 10#L889true, P3Thread1of1ForFork3InUse, Black: 139#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 27#P1EXITtrue, Black: 137#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 195#true, Black: 133#(or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0))), Black: 183#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), Black: 185#(and (not (= (* 256 (div ~main$tmp_guard1~0 256)) ~main$tmp_guard1~0)) (<= (div ~main$tmp_guard1~0 256) 0) (not (= |ULTIMATE.start___VERIFIER_assert_~expression#1| 0)) (or (not (= ~__unbuffered_p1_EAX~0 0)) (not (= ~__unbuffered_p3_EAX~0 1)) (not (= 2 ~x~0)) (not (= ~__unbuffered_p3_EBX~0 0)) (not (= ~__unbuffered_p2_EAX~0 0)))), 126#(and (not (= |ULTIMATE.start_main_~#t970~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t971~0#1.base|)) (not (= |ULTIMATE.start_main_~#t971~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (= (store (store (store (store |#valid| |ULTIMATE.start_main_~#t969~0#1.base| 0) |ULTIMATE.start_main_~#t970~0#1.base| 0) |ULTIMATE.start_main_~#t971~0#1.base| 0) |ULTIMATE.start_main_~#t972~0#1.base| 0) |ULTIMATE.start_main_old_#valid#1|) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t969~0#1.base|)) (not (= |ULTIMATE.start_main_~#t972~0#1.base| |ULTIMATE.start_main_~#t970~0#1.base|))), Black: 172#(= ~x~0 0), 204#true, 23#L847true]) [2023-11-28 23:41:56,398 INFO L294 olderBase$Statistics]: this new event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:56,398 INFO L297 olderBase$Statistics]: existing Event has 36 ancestors and is cut-off event [2023-11-28 23:41:58,231 INFO L124 PetriNetUnfolderBase]: 28881/44928 cut-off events. [2023-11-28 23:41:58,231 INFO L125 PetriNetUnfolderBase]: For 36709/39627 co-relation queries the response was YES. [2023-11-28 23:41:58,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 117709 conditions, 44928 events. 28881/44928 cut-off events. For 36709/39627 co-relation queries the response was YES. Maximal size of possible extension queue 2350. Compared 373127 event pairs, 12841 based on Foata normal form. 908/42185 useless extension candidates. Maximal degree in co-relation 117685. Up to 17515 conditions per place. [2023-11-28 23:41:58,598 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 83 selfloop transitions, 10 changer transitions 0/124 dead transitions. [2023-11-28 23:41:58,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 124 transitions, 670 flow [2023-11-28 23:41:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:41:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:41:58,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 328 transitions. [2023-11-28 23:41:58,601 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6993603411513859 [2023-11-28 23:41:58,601 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 328 transitions. [2023-11-28 23:41:58,601 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 328 transitions. [2023-11-28 23:41:58,602 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:41:58,602 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 328 transitions. [2023-11-28 23:41:58,603 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.857142857142854) internal successors, (328), 7 states have internal predecessors, (328), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:58,605 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:58,605 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:58,605 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 292 flow. Second operand 7 states and 328 transitions. [2023-11-28 23:41:58,605 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 124 transitions, 670 flow [2023-11-28 23:41:58,665 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 77 places, 124 transitions, 664 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-28 23:41:58,667 INFO L231 Difference]: Finished difference. Result has 82 places, 68 transitions, 367 flow [2023-11-28 23:41:58,667 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=286, PETRI_DIFFERENCE_MINUEND_PLACES=71, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=63, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=367, PETRI_PLACES=82, PETRI_TRANSITIONS=68} [2023-11-28 23:41:58,668 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-28 23:41:58,668 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 68 transitions, 367 flow [2023-11-28 23:41:58,668 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-28 23:41:58,668 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:41:58,669 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] [2023-11-28 23:41:58,669 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-28 23:41:58,669 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-28 23:41:58,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:41:58,669 INFO L85 PathProgramCache]: Analyzing trace with hash -594031303, now seen corresponding path program 1 times [2023-11-28 23:41:58,670 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:41:58,670 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1073084434] [2023-11-28 23:41:58,670 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:41:58,670 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:41:58,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:41:58,969 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-28 23:41:58,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:41:58,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1073084434] [2023-11-28 23:41:58,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1073084434] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:41:58,970 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:41:58,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:41:58,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [607375356] [2023-11-28 23:41:58,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:41:58,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:41:58,972 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:41:58,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:41:58,973 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:41:58,985 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:41:58,986 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 68 transitions, 367 flow. Second operand has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:41:58,986 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:41:58,986 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:41:58,987 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:05,336 INFO L124 PetriNetUnfolderBase]: 32752/48935 cut-off events. [2023-11-28 23:42:05,337 INFO L125 PetriNetUnfolderBase]: For 41874/44409 co-relation queries the response was YES. [2023-11-28 23:42:05,512 INFO L83 FinitePrefix]: Finished finitePrefix Result has 131716 conditions, 48935 events. 32752/48935 cut-off events. For 41874/44409 co-relation queries the response was YES. Maximal size of possible extension queue 1893. Compared 360121 event pairs, 4614 based on Foata normal form. 2075/49434 useless extension candidates. Maximal degree in co-relation 131689. Up to 18653 conditions per place. [2023-11-28 23:42:05,606 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 74 selfloop transitions, 10 changer transitions 3/118 dead transitions. [2023-11-28 23:42:05,607 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 86 places, 118 transitions, 700 flow [2023-11-28 23:42:05,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:42:05,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:42:05,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-28 23:42:05,609 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-28 23:42:05,609 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-28 23:42:05,609 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-28 23:42:05,609 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:05,609 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-28 23:42:05,610 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:05,611 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:05,611 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:05,611 INFO L175 Difference]: Start difference. First operand has 82 places, 68 transitions, 367 flow. Second operand 5 states and 247 transitions. [2023-11-28 23:42:05,611 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 86 places, 118 transitions, 700 flow [2023-11-28 23:42:05,898 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 118 transitions, 687 flow, removed 4 selfloop flow, removed 1 redundant places. [2023-11-28 23:42:05,900 INFO L231 Difference]: Finished difference. Result has 87 places, 70 transitions, 393 flow [2023-11-28 23:42:05,900 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=354, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=68, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=393, PETRI_PLACES=87, PETRI_TRANSITIONS=70} [2023-11-28 23:42:05,901 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-11-28 23:42:05,901 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 70 transitions, 393 flow [2023-11-28 23:42:05,901 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:05,901 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:05,902 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] [2023-11-28 23:42:05,902 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-28 23:42:05,902 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-28 23:42:05,902 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:05,902 INFO L85 PathProgramCache]: Analyzing trace with hash -666749874, now seen corresponding path program 1 times [2023-11-28 23:42:05,902 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:05,902 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [117963553] [2023-11-28 23:42:05,902 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:05,903 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:05,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:06,112 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-28 23:42:06,112 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:06,112 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [117963553] [2023-11-28 23:42:06,112 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [117963553] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:06,112 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:06,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:42:06,113 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538691551] [2023-11-28 23:42:06,113 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:06,113 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:42:06,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:06,114 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:42:06,114 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:42:06,119 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:42:06,120 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 70 transitions, 393 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:06,120 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:06,120 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:42:06,120 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:10,700 INFO L124 PetriNetUnfolderBase]: 24408/36243 cut-off events. [2023-11-28 23:42:10,700 INFO L125 PetriNetUnfolderBase]: For 48893/50584 co-relation queries the response was YES. [2023-11-28 23:42:10,837 INFO L83 FinitePrefix]: Finished finitePrefix Result has 108623 conditions, 36243 events. 24408/36243 cut-off events. For 48893/50584 co-relation queries the response was YES. Maximal size of possible extension queue 1574. Compared 256033 event pairs, 2850 based on Foata normal form. 1245/36017 useless extension candidates. Maximal degree in co-relation 108593. Up to 12330 conditions per place. [2023-11-28 23:42:10,902 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 87 selfloop transitions, 14 changer transitions 2/134 dead transitions. [2023-11-28 23:42:10,902 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 90 places, 134 transitions, 820 flow [2023-11-28 23:42:10,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:42:10,903 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:42:10,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 298 transitions. [2023-11-28 23:42:10,904 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:42:10,905 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 298 transitions. [2023-11-28 23:42:10,905 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 298 transitions. [2023-11-28 23:42:10,905 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:10,905 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 298 transitions. [2023-11-28 23:42:10,906 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.666666666666664) internal successors, (298), 6 states have internal predecessors, (298), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:10,907 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:10,908 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:10,908 INFO L175 Difference]: Start difference. First operand has 87 places, 70 transitions, 393 flow. Second operand 6 states and 298 transitions. [2023-11-28 23:42:10,908 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 90 places, 134 transitions, 820 flow [2023-11-28 23:42:10,977 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 85 places, 134 transitions, 793 flow, removed 7 selfloop flow, removed 5 redundant places. [2023-11-28 23:42:10,979 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 452 flow [2023-11-28 23:42:10,979 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=367, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=70, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=452, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-11-28 23:42:10,979 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 13 predicate places. [2023-11-28 23:42:10,979 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 452 flow [2023-11-28 23:42:10,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:10,980 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:10,980 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] [2023-11-28 23:42:10,980 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-28 23:42:10,980 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-28 23:42:10,981 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:10,981 INFO L85 PathProgramCache]: Analyzing trace with hash 621142457, now seen corresponding path program 1 times [2023-11-28 23:42:10,981 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:10,981 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272344002] [2023-11-28 23:42:10,981 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:10,981 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:11,022 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:11,825 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-28 23:42:11,826 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:11,826 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272344002] [2023-11-28 23:42:11,826 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272344002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:11,826 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:11,826 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-28 23:42:11,827 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192575609] [2023-11-28 23:42:11,827 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:11,827 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-28 23:42:11,828 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:11,828 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-28 23:42:11,828 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-28 23:42:11,836 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:11,837 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 452 flow. Second operand has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:11,838 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:11,838 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:11,838 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:16,981 INFO L124 PetriNetUnfolderBase]: 23561/41086 cut-off events. [2023-11-28 23:42:16,982 INFO L125 PetriNetUnfolderBase]: For 68101/80112 co-relation queries the response was YES. [2023-11-28 23:42:17,149 INFO L83 FinitePrefix]: Finished finitePrefix Result has 121013 conditions, 41086 events. 23561/41086 cut-off events. For 68101/80112 co-relation queries the response was YES. Maximal size of possible extension queue 2650. Compared 393562 event pairs, 6942 based on Foata normal form. 1012/37913 useless extension candidates. Maximal degree in co-relation 120984. Up to 11797 conditions per place. [2023-11-28 23:42:17,421 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 74 selfloop transitions, 11 changer transitions 20/153 dead transitions. [2023-11-28 23:42:17,421 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 153 transitions, 940 flow [2023-11-28 23:42:17,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:42:17,422 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:42:17,423 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 424 transitions. [2023-11-28 23:42:17,424 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.703150912106136 [2023-11-28 23:42:17,424 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 424 transitions. [2023-11-28 23:42:17,424 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 424 transitions. [2023-11-28 23:42:17,424 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:17,424 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 424 transitions. [2023-11-28 23:42:17,426 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 47.111111111111114) internal successors, (424), 9 states have internal predecessors, (424), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:17,428 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:17,428 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:17,428 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 452 flow. Second operand 9 states and 424 transitions. [2023-11-28 23:42:17,429 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 153 transitions, 940 flow [2023-11-28 23:42:18,089 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 92 places, 153 transitions, 909 flow, removed 8 selfloop flow, removed 3 redundant places. [2023-11-28 23:42:18,091 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 481 flow [2023-11-28 23:42:18,091 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=421, PETRI_DIFFERENCE_MINUEND_PLACES=84, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=481, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2023-11-28 23:42:18,091 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 23 predicate places. [2023-11-28 23:42:18,091 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 481 flow [2023-11-28 23:42:18,092 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 38.111111111111114) internal successors, (343), 9 states have internal predecessors, (343), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:18,092 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:18,092 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] [2023-11-28 23:42:18,092 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-28 23:42:18,092 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-28 23:42:18,092 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:18,092 INFO L85 PathProgramCache]: Analyzing trace with hash -585132257, now seen corresponding path program 2 times [2023-11-28 23:42:18,093 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:18,093 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1224913739] [2023-11-28 23:42:18,093 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:18,093 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:18,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:18,426 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-28 23:42:18,426 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:18,426 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1224913739] [2023-11-28 23:42:18,426 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1224913739] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:18,427 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:18,427 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:42:18,427 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [476332735] [2023-11-28 23:42:18,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:18,427 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:42:18,428 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:18,428 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:42:18,428 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:42:18,433 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:42:18,434 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 481 flow. Second operand has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:18,434 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:18,434 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:42:18,434 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:26,313 INFO L124 PetriNetUnfolderBase]: 45498/67165 cut-off events. [2023-11-28 23:42:26,314 INFO L125 PetriNetUnfolderBase]: For 127141/129576 co-relation queries the response was YES. [2023-11-28 23:42:26,600 INFO L83 FinitePrefix]: Finished finitePrefix Result has 220263 conditions, 67165 events. 45498/67165 cut-off events. For 127141/129576 co-relation queries the response was YES. Maximal size of possible extension queue 3099. Compared 513231 event pairs, 4132 based on Foata normal form. 1234/66249 useless extension candidates. Maximal degree in co-relation 220229. Up to 25274 conditions per place. [2023-11-28 23:42:26,689 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 88 selfloop transitions, 18 changer transitions 17/152 dead transitions. [2023-11-28 23:42:26,689 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 152 transitions, 1031 flow [2023-11-28 23:42:26,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:42:26,690 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:42:26,691 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 327 transitions. [2023-11-28 23:42:26,691 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.697228144989339 [2023-11-28 23:42:26,691 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 327 transitions. [2023-11-28 23:42:26,691 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 327 transitions. [2023-11-28 23:42:26,691 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:26,691 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 327 transitions. [2023-11-28 23:42:26,692 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.714285714285715) internal successors, (327), 7 states have internal predecessors, (327), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:26,693 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:26,693 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:26,693 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 481 flow. Second operand 7 states and 327 transitions. [2023-11-28 23:42:26,693 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 152 transitions, 1031 flow [2023-11-28 23:42:31,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 93 places, 152 transitions, 1012 flow, removed 7 selfloop flow, removed 6 redundant places. [2023-11-28 23:42:31,281 INFO L231 Difference]: Finished difference. Result has 95 places, 78 transitions, 485 flow [2023-11-28 23:42:31,281 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=457, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=17, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=485, PETRI_PLACES=95, PETRI_TRANSITIONS=78} [2023-11-28 23:42:31,281 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 21 predicate places. [2023-11-28 23:42:31,281 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 78 transitions, 485 flow [2023-11-28 23:42:31,282 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.142857142857146) internal successors, (253), 7 states have internal predecessors, (253), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:31,282 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:31,282 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:31,282 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-28 23:42:31,282 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-28 23:42:31,282 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:31,282 INFO L85 PathProgramCache]: Analyzing trace with hash -1016417293, now seen corresponding path program 1 times [2023-11-28 23:42:31,282 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:31,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [323223449] [2023-11-28 23:42:31,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:31,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:31,326 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:32,437 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:42:32,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-28 23:42:32,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [323223449] [2023-11-28 23:42:32,437 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [323223449] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:32,437 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:32,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 23:42:32,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [442343374] [2023-11-28 23:42:32,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:32,438 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:42:32,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-28 23:42:32,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:42:32,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:42:32,450 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:32,450 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 78 transitions, 485 flow. Second operand has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:32,450 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:32,450 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:32,450 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:35,797 INFO L124 PetriNetUnfolderBase]: 16419/29210 cut-off events. [2023-11-28 23:42:35,797 INFO L125 PetriNetUnfolderBase]: For 59657/66939 co-relation queries the response was YES. [2023-11-28 23:42:35,941 INFO L83 FinitePrefix]: Finished finitePrefix Result has 91036 conditions, 29210 events. 16419/29210 cut-off events. For 59657/66939 co-relation queries the response was YES. Maximal size of possible extension queue 2120. Compared 278152 event pairs, 4645 based on Foata normal form. 418/26156 useless extension candidates. Maximal degree in co-relation 91004. Up to 13329 conditions per place. [2023-11-28 23:42:35,997 INFO L140 encePairwiseOnDemand]: 59/67 looper letters, 56 selfloop transitions, 8 changer transitions 16/129 dead transitions. [2023-11-28 23:42:35,997 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 101 places, 129 transitions, 806 flow [2023-11-28 23:42:35,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:42:35,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:42:35,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 401 transitions. [2023-11-28 23:42:35,999 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6650082918739635 [2023-11-28 23:42:35,999 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 401 transitions. [2023-11-28 23:42:35,999 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 401 transitions. [2023-11-28 23:42:36,000 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:36,000 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 401 transitions. [2023-11-28 23:42:36,001 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 44.55555555555556) internal successors, (401), 9 states have internal predecessors, (401), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:36,002 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:36,002 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:36,002 INFO L175 Difference]: Start difference. First operand has 95 places, 78 transitions, 485 flow. Second operand 9 states and 401 transitions. [2023-11-28 23:42:36,002 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 101 places, 129 transitions, 806 flow [2023-11-28 23:42:37,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 129 transitions, 723 flow, removed 30 selfloop flow, removed 7 redundant places. [2023-11-28 23:42:37,436 INFO L231 Difference]: Finished difference. Result has 98 places, 80 transitions, 459 flow [2023-11-28 23:42:37,436 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=412, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=70, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=459, PETRI_PLACES=98, PETRI_TRANSITIONS=80} [2023-11-28 23:42:37,437 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 24 predicate places. [2023-11-28 23:42:37,437 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 80 transitions, 459 flow [2023-11-28 23:42:37,437 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 38.0) internal successors, (380), 10 states have internal predecessors, (380), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:37,437 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:37,437 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:37,437 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-28 23:42:37,438 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK === [P0Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 13 more)] === [2023-11-28 23:42:37,438 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:37,438 INFO L85 PathProgramCache]: Analyzing trace with hash 165876361, now seen corresponding path program 2 times [2023-11-28 23:42:37,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-28 23:42:37,438 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1579072891] [2023-11-28 23:42:37,438 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:37,439 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-28 23:42:37,502 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:42:37,503 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:42:37,551 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:42:37,596 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-28 23:42:37,597 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:42:37,598 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 23:42:37,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 23:42:37,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 23:42:37,600 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 23:42:37,601 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 23:42:37,602 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 23:42:37,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-28 23:42:37,603 INFO L445 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:37,610 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:42:37,610 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:42:37,692 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:42:37,694 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:42:37,695 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:42:37,697 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 23:42:37,712 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:42:37,713 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:42:37,727 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:42:37 BasicIcfg [2023-11-28 23:42:37,728 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:42:37,728 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:42:37,728 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:42:37,728 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:42:37,729 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:41:15" (3/4) ... [2023-11-28 23:42:37,730 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:42:37,731 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:42:37,732 INFO L158 Benchmark]: Toolchain (without parser) took 83609.56ms. Allocated memory was 144.7MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 74.8MB in the beginning and 3.1GB in the end (delta: -3.1GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-28 23:42:37,732 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 144.7MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:42:37,733 INFO L158 Benchmark]: CACSL2BoogieTranslator took 694.35ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 74.6MB in the beginning and 145.5MB in the end (delta: -70.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2023-11-28 23:42:37,733 INFO L158 Benchmark]: Boogie Procedure Inliner took 69.51ms. Allocated memory is still 192.9MB. Free memory was 145.5MB in the beginning and 143.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:42:37,733 INFO L158 Benchmark]: Boogie Preprocessor took 74.68ms. Allocated memory is still 192.9MB. Free memory was 143.2MB in the beginning and 139.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:42:37,734 INFO L158 Benchmark]: RCFGBuilder took 897.67ms. Allocated memory is still 192.9MB. Free memory was 139.2MB in the beginning and 109.9MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. [2023-11-28 23:42:37,734 INFO L158 Benchmark]: TraceAbstraction took 81860.52ms. Allocated memory was 192.9MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 109.9MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. [2023-11-28 23:42:37,734 INFO L158 Benchmark]: Witness Printer took 3.48ms. Allocated memory is still 6.9GB. Free memory is still 3.1GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:42:37,736 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.19ms. Allocated memory is still 144.7MB. Free memory is still 117.5MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 694.35ms. Allocated memory was 144.7MB in the beginning and 192.9MB in the end (delta: 48.2MB). Free memory was 74.6MB in the beginning and 145.5MB in the end (delta: -70.9MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 69.51ms. Allocated memory is still 192.9MB. Free memory was 145.5MB in the beginning and 143.2MB in the end (delta: 2.3MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 74.68ms. Allocated memory is still 192.9MB. Free memory was 143.2MB in the beginning and 139.2MB in the end (delta: 4.0MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 897.67ms. Allocated memory is still 192.9MB. Free memory was 139.2MB in the beginning and 109.9MB in the end (delta: 29.3MB). Peak memory consumption was 29.4MB. Max. memory is 16.1GB. * TraceAbstraction took 81860.52ms. Allocated memory was 192.9MB in the beginning and 6.9GB in the end (delta: 6.7GB). Free memory was 109.9MB in the beginning and 3.1GB in the end (delta: -3.0GB). Peak memory consumption was 3.7GB. Max. memory is 16.1GB. * Witness Printer took 3.48ms. Allocated memory is still 6.9GB. Free memory is still 3.1GB. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={5:0}, t970={6:0}, t971={7:0}, t972={3:0}, weak$$choice2=0, x=2, y=1, z=1] [L893] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix037_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, 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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 81.6s, OverallIterations: 21, TraceHistogramMax: 1, PathProgramHistogramMax: 2, EmptinessCheckTime: 0.0s, AutomataDifference: 75.1s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 1388 SdHoareTripleChecker+Valid, 4.7s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 1191 mSDsluCounter, 275 SdHoareTripleChecker+Invalid, 4.0s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 188 mSDsCounter, 82 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 3662 IncrementalHoareTripleChecker+Invalid, 3744 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 82 mSolverCounterUnsat, 87 mSDtfsCounter, 3662 mSolverCounterSat, 0.1s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 115 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 98 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 1.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=485occurred in iteration=19, InterpolantAutomatonStates: 108, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.1s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 5.3s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 21 NumberOfCheckSat, 366 ConstructedInterpolants, 0 QuantifiedInterpolants, 2573 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 20 InterpolantComputations, 20 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-28 23:42:37,871 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-28 23:42:40,096 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-28 23:42:40,163 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-28 23:42:40,169 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-28 23:42:40,170 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-28 23:42:40,206 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-28 23:42:40,207 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-28 23:42:40,208 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-28 23:42:40,209 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-28 23:42:40,209 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-28 23:42:40,210 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-28 23:42:40,211 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-28 23:42:40,211 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-28 23:42:40,212 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-28 23:42:40,213 INFO L153 SettingsManager]: * Use SBE=true [2023-11-28 23:42:40,213 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-28 23:42:40,214 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-28 23:42:40,215 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-28 23:42:40,215 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-28 23:42:40,216 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-28 23:42:40,216 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-28 23:42:40,217 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-28 23:42:40,217 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-28 23:42:40,218 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-28 23:42:40,218 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-28 23:42:40,219 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-28 23:42:40,219 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-28 23:42:40,219 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-28 23:42:40,220 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-28 23:42:40,220 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-28 23:42:40,221 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-28 23:42:40,221 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-28 23:42:40,221 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-28 23:42:40,222 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-28 23:42:40,222 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:42:40,222 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-28 23:42:40,223 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-28 23:42:40,223 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-28 23:42:40,223 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-28 23:42:40,223 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-28 23:42:40,224 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-28 23:42:40,224 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-28 23:42:40,224 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-28 23:42:40,224 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-28 23:42:40,225 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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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 -> 82646a2180350347ed217a12e2836ec5fdce4b0371f5e0f7afa776fd6812fa0f [2023-11-28 23:42:40,527 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-28 23:42:40,549 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-28 23:42:40,552 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-28 23:42:40,553 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-28 23:42:40,554 INFO L274 PluginConnector]: CDTParser initialized [2023-11-28 23:42:40,555 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:42:43,374 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-28 23:42:43,653 INFO L384 CDTParser]: Found 1 translation units. [2023-11-28 23:42:43,653 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/sv-benchmarks/c/pthread-wmm/mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:42:43,672 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/ac3966e4f/5110d205d36a421faa21de8fa48769b3/FLAGd5e491898 [2023-11-28 23:42:43,688 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/data/ac3966e4f/5110d205d36a421faa21de8fa48769b3 [2023-11-28 23:42:43,691 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-28 23:42:43,692 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-28 23:42:43,694 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-28 23:42:43,694 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-28 23:42:43,700 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-28 23:42:43,700 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:43" (1/1) ... [2023-11-28 23:42:43,702 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7914f0b0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:43, skipping insertion in model container [2023-11-28 23:42:43,702 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.11 11:42:43" (1/1) ... [2023-11-28 23:42:43,758 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-28 23:42:44,145 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:42:44,162 INFO L202 MainTranslator]: Completed pre-run [2023-11-28 23:42:44,220 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-28 23:42:44,287 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:44,287 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-28 23:42:44,302 INFO L206 MainTranslator]: Completed translation [2023-11-28 23:42:44,303 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44 WrapperNode [2023-11-28 23:42:44,303 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-28 23:42:44,305 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-28 23:42:44,305 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-28 23:42:44,305 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-28 23:42:44,313 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,335 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,364 INFO L138 Inliner]: procedures = 180, calls = 72, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 152 [2023-11-28 23:42:44,365 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-28 23:42:44,366 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-28 23:42:44,367 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-28 23:42:44,367 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-28 23:42:44,379 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,379 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,384 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,407 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-28 23:42:44,407 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,407 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,419 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,421 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,425 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,428 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,433 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-28 23:42:44,434 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-28 23:42:44,434 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-28 23:42:44,434 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-28 23:42:44,435 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (1/1) ... [2023-11-28 23:42:44,442 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-28 23:42:44,453 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-28 23:42:44,466 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-28 23:42:44,473 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-28 23:42:44,506 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-28 23:42:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-28 23:42:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-28 23:42:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-28 23:42:44,507 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-28 23:42:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-28 23:42:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-28 23:42:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-28 23:42:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#4 [2023-11-28 23:42:44,508 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-28 23:42:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-28 23:42:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-28 23:42:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-28 23:42:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#4 [2023-11-28 23:42:44,509 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-28 23:42:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-28 23:42:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-28 23:42:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-28 23:42:44,510 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-28 23:42:44,510 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-28 23:42:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure P3 [2023-11-28 23:42:44,511 INFO L138 BoogieDeclarations]: Found implementation of procedure P3 [2023-11-28 23:42:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-28 23:42:44,511 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-28 23:42:44,511 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-28 23:42:44,513 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-28 23:42:44,690 INFO L241 CfgBuilder]: Building ICFG [2023-11-28 23:42:44,692 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-28 23:42:45,140 INFO L282 CfgBuilder]: Performing block encoding [2023-11-28 23:42:45,395 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-28 23:42:45,395 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-28 23:42:45,396 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:45 BoogieIcfgContainer [2023-11-28 23:42:45,396 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-28 23:42:45,399 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-28 23:42:45,399 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-28 23:42:45,402 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-28 23:42:45,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.11 11:42:43" (1/3) ... [2023-11-28 23:42:45,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533bf6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:42:45, skipping insertion in model container [2023-11-28 23:42:45,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.11 11:42:44" (2/3) ... [2023-11-28 23:42:45,404 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@533bf6c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.11 11:42:45, skipping insertion in model container [2023-11-28 23:42:45,404 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:45" (3/3) ... [2023-11-28 23:42:45,405 INFO L112 eAbstractionObserver]: Analyzing ICFG mix037_power.oepc_pso.oepc_rmo.oepc.i [2023-11-28 23:42:45,426 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-28 23:42:45,426 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 11 error locations. [2023-11-28 23:42:45,426 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-28 23:42:45,499 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-28 23:42:45,536 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 78 places, 67 transitions, 150 flow [2023-11-28 23:42:45,577 INFO L124 PetriNetUnfolderBase]: 2/63 cut-off events. [2023-11-28 23:42:45,577 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:42:45,582 INFO L83 FinitePrefix]: Finished finitePrefix Result has 76 conditions, 63 events. 2/63 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 130 event pairs, 0 based on Foata normal form. 0/50 useless extension candidates. Maximal degree in co-relation 64. Up to 2 conditions per place. [2023-11-28 23:42:45,583 INFO L82 GeneralOperation]: Start removeDead. Operand has 78 places, 67 transitions, 150 flow [2023-11-28 23:42:45,587 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 74 places, 63 transitions, 138 flow [2023-11-28 23:42:45,598 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-28 23:42:45,605 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;@aa15796, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-28 23:42:45,606 INFO L358 AbstractCegarLoop]: Starting to check reachability of 16 error locations. [2023-11-28 23:42:45,632 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-28 23:42:45,632 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-28 23:42:45,632 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-28 23:42:45,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:45,633 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:42:45,633 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-28 23:42:45,638 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:45,639 INFO L85 PathProgramCache]: Analyzing trace with hash 14430, now seen corresponding path program 1 times [2023-11-28 23:42:45,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:45,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [501379493] [2023-11-28 23:42:45,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:45,653 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-28 23:42:45,653 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:45,655 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:45,677 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:45,792 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:45,795 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:42:45,800 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:45,865 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-28 23:42:45,877 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-28 23:42:45,877 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:45,878 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:45,878 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [501379493] [2023-11-28 23:42:45,878 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [501379493] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:45,879 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:45,879 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:42:45,881 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [927186392] [2023-11-28 23:42:45,881 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:45,889 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:45,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:45,923 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:45,923 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:45,966 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:45,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 63 transitions, 138 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-28 23:42:45,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:45,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:45,970 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:47,260 INFO L124 PetriNetUnfolderBase]: 4217/7283 cut-off events. [2023-11-28 23:42:47,261 INFO L125 PetriNetUnfolderBase]: For 65/65 co-relation queries the response was YES. [2023-11-28 23:42:47,289 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 54556 event pairs, 3179 based on Foata normal form. 360/6916 useless extension candidates. Maximal degree in co-relation 13195. Up to 4391 conditions per place. [2023-11-28 23:42:47,345 INFO L140 encePairwiseOnDemand]: 62/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/70 dead transitions. [2023-11-28 23:42:47,345 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 70 transitions, 228 flow [2023-11-28 23:42:47,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:47,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:47,356 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:42:47,359 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:42:47,359 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:42:47,360 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:42:47,361 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:47,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:42:47,366 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:47,370 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:47,371 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:47,373 INFO L175 Difference]: Start difference. First operand has 74 places, 63 transitions, 138 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:42:47,374 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 70 transitions, 228 flow [2023-11-28 23:42:47,380 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 70 transitions, 224 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-28 23:42:47,383 INFO L231 Difference]: Finished difference. Result has 70 places, 59 transitions, 130 flow [2023-11-28 23:42:47,385 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=59, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=130, PETRI_PLACES=70, PETRI_TRANSITIONS=59} [2023-11-28 23:42:47,389 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -4 predicate places. [2023-11-28 23:42:47,390 INFO L495 AbstractCegarLoop]: Abstraction has has 70 places, 59 transitions, 130 flow [2023-11-28 23:42:47,390 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-28 23:42:47,390 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:47,390 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-28 23:42:47,399 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:47,591 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:47,591 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-28 23:42:47,592 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:47,592 INFO L85 PathProgramCache]: Analyzing trace with hash 14431, now seen corresponding path program 1 times [2023-11-28 23:42:47,592 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:47,593 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [233918362] [2023-11-28 23:42:47,593 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:47,593 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-28 23:42:47,593 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:47,594 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:47,595 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:47,696 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:47,698 INFO L262 TraceCheckSpWp]: Trace formula consists of 56 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:42:47,699 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:47,709 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-28 23:42:47,722 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-28 23:42:47,722 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:47,723 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:47,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [233918362] [2023-11-28 23:42:47,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [233918362] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:47,724 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:47,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:42:47,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1297358319] [2023-11-28 23:42:47,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:47,726 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:47,726 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:47,727 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:47,727 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:47,772 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:42:47,773 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 70 places, 59 transitions, 130 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-28 23:42:47,773 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:47,774 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:42:47,774 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:48,874 INFO L124 PetriNetUnfolderBase]: 4217/7282 cut-off events. [2023-11-28 23:42:48,874 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 23:42:48,898 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 54736 event pairs, 3179 based on Foata normal form. 1/6556 useless extension candidates. Maximal degree in co-relation 13375. Up to 4390 conditions per place. [2023-11-28 23:42:48,952 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/69 dead transitions. [2023-11-28 23:42:48,952 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 71 places, 69 transitions, 224 flow [2023-11-28 23:42:48,953 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:48,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:48,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:42:48,955 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:42:48,955 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:42:48,956 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:42:48,956 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:48,956 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:42:48,958 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:48,959 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:48,960 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:48,960 INFO L175 Difference]: Start difference. First operand has 70 places, 59 transitions, 130 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:42:48,960 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 71 places, 69 transitions, 224 flow [2023-11-28 23:42:48,972 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 69 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:48,975 INFO L231 Difference]: Finished difference. Result has 69 places, 58 transitions, 128 flow [2023-11-28 23:42:48,975 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=124, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=56, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=128, PETRI_PLACES=69, PETRI_TRANSITIONS=58} [2023-11-28 23:42:48,976 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -5 predicate places. [2023-11-28 23:42:48,976 INFO L495 AbstractCegarLoop]: Abstraction has has 69 places, 58 transitions, 128 flow [2023-11-28 23:42:48,977 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-28 23:42:48,977 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:48,977 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:42:48,979 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Ended with exit code 0 [2023-11-28 23:42:49,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:49,178 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-28 23:42:49,179 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:49,179 INFO L85 PathProgramCache]: Analyzing trace with hash 430325451, now seen corresponding path program 1 times [2023-11-28 23:42:49,179 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:49,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1015611782] [2023-11-28 23:42:49,180 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:49,180 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-28 23:42:49,180 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:49,181 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:49,183 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:49,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:49,276 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:42:49,278 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:49,284 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-28 23:42:49,291 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-28 23:42:49,291 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:49,291 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:49,291 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1015611782] [2023-11-28 23:42:49,292 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1015611782] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:49,292 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:49,292 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:49,292 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147477550] [2023-11-28 23:42:49,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:49,293 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:49,293 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:49,294 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:49,294 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:49,327 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:49,328 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 69 places, 58 transitions, 128 flow. Second operand has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:49,328 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:49,328 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:49,329 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:50,528 INFO L124 PetriNetUnfolderBase]: 4221/7245 cut-off events. [2023-11-28 23:42:50,528 INFO L125 PetriNetUnfolderBase]: For 180/180 co-relation queries the response was YES. [2023-11-28 23:42:50,550 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 417. Compared 54264 event pairs, 3251 based on Foata normal form. 0/6528 useless extension candidates. Maximal degree in co-relation 13347. Up to 4393 conditions per place. [2023-11-28 23:42:50,588 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 36 selfloop transitions, 2 changer transitions 0/68 dead transitions. [2023-11-28 23:42:50,588 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 68 transitions, 224 flow [2023-11-28 23:42:50,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:50,589 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:50,590 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 147 transitions. [2023-11-28 23:42:50,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7313432835820896 [2023-11-28 23:42:50,591 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 147 transitions. [2023-11-28 23:42:50,591 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 147 transitions. [2023-11-28 23:42:50,591 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:50,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 147 transitions. [2023-11-28 23:42:50,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.0) internal successors, (147), 3 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:50,594 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:50,594 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:50,594 INFO L175 Difference]: Start difference. First operand has 69 places, 58 transitions, 128 flow. Second operand 3 states and 147 transitions. [2023-11-28 23:42:50,595 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 68 transitions, 224 flow [2023-11-28 23:42:50,601 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 68 transitions, 220 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:50,602 INFO L231 Difference]: Finished difference. Result has 68 places, 57 transitions, 126 flow [2023-11-28 23:42:50,603 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=122, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=57, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=55, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=126, PETRI_PLACES=68, PETRI_TRANSITIONS=57} [2023-11-28 23:42:50,603 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-28 23:42:50,604 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 57 transitions, 126 flow [2023-11-28 23:42:50,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 37.333333333333336) internal successors, (112), 3 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:50,604 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:50,604 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:42:50,607 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:50,805 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:50,805 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-28 23:42:50,805 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:50,805 INFO L85 PathProgramCache]: Analyzing trace with hash 430325452, now seen corresponding path program 1 times [2023-11-28 23:42:50,806 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:50,806 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1375875445] [2023-11-28 23:42:50,806 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:50,806 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-28 23:42:50,806 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:50,807 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:50,808 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:50,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:50,900 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:42:50,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:50,910 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-28 23:42:50,922 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-28 23:42:50,922 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:50,923 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:50,923 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1375875445] [2023-11-28 23:42:50,923 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1375875445] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:50,923 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:50,923 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:50,923 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [581006085] [2023-11-28 23:42:50,924 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:50,924 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:50,924 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:50,925 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:50,925 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:50,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:42:50,969 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 57 transitions, 126 flow. Second operand has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:50,969 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:50,969 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:42:50,969 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:51,868 INFO L124 PetriNetUnfolderBase]: 4217/7272 cut-off events. [2023-11-28 23:42:51,868 INFO L125 PetriNetUnfolderBase]: For 184/184 co-relation queries the response was YES. [2023-11-28 23:42:51,888 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 55030 event pairs, 2503 based on Foata normal form. 5/6563 useless extension candidates. Maximal degree in co-relation 13370. Up to 4384 conditions per place. [2023-11-28 23:42:51,928 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 35 selfloop transitions, 2 changer transitions 0/67 dead transitions. [2023-11-28 23:42:51,928 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 69 places, 67 transitions, 220 flow [2023-11-28 23:42:51,928 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:51,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:51,930 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 149 transitions. [2023-11-28 23:42:51,930 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7412935323383084 [2023-11-28 23:42:51,931 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 149 transitions. [2023-11-28 23:42:51,931 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 149 transitions. [2023-11-28 23:42:51,931 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:51,931 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 149 transitions. [2023-11-28 23:42:51,932 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 49.666666666666664) internal successors, (149), 3 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:51,934 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:51,934 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:51,935 INFO L175 Difference]: Start difference. First operand has 68 places, 57 transitions, 126 flow. Second operand 3 states and 149 transitions. [2023-11-28 23:42:51,935 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 69 places, 67 transitions, 220 flow [2023-11-28 23:42:51,937 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 67 transitions, 216 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:51,939 INFO L231 Difference]: Finished difference. Result has 67 places, 56 transitions, 124 flow [2023-11-28 23:42:51,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=120, PETRI_DIFFERENCE_MINUEND_PLACES=65, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=56, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=54, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=124, PETRI_PLACES=67, PETRI_TRANSITIONS=56} [2023-11-28 23:42:51,940 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -7 predicate places. [2023-11-28 23:42:51,941 INFO L495 AbstractCegarLoop]: Abstraction has has 67 places, 56 transitions, 124 flow [2023-11-28 23:42:51,941 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.333333333333336) internal successors, (115), 3 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:51,941 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:51,941 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-28 23:42:51,945 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:52,142 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:52,142 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-28 23:42:52,143 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:52,143 INFO L85 PathProgramCache]: Analyzing trace with hash 430327105, now seen corresponding path program 1 times [2023-11-28 23:42:52,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:52,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1966855165] [2023-11-28 23:42:52,143 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:52,143 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-28 23:42:52,143 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:52,144 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:52,145 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:52,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:52,233 INFO L262 TraceCheckSpWp]: Trace formula consists of 75 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:42:52,234 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:52,245 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-28 23:42:52,246 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:52,246 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:52,246 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1966855165] [2023-11-28 23:42:52,246 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1966855165] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:52,247 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:52,247 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-28 23:42:52,247 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659202994] [2023-11-28 23:42:52,247 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:52,247 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:52,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:52,248 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:52,248 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:52,249 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 38 out of 67 [2023-11-28 23:42:52,249 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 67 places, 56 transitions, 124 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:52,249 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:52,249 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 38 of 67 [2023-11-28 23:42:52,249 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:53,027 INFO L124 PetriNetUnfolderBase]: 3311/5485 cut-off events. [2023-11-28 23:42:53,027 INFO L125 PetriNetUnfolderBase]: For 147/147 co-relation queries the response was YES. [2023-11-28 23:42:53,035 INFO L83 FinitePrefix]: Finished finitePrefix Result has 10310 conditions, 5485 events. 3311/5485 cut-off events. For 147/147 co-relation queries the response was YES. Maximal size of possible extension queue 326. Compared 38967 event pairs, 593 based on Foata normal form. 0/5382 useless extension candidates. Maximal degree in co-relation 10300. Up to 3661 conditions per place. [2023-11-28 23:42:53,056 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 41 selfloop transitions, 2 changer transitions 2/75 dead transitions. [2023-11-28 23:42:53,056 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 75 transitions, 262 flow [2023-11-28 23:42:53,057 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:53,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:53,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 160 transitions. [2023-11-28 23:42:53,058 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7960199004975125 [2023-11-28 23:42:53,058 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 160 transitions. [2023-11-28 23:42:53,058 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 160 transitions. [2023-11-28 23:42:53,058 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:53,059 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 160 transitions. [2023-11-28 23:42:53,059 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 53.333333333333336) internal successors, (160), 3 states have internal predecessors, (160), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,061 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,061 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,061 INFO L175 Difference]: Start difference. First operand has 67 places, 56 transitions, 124 flow. Second operand 3 states and 160 transitions. [2023-11-28 23:42:53,061 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 75 transitions, 262 flow [2023-11-28 23:42:53,063 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 75 transitions, 254 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:53,065 INFO L231 Difference]: Finished difference. Result has 66 places, 54 transitions, 120 flow [2023-11-28 23:42:53,065 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=55, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=120, PETRI_PLACES=66, PETRI_TRANSITIONS=54} [2023-11-28 23:42:53,066 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -8 predicate places. [2023-11-28 23:42:53,066 INFO L495 AbstractCegarLoop]: Abstraction has has 66 places, 54 transitions, 120 flow [2023-11-28 23:42:53,067 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,067 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:53,067 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:53,070 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:53,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:53,276 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-28 23:42:53,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:53,277 INFO L85 PathProgramCache]: Analyzing trace with hash -651421496, now seen corresponding path program 1 times [2023-11-28 23:42:53,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:53,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1047872816] [2023-11-28 23:42:53,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:53,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-28 23:42:53,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:53,279 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:53,281 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:53,369 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:53,371 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:42:53,373 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:53,377 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-28 23:42:53,382 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-28 23:42:53,383 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:53,383 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:53,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1047872816] [2023-11-28 23:42:53,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1047872816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:53,383 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:53,383 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:53,384 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [871810370] [2023-11-28 23:42:53,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:53,384 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:53,384 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:53,385 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:53,385 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:53,412 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:53,412 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 66 places, 54 transitions, 120 flow. Second operand has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,413 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:53,413 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:53,413 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:53,947 INFO L124 PetriNetUnfolderBase]: 2920/5209 cut-off events. [2023-11-28 23:42:53,947 INFO L125 PetriNetUnfolderBase]: For 281/281 co-relation queries the response was YES. [2023-11-28 23:42:53,958 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 302. Compared 38269 event pairs, 1356 based on Foata normal form. 0/4914 useless extension candidates. Maximal degree in co-relation 9634. Up to 3460 conditions per place. [2023-11-28 23:42:53,980 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/63 dead transitions. [2023-11-28 23:42:53,980 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 66 places, 63 transitions, 210 flow [2023-11-28 23:42:53,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:53,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:53,981 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 23:42:53,982 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-28 23:42:53,982 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 23:42:53,982 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 23:42:53,982 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:53,982 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 23:42:53,983 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,984 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,984 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,984 INFO L175 Difference]: Start difference. First operand has 66 places, 54 transitions, 120 flow. Second operand 3 states and 144 transitions. [2023-11-28 23:42:53,984 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 66 places, 63 transitions, 210 flow [2023-11-28 23:42:53,985 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 64 places, 63 transitions, 204 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:53,986 INFO L231 Difference]: Finished difference. Result has 64 places, 53 transitions, 118 flow [2023-11-28 23:42:53,986 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=114, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=51, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=118, PETRI_PLACES=64, PETRI_TRANSITIONS=53} [2023-11-28 23:42:53,987 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-28 23:42:53,987 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 53 transitions, 118 flow [2023-11-28 23:42:53,987 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.0) internal successors, (114), 3 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:53,988 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:53,988 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:53,991 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:42:54,188 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:54,189 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-28 23:42:54,189 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:54,189 INFO L85 PathProgramCache]: Analyzing trace with hash -651421495, now seen corresponding path program 1 times [2023-11-28 23:42:54,189 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:54,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [299778294] [2023-11-28 23:42:54,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:54,190 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-28 23:42:54,190 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:54,191 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:54,192 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:54,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:54,264 INFO L262 TraceCheckSpWp]: Trace formula consists of 99 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:42:54,265 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:54,271 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-28 23:42:54,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:42:54,281 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:54,281 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:54,281 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [299778294] [2023-11-28 23:42:54,281 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [299778294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:54,281 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:54,281 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:54,281 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [296825061] [2023-11-28 23:42:54,282 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:54,282 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:54,282 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:54,282 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:54,283 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:54,313 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:42:54,313 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 53 transitions, 118 flow. Second operand has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:54,314 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:54,314 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:42:54,314 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:54,844 INFO L124 PetriNetUnfolderBase]: 2903/5076 cut-off events. [2023-11-28 23:42:54,844 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 23:42:54,853 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9357 conditions, 5076 events. 2903/5076 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 36995 event pairs, 1620 based on Foata normal form. 12/4837 useless extension candidates. Maximal degree in co-relation 9347. Up to 3431 conditions per place. [2023-11-28 23:42:54,872 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/62 dead transitions. [2023-11-28 23:42:54,872 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 62 transitions, 204 flow [2023-11-28 23:42:54,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:54,873 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:54,873 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 23:42:54,873 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-28 23:42:54,873 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 23:42:54,873 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 23:42:54,874 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:54,874 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 23:42:54,874 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:54,875 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:54,875 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:54,875 INFO L175 Difference]: Start difference. First operand has 64 places, 53 transitions, 118 flow. Second operand 3 states and 146 transitions. [2023-11-28 23:42:54,875 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 62 transitions, 204 flow [2023-11-28 23:42:54,876 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 63 places, 62 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:54,877 INFO L231 Difference]: Finished difference. Result has 63 places, 52 transitions, 116 flow [2023-11-28 23:42:54,877 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=52, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=50, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=116, PETRI_PLACES=63, PETRI_TRANSITIONS=52} [2023-11-28 23:42:54,878 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -11 predicate places. [2023-11-28 23:42:54,878 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 52 transitions, 116 flow [2023-11-28 23:42:54,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.0) internal successors, (117), 3 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:54,878 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:54,878 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:54,881 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:42:55,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,079 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-28 23:42:55,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:55,079 INFO L85 PathProgramCache]: Analyzing trace with hash -1835099974, now seen corresponding path program 1 times [2023-11-28 23:42:55,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:55,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1050416269] [2023-11-28 23:42:55,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:55,080 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-28 23:42:55,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:55,081 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,082 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,164 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:55,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:42:55,168 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:55,172 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-28 23:42:55,177 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-28 23:42:55,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:55,178 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:55,178 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1050416269] [2023-11-28 23:42:55,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1050416269] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:55,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:55,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:55,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1226791803] [2023-11-28 23:42:55,179 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:55,179 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:55,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:55,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:55,179 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:55,207 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 36 out of 67 [2023-11-28 23:42:55,207 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 52 transitions, 116 flow. Second operand has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:55,207 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:55,208 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 36 of 67 [2023-11-28 23:42:55,208 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:55,714 INFO L124 PetriNetUnfolderBase]: 2978/5159 cut-off events. [2023-11-28 23:42:55,714 INFO L125 PetriNetUnfolderBase]: For 152/152 co-relation queries the response was YES. [2023-11-28 23:42:55,724 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 5159 events. 2978/5159 cut-off events. For 152/152 co-relation queries the response was YES. Maximal size of possible extension queue 301. Compared 37018 event pairs, 1424 based on Foata normal form. 0/4932 useless extension candidates. Maximal degree in co-relation 9541. Up to 3426 conditions per place. [2023-11-28 23:42:55,739 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 33 selfloop transitions, 2 changer transitions 0/61 dead transitions. [2023-11-28 23:42:55,740 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 61 transitions, 204 flow [2023-11-28 23:42:55,740 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:55,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:55,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 144 transitions. [2023-11-28 23:42:55,741 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7164179104477612 [2023-11-28 23:42:55,741 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 144 transitions. [2023-11-28 23:42:55,741 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 144 transitions. [2023-11-28 23:42:55,741 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:55,742 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 144 transitions. [2023-11-28 23:42:55,742 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.0) internal successors, (144), 3 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:55,743 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:55,743 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:55,743 INFO L175 Difference]: Start difference. First operand has 63 places, 52 transitions, 116 flow. Second operand 3 states and 144 transitions. [2023-11-28 23:42:55,743 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 61 transitions, 204 flow [2023-11-28 23:42:55,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 61 transitions, 200 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:55,745 INFO L231 Difference]: Finished difference. Result has 62 places, 51 transitions, 114 flow [2023-11-28 23:42:55,745 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=110, PETRI_DIFFERENCE_MINUEND_PLACES=60, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=51, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=49, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=114, PETRI_PLACES=62, PETRI_TRANSITIONS=51} [2023-11-28 23:42:55,746 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -12 predicate places. [2023-11-28 23:42:55,746 INFO L495 AbstractCegarLoop]: Abstraction has has 62 places, 51 transitions, 114 flow [2023-11-28 23:42:55,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 38.666666666666664) internal successors, (116), 3 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:55,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:55,746 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:42:55,749 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,947 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-28 23:42:55,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:55,947 INFO L85 PathProgramCache]: Analyzing trace with hash -1835099973, now seen corresponding path program 1 times [2023-11-28 23:42:55,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:55,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1153422508] [2023-11-28 23:42:55,948 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:55,948 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-28 23:42:55,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:55,949 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:55,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:56,035 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,038 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:42:56,040 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:56,048 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-28 23:42:56,059 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-28 23:42:56,059 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:56,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:56,060 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1153422508] [2023-11-28 23:42:56,060 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1153422508] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:56,060 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:56,060 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-28 23:42:56,060 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474254906] [2023-11-28 23:42:56,060 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:56,061 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-28 23:42:56,061 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:56,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-28 23:42:56,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-28 23:42:56,095 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:42:56,096 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 62 places, 51 transitions, 114 flow. Second operand has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,096 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:56,096 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:42:56,096 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:56,585 INFO L124 PetriNetUnfolderBase]: 2903/5108 cut-off events. [2023-11-28 23:42:56,586 INFO L125 PetriNetUnfolderBase]: For 168/168 co-relation queries the response was YES. [2023-11-28 23:42:56,596 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 302. Compared 37036 event pairs, 920 based on Foata normal form. 36/4953 useless extension candidates. Maximal degree in co-relation 9403. Up to 3315 conditions per place. [2023-11-28 23:42:56,610 INFO L140 encePairwiseOnDemand]: 64/67 looper letters, 32 selfloop transitions, 2 changer transitions 0/60 dead transitions. [2023-11-28 23:42:56,610 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 60 transitions, 200 flow [2023-11-28 23:42:56,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-28 23:42:56,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-28 23:42:56,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 146 transitions. [2023-11-28 23:42:56,611 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7263681592039801 [2023-11-28 23:42:56,611 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 146 transitions. [2023-11-28 23:42:56,611 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 146 transitions. [2023-11-28 23:42:56,612 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:56,612 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 146 transitions. [2023-11-28 23:42:56,612 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 48.666666666666664) internal successors, (146), 3 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,613 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,613 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 67.0) internal successors, (268), 4 states have internal predecessors, (268), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,613 INFO L175 Difference]: Start difference. First operand has 62 places, 51 transitions, 114 flow. Second operand 3 states and 146 transitions. [2023-11-28 23:42:56,613 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 60 transitions, 200 flow [2023-11-28 23:42:56,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 61 places, 60 transitions, 196 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:56,614 INFO L231 Difference]: Finished difference. Result has 61 places, 50 transitions, 112 flow [2023-11-28 23:42:56,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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-28 23:42:56,615 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -13 predicate places. [2023-11-28 23:42:56,615 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 50 transitions, 112 flow [2023-11-28 23:42:56,615 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 39.666666666666664) internal successors, (119), 3 states have internal predecessors, (119), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,615 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:56,615 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-28 23:42:56,618 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:56,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:56,816 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-28 23:42:56,816 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:56,816 INFO L85 PathProgramCache]: Analyzing trace with hash 1993943105, now seen corresponding path program 1 times [2023-11-28 23:42:56,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:56,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [12868479] [2023-11-28 23:42:56,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:56,817 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-28 23:42:56,817 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:56,818 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:56,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:56,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:56,927 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-28 23:42:56,928 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:56,964 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-28 23:42:56,964 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:56,964 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [12868479] [2023-11-28 23:42:56,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [12868479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:56,964 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:56,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-28 23:42:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [891392907] [2023-11-28 23:42:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:56,965 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-28 23:42:56,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-28 23:42:56,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-28 23:42:56,974 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:42:56,974 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 50 transitions, 112 flow. Second operand has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:56,974 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:56,974 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:42:56,974 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:42:58,520 INFO L124 PetriNetUnfolderBase]: 9971/15485 cut-off events. [2023-11-28 23:42:58,520 INFO L125 PetriNetUnfolderBase]: For 438/438 co-relation queries the response was YES. [2023-11-28 23:42:58,553 INFO L83 FinitePrefix]: Finished finitePrefix Result has 29710 conditions, 15485 events. 9971/15485 cut-off events. For 438/438 co-relation queries the response was YES. Maximal size of possible extension queue 862. Compared 112520 event pairs, 1033 based on Foata normal form. 400/15628 useless extension candidates. Maximal degree in co-relation 29700. Up to 8761 conditions per place. [2023-11-28 23:42:58,598 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 54 selfloop transitions, 6 changer transitions 1/82 dead transitions. [2023-11-28 23:42:58,598 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 82 transitions, 306 flow [2023-11-28 23:42:58,599 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-28 23:42:58,599 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-28 23:42:58,600 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 195 transitions. [2023-11-28 23:42:58,600 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7276119402985075 [2023-11-28 23:42:58,600 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 195 transitions. [2023-11-28 23:42:58,600 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 195 transitions. [2023-11-28 23:42:58,601 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:42:58,601 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 195 transitions. [2023-11-28 23:42:58,601 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 48.75) internal successors, (195), 4 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:58,602 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:58,602 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 67.0) internal successors, (335), 5 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:58,602 INFO L175 Difference]: Start difference. First operand has 61 places, 50 transitions, 112 flow. Second operand 4 states and 195 transitions. [2023-11-28 23:42:58,602 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 82 transitions, 306 flow [2023-11-28 23:42:58,610 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 82 transitions, 300 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-28 23:42:58,611 INFO L231 Difference]: Finished difference. Result has 64 places, 54 transitions, 150 flow [2023-11-28 23:42:58,611 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, 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=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=150, PETRI_PLACES=64, PETRI_TRANSITIONS=54} [2023-11-28 23:42:58,612 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -10 predicate places. [2023-11-28 23:42:58,612 INFO L495 AbstractCegarLoop]: Abstraction has has 64 places, 54 transitions, 150 flow [2023-11-28 23:42:58,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 36.5) internal successors, (146), 4 states have internal predecessors, (146), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:58,612 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:42:58,613 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-28 23:42:58,615 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:58,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:58,813 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-28 23:42:58,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:42:58,813 INFO L85 PathProgramCache]: Analyzing trace with hash -168680052, now seen corresponding path program 1 times [2023-11-28 23:42:58,814 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:42:58,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [230425711] [2023-11-28 23:42:58,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:42:58,814 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-28 23:42:58,814 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:42:58,815 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:58,816 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:42:58,925 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:42:58,928 INFO L262 TraceCheckSpWp]: Trace formula consists of 176 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-28 23:42:58,930 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:42:58,975 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-28 23:42:58,975 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:42:58,976 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:42:58,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [230425711] [2023-11-28 23:42:58,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [230425711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:42:58,976 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:42:58,976 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-28 23:42:58,976 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270495370] [2023-11-28 23:42:58,976 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:42:58,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:42:58,977 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:42:58,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:42:58,977 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:42:58,991 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:42:58,992 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 64 places, 54 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:42:58,992 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:42:58,992 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:42:58,992 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:00,048 INFO L124 PetriNetUnfolderBase]: 7427/11585 cut-off events. [2023-11-28 23:43:00,049 INFO L125 PetriNetUnfolderBase]: For 2580/2580 co-relation queries the response was YES. [2023-11-28 23:43:00,072 INFO L83 FinitePrefix]: Finished finitePrefix Result has 25513 conditions, 11585 events. 7427/11585 cut-off events. For 2580/2580 co-relation queries the response was YES. Maximal size of possible extension queue 611. Compared 79887 event pairs, 451 based on Foata normal form. 364/11753 useless extension candidates. Maximal degree in co-relation 25500. Up to 5521 conditions per place. [2023-11-28 23:43:00,104 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 69 selfloop transitions, 10 changer transitions 1/101 dead transitions. [2023-11-28 23:43:00,104 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 101 transitions, 433 flow [2023-11-28 23:43:00,104 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:43:00,104 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:43:00,105 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 247 transitions. [2023-11-28 23:43:00,105 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7373134328358208 [2023-11-28 23:43:00,105 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 247 transitions. [2023-11-28 23:43:00,106 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 247 transitions. [2023-11-28 23:43:00,106 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:00,106 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 247 transitions. [2023-11-28 23:43:00,106 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 49.4) internal successors, (247), 5 states have internal predecessors, (247), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:00,107 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:00,107 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:00,107 INFO L175 Difference]: Start difference. First operand has 64 places, 54 transitions, 150 flow. Second operand 5 states and 247 transitions. [2023-11-28 23:43:00,108 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 101 transitions, 433 flow [2023-11-28 23:43:00,110 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 66 places, 101 transitions, 422 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-28 23:43:00,111 INFO L231 Difference]: Finished difference. Result has 68 places, 58 transitions, 202 flow [2023-11-28 23:43:00,111 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=141, PETRI_DIFFERENCE_MINUEND_PLACES=62, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=54, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=202, PETRI_PLACES=68, PETRI_TRANSITIONS=58} [2023-11-28 23:43:00,112 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -6 predicate places. [2023-11-28 23:43:00,112 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 58 transitions, 202 flow [2023-11-28 23:43:00,112 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 36.4) internal successors, (182), 5 states have internal predecessors, (182), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:00,112 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:00,112 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-28 23:43:00,115 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:00,313 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:00,313 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-28 23:43:00,313 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:00,313 INFO L85 PathProgramCache]: Analyzing trace with hash -501197592, now seen corresponding path program 1 times [2023-11-28 23:43:00,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:00,314 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1504220496] [2023-11-28 23:43:00,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:00,314 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-28 23:43:00,314 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:00,314 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:00,315 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:00,425 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:00,429 INFO L262 TraceCheckSpWp]: Trace formula consists of 186 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:43:00,430 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:00,487 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-28 23:43:00,487 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:00,487 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:00,487 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1504220496] [2023-11-28 23:43:00,487 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1504220496] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:00,487 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:00,487 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:43:00,488 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1654916223] [2023-11-28 23:43:00,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:00,488 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:43:00,488 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:00,489 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:43:00,489 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:43:00,507 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:43:00,507 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 58 transitions, 202 flow. Second operand has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:00,507 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:00,507 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:43:00,507 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:01,283 INFO L124 PetriNetUnfolderBase]: 4491/6901 cut-off events. [2023-11-28 23:43:01,283 INFO L125 PetriNetUnfolderBase]: For 4846/4846 co-relation queries the response was YES. [2023-11-28 23:43:01,297 INFO L83 FinitePrefix]: Finished finitePrefix Result has 17135 conditions, 6901 events. 4491/6901 cut-off events. For 4846/4846 co-relation queries the response was YES. Maximal size of possible extension queue 268. Compared 41383 event pairs, 289 based on Foata normal form. 244/6984 useless extension candidates. Maximal degree in co-relation 17120. Up to 1969 conditions per place. [2023-11-28 23:43:01,315 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 82 selfloop transitions, 14 changer transitions 1/118 dead transitions. [2023-11-28 23:43:01,315 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 73 places, 118 transitions, 564 flow [2023-11-28 23:43:01,315 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:43:01,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:43:01,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2023-11-28 23:43:01,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7388059701492538 [2023-11-28 23:43:01,317 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 297 transitions. [2023-11-28 23:43:01,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 297 transitions. [2023-11-28 23:43:01,318 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:01,318 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 297 transitions. [2023-11-28 23:43:01,319 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 49.5) internal successors, (297), 6 states have internal predecessors, (297), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:01,320 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:01,320 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:01,321 INFO L175 Difference]: Start difference. First operand has 68 places, 58 transitions, 202 flow. Second operand 6 states and 297 transitions. [2023-11-28 23:43:01,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 73 places, 118 transitions, 564 flow [2023-11-28 23:43:01,341 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 69 places, 118 transitions, 534 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-28 23:43:01,343 INFO L231 Difference]: Finished difference. Result has 71 places, 62 transitions, 252 flow [2023-11-28 23:43:01,344 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=175, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=58, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=252, PETRI_PLACES=71, PETRI_TRANSITIONS=62} [2023-11-28 23:43:01,344 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-28 23:43:01,344 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 62 transitions, 252 flow [2023-11-28 23:43:01,345 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 36.166666666666664) internal successors, (217), 6 states have internal predecessors, (217), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:01,345 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:01,345 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-28 23:43:01,348 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:01,545 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:01,545 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-28 23:43:01,546 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:01,546 INFO L85 PathProgramCache]: Analyzing trace with hash -1317594222, now seen corresponding path program 1 times [2023-11-28 23:43:01,546 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:01,546 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [710426971] [2023-11-28 23:43:01,546 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:01,546 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-28 23:43:01,547 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:01,548 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:01,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:01,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:01,666 INFO L262 TraceCheckSpWp]: Trace formula consists of 196 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:43:01,668 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:01,740 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-28 23:43:01,740 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:01,740 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:01,741 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [710426971] [2023-11-28 23:43:01,741 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [710426971] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:01,741 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:01,741 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:43:01,741 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1126153552] [2023-11-28 23:43:01,741 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:01,741 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:43:01,742 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:01,742 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:43:01,742 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-28 23:43:01,752 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 33 out of 67 [2023-11-28 23:43:01,753 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 62 transitions, 252 flow. Second operand has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:01,753 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:01,753 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 33 of 67 [2023-11-28 23:43:01,753 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:02,468 INFO L124 PetriNetUnfolderBase]: 2927/4309 cut-off events. [2023-11-28 23:43:02,468 INFO L125 PetriNetUnfolderBase]: For 5022/5022 co-relation queries the response was YES. [2023-11-28 23:43:02,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 11832 conditions, 4309 events. 2927/4309 cut-off events. For 5022/5022 co-relation queries the response was YES. Maximal size of possible extension queue 201. Compared 22520 event pairs, 231 based on Foata normal form. 96/4251 useless extension candidates. Maximal degree in co-relation 11816. Up to 1316 conditions per place. [2023-11-28 23:43:02,488 INFO L140 encePairwiseOnDemand]: 60/67 looper letters, 73 selfloop transitions, 18 changer transitions 1/113 dead transitions. [2023-11-28 23:43:02,488 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 77 places, 113 transitions, 554 flow [2023-11-28 23:43:02,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:43:02,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:43:02,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 325 transitions. [2023-11-28 23:43:02,489 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6929637526652452 [2023-11-28 23:43:02,490 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 325 transitions. [2023-11-28 23:43:02,490 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 325 transitions. [2023-11-28 23:43:02,490 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:02,490 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 325 transitions. [2023-11-28 23:43:02,491 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 46.42857142857143) internal successors, (325), 7 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-28 23:43:02,492 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:02,492 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:02,492 INFO L175 Difference]: Start difference. First operand has 71 places, 62 transitions, 252 flow. Second operand 7 states and 325 transitions. [2023-11-28 23:43:02,492 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 77 places, 113 transitions, 554 flow [2023-11-28 23:43:02,514 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 113 transitions, 508 flow, removed 9 selfloop flow, removed 5 redundant places. [2023-11-28 23:43:02,515 INFO L231 Difference]: Finished difference. Result has 74 places, 62 transitions, 262 flow [2023-11-28 23:43:02,516 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=209, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=18, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=262, PETRI_PLACES=74, PETRI_TRANSITIONS=62} [2023-11-28 23:43:02,516 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 0 predicate places. [2023-11-28 23:43:02,516 INFO L495 AbstractCegarLoop]: Abstraction has has 74 places, 62 transitions, 262 flow [2023-11-28 23:43:02,517 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 36.0) internal successors, (252), 7 states have internal predecessors, (252), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:02,517 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:02,517 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:02,520 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:02,717 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:02,717 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-28 23:43:02,718 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:02,718 INFO L85 PathProgramCache]: Analyzing trace with hash -512069291, now seen corresponding path program 1 times [2023-11-28 23:43:02,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:02,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1863983032] [2023-11-28 23:43:02,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:02,718 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-28 23:43:02,718 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:02,719 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:02,720 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:02,929 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:02,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-28 23:43:02,938 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:03,866 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t972~0#1.base_43| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t971~0#1.base_57| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t969~0#1.base_69| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t970~0#1.base_65| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t969~0#1.base_69| (_ bv1 1)))) (let ((.cse1 (store .cse0 |v_ULTIMATE.start_main_~#t970~0#1.base_65| (_ bv1 1)))) (and (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t969~0#1.base_69|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t970~0#1.base_65|)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t969~0#1.base_69| (_ bv0 1)) |v_ULTIMATE.start_main_~#t970~0#1.base_65| (_ bv0 1)) |v_ULTIMATE.start_main_~#t971~0#1.base_57| (_ bv0 1)) |v_ULTIMATE.start_main_~#t972~0#1.base_43| (_ bv0 1))) (= (_ bv0 1) (select .cse1 |v_ULTIMATE.start_main_~#t971~0#1.base_57|)) (= (_ bv0 1) (select (store .cse1 |v_ULTIMATE.start_main_~#t971~0#1.base_57| (_ bv1 1)) |v_ULTIMATE.start_main_~#t972~0#1.base_43|)))))) is different from true [2023-11-28 23:43:03,867 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-28 23:43:03,868 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:03,868 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:03,868 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1863983032] [2023-11-28 23:43:03,868 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1863983032] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:03,868 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:03,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:43:03,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083065772] [2023-11-28 23:43:03,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:03,869 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-28 23:43:03,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:03,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-28 23:43:03,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=22, Unknown=1, NotChecked=8, Total=42 [2023-11-28 23:43:03,955 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 67 [2023-11-28 23:43:03,955 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 74 places, 62 transitions, 262 flow. Second operand has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:03,956 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:03,956 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 67 [2023-11-28 23:43:03,956 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:04,605 INFO L124 PetriNetUnfolderBase]: 1591/2819 cut-off events. [2023-11-28 23:43:04,605 INFO L125 PetriNetUnfolderBase]: For 1111/1196 co-relation queries the response was YES. [2023-11-28 23:43:04,617 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6293 conditions, 2819 events. 1591/2819 cut-off events. For 1111/1196 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 17277 event pairs, 249 based on Foata normal form. 16/2663 useless extension candidates. Maximal degree in co-relation 6275. Up to 1876 conditions per place. [2023-11-28 23:43:04,628 INFO L140 encePairwiseOnDemand]: 57/67 looper letters, 43 selfloop transitions, 9 changer transitions 0/85 dead transitions. [2023-11-28 23:43:04,628 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 85 transitions, 412 flow [2023-11-28 23:43:04,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-28 23:43:04,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-28 23:43:04,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2023-11-28 23:43:04,629 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4861407249466951 [2023-11-28 23:43:04,629 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 228 transitions. [2023-11-28 23:43:04,629 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 228 transitions. [2023-11-28 23:43:04,630 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:04,630 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 228 transitions. [2023-11-28 23:43:04,630 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 32.57142857142857) internal successors, (228), 7 states have internal predecessors, (228), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:04,631 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:04,631 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 67.0) internal successors, (536), 8 states have internal predecessors, (536), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:04,632 INFO L175 Difference]: Start difference. First operand has 74 places, 62 transitions, 262 flow. Second operand 7 states and 228 transitions. [2023-11-28 23:43:04,632 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 85 transitions, 412 flow [2023-11-28 23:43:04,638 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 70 places, 85 transitions, 316 flow, removed 17 selfloop flow, removed 10 redundant places. [2023-11-28 23:43:04,639 INFO L231 Difference]: Finished difference. Result has 71 places, 66 transitions, 207 flow [2023-11-28 23:43:04,639 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=166, PETRI_DIFFERENCE_MINUEND_PLACES=64, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=53, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=207, PETRI_PLACES=71, PETRI_TRANSITIONS=66} [2023-11-28 23:43:04,640 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, -3 predicate places. [2023-11-28 23:43:04,640 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 66 transitions, 207 flow [2023-11-28 23:43:04,640 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 28.428571428571427) internal successors, (199), 7 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:04,640 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:04,640 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:04,644 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Ended with exit code 0 [2023-11-28 23:43:04,841 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:04,841 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-28 23:43:04,841 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:04,841 INFO L85 PathProgramCache]: Analyzing trace with hash -1804663593, now seen corresponding path program 1 times [2023-11-28 23:43:04,841 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:04,842 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1187627353] [2023-11-28 23:43:04,842 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-28 23:43:04,842 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-28 23:43:04,842 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:04,843 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:04,844 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:04,979 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-28 23:43:04,984 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-28 23:43:04,987 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:05,628 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-28 23:43:05,628 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:05,629 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:05,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1187627353] [2023-11-28 23:43:05,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1187627353] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:05,629 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:05,629 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-28 23:43:05,629 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730199359] [2023-11-28 23:43:05,629 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:05,630 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-28 23:43:05,630 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:05,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-28 23:43:05,631 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2023-11-28 23:43:05,652 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 37 out of 67 [2023-11-28 23:43:05,653 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 66 transitions, 207 flow. Second operand has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 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-28 23:43:05,653 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:05,653 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 37 of 67 [2023-11-28 23:43:05,653 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:06,437 INFO L124 PetriNetUnfolderBase]: 2271/3811 cut-off events. [2023-11-28 23:43:06,437 INFO L125 PetriNetUnfolderBase]: For 1167/1391 co-relation queries the response was YES. [2023-11-28 23:43:06,445 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9122 conditions, 3811 events. 2271/3811 cut-off events. For 1167/1391 co-relation queries the response was YES. Maximal size of possible extension queue 213. Compared 23653 event pairs, 439 based on Foata normal form. 16/3591 useless extension candidates. Maximal degree in co-relation 9109. Up to 1499 conditions per place. [2023-11-28 23:43:06,455 INFO L140 encePairwiseOnDemand]: 58/67 looper letters, 78 selfloop transitions, 9 changer transitions 0/124 dead transitions. [2023-11-28 23:43:06,455 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 79 places, 124 transitions, 582 flow [2023-11-28 23:43:06,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-28 23:43:06,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-28 23:43:06,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 413 transitions. [2023-11-28 23:43:06,457 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6849087893864013 [2023-11-28 23:43:06,457 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 413 transitions. [2023-11-28 23:43:06,457 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 413 transitions. [2023-11-28 23:43:06,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:06,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 413 transitions. [2023-11-28 23:43:06,459 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-28 23:43:06,460 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:06,460 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 67.0) internal successors, (670), 10 states have internal predecessors, (670), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:06,460 INFO L175 Difference]: Start difference. First operand has 71 places, 66 transitions, 207 flow. Second operand 9 states and 413 transitions. [2023-11-28 23:43:06,460 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 79 places, 124 transitions, 582 flow [2023-11-28 23:43:06,462 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 74 places, 124 transitions, 552 flow, removed 0 selfloop flow, removed 5 redundant places. [2023-11-28 23:43:06,463 INFO L231 Difference]: Finished difference. Result has 78 places, 71 transitions, 244 flow [2023-11-28 23:43:06,463 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=194, PETRI_DIFFERENCE_MINUEND_PLACES=66, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=66, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=244, PETRI_PLACES=78, PETRI_TRANSITIONS=71} [2023-11-28 23:43:06,463 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 4 predicate places. [2023-11-28 23:43:06,464 INFO L495 AbstractCegarLoop]: Abstraction has has 78 places, 71 transitions, 244 flow [2023-11-28 23:43:06,464 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 39.0) internal successors, (390), 10 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-28 23:43:06,464 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:06,464 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:06,468 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:43:06,664 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:06,664 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-28 23:43:06,665 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:06,665 INFO L85 PathProgramCache]: Analyzing trace with hash -234080203, now seen corresponding path program 2 times [2023-11-28 23:43:06,665 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:06,665 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [618257096] [2023-11-28 23:43:06,665 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-28 23:43:06,665 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-28 23:43:06,665 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:06,666 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:06,667 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:06,782 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:43:06,782 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:43:06,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-28 23:43:06,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:06,818 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-28 23:43:06,818 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:06,818 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:06,818 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [618257096] [2023-11-28 23:43:06,818 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [618257096] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:06,818 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:06,818 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-28 23:43:06,818 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320090063] [2023-11-28 23:43:06,819 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:06,819 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-28 23:43:06,819 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:06,820 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-28 23:43:06,820 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-28 23:43:06,826 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-28 23:43:06,826 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 78 places, 71 transitions, 244 flow. Second operand has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:06,827 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:06,827 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-28 23:43:06,827 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:07,673 INFO L124 PetriNetUnfolderBase]: 5038/8432 cut-off events. [2023-11-28 23:43:07,673 INFO L125 PetriNetUnfolderBase]: For 3444/3901 co-relation queries the response was YES. [2023-11-28 23:43:07,700 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20923 conditions, 8432 events. 5038/8432 cut-off events. For 3444/3901 co-relation queries the response was YES. Maximal size of possible extension queue 451. Compared 58970 event pairs, 2293 based on Foata normal form. 29/7924 useless extension candidates. Maximal degree in co-relation 20906. Up to 3585 conditions per place. [2023-11-28 23:43:07,727 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 67 selfloop transitions, 8 changer transitions 0/110 dead transitions. [2023-11-28 23:43:07,727 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 82 places, 110 transitions, 546 flow [2023-11-28 23:43:07,727 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-28 23:43:07,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-28 23:43:07,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 233 transitions. [2023-11-28 23:43:07,728 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6955223880597015 [2023-11-28 23:43:07,729 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 233 transitions. [2023-11-28 23:43:07,729 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 233 transitions. [2023-11-28 23:43:07,729 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:07,729 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 233 transitions. [2023-11-28 23:43:07,730 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 46.6) internal successors, (233), 5 states have internal predecessors, (233), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:07,730 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:07,730 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 67.0) internal successors, (402), 6 states have internal predecessors, (402), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:07,731 INFO L175 Difference]: Start difference. First operand has 78 places, 71 transitions, 244 flow. Second operand 5 states and 233 transitions. [2023-11-28 23:43:07,731 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 82 places, 110 transitions, 546 flow [2023-11-28 23:43:07,744 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 79 places, 110 transitions, 538 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-28 23:43:07,745 INFO L231 Difference]: Finished difference. Result has 82 places, 78 transitions, 320 flow [2023-11-28 23:43:07,746 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=238, PETRI_DIFFERENCE_MINUEND_PLACES=75, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=71, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=320, PETRI_PLACES=82, PETRI_TRANSITIONS=78} [2023-11-28 23:43:07,746 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 8 predicate places. [2023-11-28 23:43:07,746 INFO L495 AbstractCegarLoop]: Abstraction has has 82 places, 78 transitions, 320 flow [2023-11-28 23:43:07,746 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 39.4) internal successors, (197), 5 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:07,746 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:07,747 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:07,750 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:43:07,947 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:07,947 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-28 23:43:07,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:07,947 INFO L85 PathProgramCache]: Analyzing trace with hash 946956541, now seen corresponding path program 3 times [2023-11-28 23:43:07,948 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:07,948 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1760013182] [2023-11-28 23:43:07,948 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-28 23:43:07,948 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-28 23:43:07,948 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:07,949 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:07,950 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:08,066 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-28 23:43:08,066 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:43:08,072 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:43:08,073 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:08,123 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-28 23:43:08,123 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:08,123 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:08,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1760013182] [2023-11-28 23:43:08,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1760013182] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:08,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:08,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:43:08,124 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435975599] [2023-11-28 23:43:08,124 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:08,124 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:43:08,124 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:08,125 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:43:08,125 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:43:08,133 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-28 23:43:08,134 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 82 places, 78 transitions, 320 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:08,134 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:08,134 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-28 23:43:08,134 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:09,724 INFO L124 PetriNetUnfolderBase]: 10249/16715 cut-off events. [2023-11-28 23:43:09,725 INFO L125 PetriNetUnfolderBase]: For 7384/8152 co-relation queries the response was YES. [2023-11-28 23:43:09,794 INFO L83 FinitePrefix]: Finished finitePrefix Result has 42060 conditions, 16715 events. 10249/16715 cut-off events. For 7384/8152 co-relation queries the response was YES. Maximal size of possible extension queue 956. Compared 124609 event pairs, 1764 based on Foata normal form. 16/15701 useless extension candidates. Maximal degree in co-relation 42041. Up to 6450 conditions per place. [2023-11-28 23:43:09,848 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 82 selfloop transitions, 14 changer transitions 0/132 dead transitions. [2023-11-28 23:43:09,848 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 132 transitions, 761 flow [2023-11-28 23:43:09,849 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:43:09,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:43:09,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 276 transitions. [2023-11-28 23:43:09,850 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6865671641791045 [2023-11-28 23:43:09,850 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 276 transitions. [2023-11-28 23:43:09,850 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 276 transitions. [2023-11-28 23:43:09,851 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:09,851 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 276 transitions. [2023-11-28 23:43:09,851 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 46.0) internal successors, (276), 6 states have internal predecessors, (276), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:09,852 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:09,852 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:09,852 INFO L175 Difference]: Start difference. First operand has 82 places, 78 transitions, 320 flow. Second operand 6 states and 276 transitions. [2023-11-28 23:43:09,852 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 132 transitions, 761 flow [2023-11-28 23:43:09,866 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 86 places, 132 transitions, 759 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:43:09,868 INFO L231 Difference]: Finished difference. Result has 90 places, 91 transitions, 507 flow [2023-11-28 23:43:09,868 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=318, PETRI_DIFFERENCE_MINUEND_PLACES=81, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=78, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=64, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=507, PETRI_PLACES=90, PETRI_TRANSITIONS=91} [2023-11-28 23:43:09,868 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 16 predicate places. [2023-11-28 23:43:09,868 INFO L495 AbstractCegarLoop]: Abstraction has has 90 places, 91 transitions, 507 flow [2023-11-28 23:43:09,868 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:09,869 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:09,869 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:09,872 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:10,069 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:10,069 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-28 23:43:10,069 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:10,070 INFO L85 PathProgramCache]: Analyzing trace with hash 2026152291, now seen corresponding path program 4 times [2023-11-28 23:43:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:10,070 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1448903922] [2023-11-28 23:43:10,070 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-28 23:43:10,070 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-28 23:43:10,070 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:10,071 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:10,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:10,195 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-28 23:43:10,195 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-28 23:43:10,201 INFO L262 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-28 23:43:10,202 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-28 23:43:10,241 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-28 23:43:10,242 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-28 23:43:10,242 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-28 23:43:10,242 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1448903922] [2023-11-28 23:43:10,242 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1448903922] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-28 23:43:10,242 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-28 23:43:10,242 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-28 23:43:10,242 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1889844230] [2023-11-28 23:43:10,242 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-28 23:43:10,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-28 23:43:10,243 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-28 23:43:10,243 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-28 23:43:10,243 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-28 23:43:10,251 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 35 out of 67 [2023-11-28 23:43:10,251 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 90 places, 91 transitions, 507 flow. Second operand has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:10,251 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-28 23:43:10,251 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 35 of 67 [2023-11-28 23:43:10,252 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-28 23:43:13,325 INFO L124 PetriNetUnfolderBase]: 17929/29576 cut-off events. [2023-11-28 23:43:13,325 INFO L125 PetriNetUnfolderBase]: For 17362/18066 co-relation queries the response was YES. [2023-11-28 23:43:13,458 INFO L83 FinitePrefix]: Finished finitePrefix Result has 75699 conditions, 29576 events. 17929/29576 cut-off events. For 17362/18066 co-relation queries the response was YES. Maximal size of possible extension queue 1815. Compared 242563 event pairs, 3516 based on Foata normal form. 16/27736 useless extension candidates. Maximal degree in co-relation 75676. Up to 11457 conditions per place. [2023-11-28 23:43:13,544 INFO L140 encePairwiseOnDemand]: 61/67 looper letters, 88 selfloop transitions, 26 changer transitions 0/151 dead transitions. [2023-11-28 23:43:13,544 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 95 places, 151 transitions, 1139 flow [2023-11-28 23:43:13,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-28 23:43:13,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-28 23:43:13,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 271 transitions. [2023-11-28 23:43:13,546 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6741293532338308 [2023-11-28 23:43:13,546 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 271 transitions. [2023-11-28 23:43:13,546 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 271 transitions. [2023-11-28 23:43:13,546 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-28 23:43:13,546 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 271 transitions. [2023-11-28 23:43:13,547 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 45.166666666666664) internal successors, (271), 6 states have internal predecessors, (271), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:13,548 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:13,548 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 67.0) internal successors, (469), 7 states have internal predecessors, (469), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:13,549 INFO L175 Difference]: Start difference. First operand has 90 places, 91 transitions, 507 flow. Second operand 6 states and 271 transitions. [2023-11-28 23:43:13,549 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 95 places, 151 transitions, 1139 flow [2023-11-28 23:43:13,635 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 151 transitions, 1138 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-28 23:43:13,638 INFO L231 Difference]: Finished difference. Result has 98 places, 116 transitions, 943 flow [2023-11-28 23:43:13,638 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=67, PETRI_DIFFERENCE_MINUEND_FLOW=506, PETRI_DIFFERENCE_MINUEND_PLACES=89, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=91, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=65, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=943, PETRI_PLACES=98, PETRI_TRANSITIONS=116} [2023-11-28 23:43:13,639 INFO L281 CegarLoopForPetriNet]: 74 programPoint places, 24 predicate places. [2023-11-28 23:43:13,639 INFO L495 AbstractCegarLoop]: Abstraction has has 98 places, 116 transitions, 943 flow [2023-11-28 23:43:13,639 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 38.666666666666664) internal successors, (232), 6 states have internal predecessors, (232), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-28 23:43:13,639 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-28 23:43:13,639 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:13,642 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:13,839 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:13,840 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-28 23:43:13,840 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-28 23:43:13,840 INFO L85 PathProgramCache]: Analyzing trace with hash -1377342433, now seen corresponding path program 5 times [2023-11-28 23:43:13,840 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-28 23:43:13,841 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1225308823] [2023-11-28 23:43:13,841 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-28 23:43:13,841 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-28 23:43:13,841 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-28 23:43:13,842 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:13,843 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:14,002 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-28 23:43:14,002 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-28 23:43:14,002 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-28 23:43:14,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-28 23:43:14,157 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-28 23:43:14,157 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-28 23:43:14,158 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr8ASSERT_VIOLATIONMEMORY_LEAK (15 of 16 remaining) [2023-11-28 23:43:14,159 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (14 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (13 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (12 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (11 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 16 remaining) [2023-11-28 23:43:14,160 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9ASSERT_VIOLATIONMEMORY_LEAK (5 of 16 remaining) [2023-11-28 23:43:14,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (4 of 16 remaining) [2023-11-28 23:43:14,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 16 remaining) [2023-11-28 23:43:14,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 16 remaining) [2023-11-28 23:43:14,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 16 remaining) [2023-11-28 23:43:14,161 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P0Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 16 remaining) [2023-11-28 23:43:14,165 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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)] Forceful destruction successful, exit code 0 [2023-11-28 23:43:14,361 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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-28 23:43:14,362 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-28 23:43:14,366 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-28 23:43:14,366 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-28 23:43:14,440 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-28 23:43:14,443 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-28 23:43:14,447 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-28 23:43:14,450 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre11 could not be translated [2023-11-28 23:43:14,463 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:43:14,464 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-28 23:43:14,480 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.11 11:43:14 BasicIcfg [2023-11-28 23:43:14,480 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-28 23:43:14,480 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-28 23:43:14,481 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-28 23:43:14,481 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-28 23:43:14,481 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.11 11:42:45" (3/4) ... [2023-11-28 23:43:14,483 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-28 23:43:14,484 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-28 23:43:14,484 INFO L158 Benchmark]: Toolchain (without parser) took 30791.97ms. Allocated memory was 86.0MB in the beginning and 1.8GB in the end (delta: 1.7GB). Free memory was 60.8MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 467.1MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,484 INFO L158 Benchmark]: CDTParser took 0.20ms. Allocated memory is still 86.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:43:14,485 INFO L158 Benchmark]: CACSL2BoogieTranslator took 609.79ms. Allocated memory was 86.0MB in the beginning and 157.3MB in the end (delta: 71.3MB). Free memory was 60.6MB in the beginning and 130.2MB in the end (delta: -69.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,485 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.65ms. Allocated memory is still 157.3MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,485 INFO L158 Benchmark]: Boogie Preprocessor took 67.20ms. Allocated memory is still 157.3MB. Free memory was 127.5MB in the beginning and 123.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,485 INFO L158 Benchmark]: RCFGBuilder took 962.52ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 94.1MB in the end (delta: 29.2MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,486 INFO L158 Benchmark]: TraceAbstraction took 29081.22ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 93.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 426.1MB. Max. memory is 16.1GB. [2023-11-28 23:43:14,486 INFO L158 Benchmark]: Witness Printer took 3.33ms. Allocated memory is still 1.8GB. Free memory is still 1.3GB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-28 23:43:14,488 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.20ms. Allocated memory is still 86.0MB. Free memory is still 62.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 609.79ms. Allocated memory was 86.0MB in the beginning and 157.3MB in the end (delta: 71.3MB). Free memory was 60.6MB in the beginning and 130.2MB in the end (delta: -69.6MB). Peak memory consumption was 26.9MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.65ms. Allocated memory is still 157.3MB. Free memory was 129.6MB in the beginning and 127.5MB in the end (delta: 2.1MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 67.20ms. Allocated memory is still 157.3MB. Free memory was 127.5MB in the beginning and 123.3MB in the end (delta: 4.2MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 962.52ms. Allocated memory is still 157.3MB. Free memory was 123.3MB in the beginning and 94.1MB in the end (delta: 29.2MB). Peak memory consumption was 39.3MB. Max. memory is 16.1GB. * TraceAbstraction took 29081.22ms. Allocated memory was 157.3MB in the beginning and 1.8GB in the end (delta: 1.6GB). Free memory was 93.2MB in the beginning and 1.3GB in the end (delta: -1.2GB). Peak memory consumption was 426.1MB. Max. memory is 16.1GB. * Witness Printer took 3.33ms. 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_p1_EAX = 0; [L714] 0 int __unbuffered_p2_EAX = 0; [L716] 0 int __unbuffered_p3_EAX = 0; [L718] 0 int __unbuffered_p3_EBX = 0; [L720] 0 int a = 0; [L722] 0 int b = 0; [L723] 0 _Bool b$flush_delayed; [L724] 0 int b$mem_tmp; [L725] 0 _Bool b$r_buff0_thd0; [L726] 0 _Bool b$r_buff0_thd1; [L727] 0 _Bool b$r_buff0_thd2; [L728] 0 _Bool b$r_buff0_thd3; [L729] 0 _Bool b$r_buff0_thd4; [L730] 0 _Bool b$r_buff1_thd0; [L731] 0 _Bool b$r_buff1_thd1; [L732] 0 _Bool b$r_buff1_thd2; [L733] 0 _Bool b$r_buff1_thd3; [L734] 0 _Bool b$r_buff1_thd4; [L735] 0 _Bool b$read_delayed; [L736] 0 int *b$read_delayed_var; [L737] 0 int b$w_buff0; [L738] 0 _Bool b$w_buff0_used; [L739] 0 int b$w_buff1; [L740] 0 _Bool b$w_buff1_used; [L741] 0 _Bool main$tmp_guard0; [L742] 0 _Bool main$tmp_guard1; [L744] 0 int x = 0; [L746] 0 int y = 0; [L748] 0 int z = 0; [L749] 0 _Bool weak$$choice0; [L750] 0 _Bool weak$$choice2; [L871] 0 pthread_t t969; [L872] FCALL, FORK 0 pthread_create(&t969, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=0, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=0, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={3:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L754] 1 b$w_buff1 = b$w_buff0 [L755] 1 b$w_buff0 = 1 [L756] 1 b$w_buff1_used = b$w_buff0_used [L757] 1 b$w_buff0_used = (_Bool)1 [L758] CALL 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L18] COND FALSE 1 !(!expression) [L758] RET 1 __VERIFIER_assert(!(b$w_buff1_used && b$w_buff0_used)) [L759] 1 b$r_buff1_thd0 = b$r_buff0_thd0 [L760] 1 b$r_buff1_thd1 = b$r_buff0_thd1 [L761] 1 b$r_buff1_thd2 = b$r_buff0_thd2 [L762] 1 b$r_buff1_thd3 = b$r_buff0_thd3 [L763] 1 b$r_buff1_thd4 = b$r_buff0_thd4 [L764] 1 b$r_buff0_thd1 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L873] 0 pthread_t t970; [L874] FCALL, FORK 0 pthread_create(&t970, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={3:0}, t970={5:0}, weak$$choice0=0, weak$$choice2=0, x=0, y=0, z=0] [L767] 1 x = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=1, y=0, z=0] [L784] 2 x = 2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L787] 2 __unbuffered_p1_EAX = y VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L790] 2 b = b$w_buff0_used && b$r_buff0_thd2 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd2 ? b$w_buff1 : b) [L791] 2 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$w_buff0_used [L792] 2 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$w_buff1_used [L793] 2 b$r_buff0_thd2 = b$w_buff0_used && b$r_buff0_thd2 ? (_Bool)0 : b$r_buff0_thd2 [L794] 2 b$r_buff1_thd2 = b$w_buff0_used && b$r_buff0_thd2 || b$w_buff1_used && b$r_buff1_thd2 ? (_Bool)0 : b$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L875] 0 pthread_t t971; [L876] FCALL, FORK 0 pthread_create(&t971, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={3:0}, t970={5:0}, t971={7:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=0, z=0] [L804] 3 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L807] 3 __unbuffered_p2_EAX = z VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L877] 0 pthread_t t972; [L878] FCALL, FORK 0 pthread_create(&t972, ((void *)0), P3, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, t969={3:0}, t970={5:0}, t971={7:0}, t972={-2147483645:0}, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L810] 3 b = b$w_buff0_used && b$r_buff0_thd3 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd3 ? b$w_buff1 : b) [L811] 3 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$w_buff0_used [L812] 3 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$w_buff1_used [L813] 3 b$r_buff0_thd3 = b$w_buff0_used && b$r_buff0_thd3 ? (_Bool)0 : b$r_buff0_thd3 [L814] 3 b$r_buff1_thd3 = b$w_buff0_used && b$r_buff0_thd3 || b$w_buff1_used && b$r_buff1_thd3 ? (_Bool)0 : b$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=0] [L824] 4 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L827] 4 a = 1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=0, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L830] 4 __unbuffered_p3_EAX = a VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x=2, y=1, z=1] [L833] 4 weak$$choice0 = __VERIFIER_nondet_bool() [L834] 4 weak$$choice2 = __VERIFIER_nondet_bool() [L835] 4 b$flush_delayed = weak$$choice2 [L836] 4 b$mem_tmp = b [L837] 4 b = !b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff1) [L838] 4 b$w_buff0 = weak$$choice2 ? b$w_buff0 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : b$w_buff0)) [L839] 4 b$w_buff1 = weak$$choice2 ? b$w_buff1 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1 : (b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff1 : b$w_buff1)) [L840] 4 b$w_buff0_used = weak$$choice2 ? b$w_buff0_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff0_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used)) [L841] 4 b$w_buff1_used = weak$$choice2 ? b$w_buff1_used : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$w_buff1_used : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L842] 4 b$r_buff0_thd4 = weak$$choice2 ? b$r_buff0_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff0_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4)) [L843] 4 b$r_buff1_thd4 = weak$$choice2 ? b$r_buff1_thd4 : (!b$w_buff0_used || !b$r_buff0_thd4 && !b$w_buff1_used || !b$r_buff0_thd4 && !b$r_buff1_thd4 ? b$r_buff1_thd4 : (b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : (_Bool)0)) [L844] 4 __unbuffered_p3_EBX = b [L845] 4 b = b$flush_delayed ? b$mem_tmp : b [L846] 4 b$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=1, b$w_buff1=0, b$w_buff1_used=0, b=0, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L770] 1 b = b$w_buff0_used && b$r_buff0_thd1 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd1 ? b$w_buff1 : b) [L771] 1 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$w_buff0_used [L772] 1 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$w_buff1_used [L773] 1 b$r_buff0_thd1 = b$w_buff0_used && b$r_buff0_thd1 ? (_Bool)0 : b$r_buff0_thd1 [L774] 1 b$r_buff1_thd1 = b$w_buff0_used && b$r_buff0_thd1 || b$w_buff1_used && b$r_buff1_thd1 ? (_Bool)0 : b$r_buff1_thd1 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L849] 4 b = b$w_buff0_used && b$r_buff0_thd4 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd4 ? b$w_buff1 : b) [L850] 4 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$w_buff0_used [L851] 4 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$w_buff1_used [L852] 4 b$r_buff0_thd4 = b$w_buff0_used && b$r_buff0_thd4 ? (_Bool)0 : b$r_buff0_thd4 [L853] 4 b$r_buff1_thd4 = b$w_buff0_used && b$r_buff0_thd4 || b$w_buff1_used && b$r_buff1_thd4 ? (_Bool)0 : b$r_buff1_thd4 VAL [__unbuffered_cnt=0, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L777] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L797] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L817] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L856] 4 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L880] 0 main$tmp_guard0 = __unbuffered_cnt == 4 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={3:0}, t970={5:0}, t971={7:0}, t972={-2147483645:0}, weak$$choice2=0, x=2, y=1, z=1] [L882] CALL 0 assume_abort_if_not(main$tmp_guard0) [L3] COND FALSE 0 !(!cond) [L882] RET 0 assume_abort_if_not(main$tmp_guard0) [L884] 0 b = b$w_buff0_used && b$r_buff0_thd0 ? b$w_buff0 : (b$w_buff1_used && b$r_buff1_thd0 ? b$w_buff1 : b) [L885] 0 b$w_buff0_used = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$w_buff0_used [L886] 0 b$w_buff1_used = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$w_buff1_used [L887] 0 b$r_buff0_thd0 = b$w_buff0_used && b$r_buff0_thd0 ? (_Bool)0 : b$r_buff0_thd0 [L888] 0 b$r_buff1_thd0 = b$w_buff0_used && b$r_buff0_thd0 || b$w_buff1_used && b$r_buff1_thd0 ? (_Bool)0 : b$r_buff1_thd0 VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={3:0}, t970={5:0}, t971={7:0}, t972={-2147483645:0}, weak$$choice2=0, x=2, y=1, z=1] [L891] 0 main$tmp_guard1 = !(x == 2 && __unbuffered_p1_EAX == 0 && __unbuffered_p2_EAX == 0 && __unbuffered_p3_EAX == 1 && __unbuffered_p3_EBX == 0) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, t969={3:0}, t970={5:0}, t971={7:0}, t972={-2147483645:0}, weak$$choice2=0, x=2, y=1, z=1] [L893] 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_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, z=1] [L17] 0 __assert_fail ("0", "mix037_power.oepc_pso.oepc_rmo.oepc.c", 8, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=4, __unbuffered_p1_EAX=0, __unbuffered_p2_EAX=0, __unbuffered_p3_EAX=1, __unbuffered_p3_EBX=0, a=1, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, b$flush_delayed=0, b$mem_tmp=0, b$r_buff0_thd0=0, b$r_buff0_thd1=1, b$r_buff0_thd2=0, b$r_buff0_thd3=0, b$r_buff0_thd4=0, b$r_buff1_thd0=0, b$r_buff1_thd1=0, b$r_buff1_thd2=0, b$r_buff1_thd3=0, b$r_buff1_thd4=0, b$read_delayed=0, b$read_delayed_var={0:0}, b$w_buff0=1, b$w_buff0_used=0, b$w_buff1=0, b$w_buff1_used=0, b=1, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x=2, y=1, 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: 869]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 876]: 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: 874]: 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: 872]: 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: 878]: Unable to prove that petrification did provide enough thread instances (tool internal message) Unable to prove that petrification did provide enough thread instances (tool internal message) Reason: Not analyzed. - StatisticsResult: Ultimate Automizer benchmark data with 1 thread instances CFG has 9 procedures, 101 locations, 16 error locations. Started 1 CEGAR loops. EmptinessCheckTime: 0.0s, RemoveRedundantFlowTime: 0.0s, RemoveRedundantFlowUnfoldingTime: 0.0s, BackfoldingTime: 0.0s, BackfoldingUnfoldingTime: 0.0s, FlowIncreaseByBackfolding: 0, BasicCegarLoop: OverallTime: 28.8s, OverallIterations: 19, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 20.3s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 969 SdHoareTripleChecker+Valid, 3.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 803 mSDsluCounter, 105 SdHoareTripleChecker+Invalid, 2.7s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 83 IncrementalHoareTripleChecker+Unchecked, 83 mSDsCounter, 60 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 2584 IncrementalHoareTripleChecker+Invalid, 2727 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 60 mSolverCounterUnsat, 22 mSDtfsCounter, 2584 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 392 GetRequests, 323 SyntacticMatches, 0 SemanticMatches, 69 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=943occurred in iteration=18, InterpolantAutomatonStates: 82, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: No data available, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.3s SsaConstructionTime, 1.0s SatisfiabilityAnalysisTime, 2.2s InterpolantComputationTime, 429 NumberOfCodeBlocks, 429 NumberOfCodeBlocksAsserted, 19 NumberOfCheckSat, 368 ConstructedInterpolants, 1 QuantifiedInterpolants, 2876 SizeOfPredicates, 18 NumberOfNonLiveVariables, 2560 ConjunctsInSsa, 103 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-28 23:43:14,511 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_275f60f1-d68e-4c53-9b80-3632ce9cabf1/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