./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/pthread-wmm/safe031_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-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:32,928 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:33,066 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-26 11:50:33,071 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:33,072 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:33,115 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:33,117 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:33,118 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:33,119 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:33,125 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:33,125 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:33,126 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:33,126 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:33,128 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:33,129 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:33,129 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:33,129 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:33,130 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:33,130 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:33,131 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:33,131 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:50:33,132 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:50:33,132 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:50:33,133 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:33,133 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:50:33,133 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:50:33,134 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:33,134 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:33,135 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:33,136 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:33,137 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:33,137 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:33,137 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:33,138 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:33,138 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:33,138 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-26 11:50:33,138 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-26 11:50:33,139 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:33,139 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:33,139 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:33,139 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:33,140 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_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2023-11-26 11:50:33,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:33,510 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:33,513 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:33,514 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:33,515 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:33,516 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:36,737 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:37,024 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:37,024 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:37,046 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/c39833da2/ceee818449094dbd8d9a5ec6ae0d8557/FLAG54ce69cdc [2023-11-26 11:50:37,062 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/c39833da2/ceee818449094dbd8d9a5ec6ae0d8557 [2023-11-26 11:50:37,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:37,067 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:37,069 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:37,069 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:37,085 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:37,086 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,088 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2f53e4a5 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37, skipping insertion in model container [2023-11-26 11:50:37,088 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,168 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:37,596 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:37,611 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:37,682 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:37,721 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:37,722 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:37,730 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:37,731 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37 WrapperNode [2023-11-26 11:50:37,731 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:37,733 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:37,733 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:37,733 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:37,742 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,761 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,795 INFO L138 Inliner]: procedures = 176, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 132 [2023-11-26 11:50:37,796 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:37,797 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:37,797 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:37,797 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:37,811 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,812 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,817 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,846 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:50:37,865 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,865 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,882 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,884 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,887 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,890 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,895 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:37,896 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:37,896 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:37,896 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:37,897 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (1/1) ... [2023-11-26 11:50:37,904 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:37,920 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:37,935 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:37,972 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:37,990 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2023-11-26 11:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2023-11-26 11:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2023-11-26 11:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#3 [2023-11-26 11:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:50:37,991 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:50:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:50:37,992 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:50:37,992 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:50:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:50:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:50:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:50:37,993 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:50:37,993 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-26 11:50:37,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-26 11:50:37,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-26 11:50:37,994 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#3 [2023-11-26 11:50:37,994 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:50:37,995 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:37,995 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:37,997 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:50:38,163 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:38,166 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:38,606 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:38,902 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:38,907 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:50:38,908 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:38 BoogieIcfgContainer [2023-11-26 11:50:38,908 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:38,911 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:38,913 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:38,917 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:38,917 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:37" (1/3) ... [2023-11-26 11:50:38,918 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd53123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:38, skipping insertion in model container [2023-11-26 11:50:38,918 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:37" (2/3) ... [2023-11-26 11:50:38,919 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@3bd53123 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:38, skipping insertion in model container [2023-11-26 11:50:38,919 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:38" (3/3) ... [2023-11-26 11:50:38,920 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:38,940 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:38,941 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:50:38,941 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:50:39,002 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:50:39,045 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:39,080 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 11:50:39,080 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:39,084 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-26 11:50:39,085 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:39,089 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 11:50:39,102 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:39,110 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;@33e122db, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:39,111 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:50:39,114 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:50:39,114 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:50:39,115 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:39,115 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:39,116 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:39,116 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:39,122 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:39,122 INFO L85 PathProgramCache]: Analyzing trace with hash 12020, now seen corresponding path program 1 times [2023-11-26 11:50:39,134 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:39,134 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035137254] [2023-11-26 11:50:39,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:39,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:39,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:39,522 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:39,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:39,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035137254] [2023-11-26 11:50:39,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035137254] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:39,525 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:39,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:39,527 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1987777662] [2023-11-26 11:50:39,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:39,539 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:39,547 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:39,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:39,587 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:39,636 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:39,640 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:39,640 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:39,640 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:39,641 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:40,202 INFO L124 PetriNetUnfolderBase]: 772/1569 cut-off events. [2023-11-26 11:50:40,203 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:50:40,212 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1569 events. 772/1569 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 580 based on Foata normal form. 90/1507 useless extension candidates. Maximal degree in co-relation 2768. Up to 888 conditions per place. [2023-11-26 11:50:40,228 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:50:40,229 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-26 11:50:40,232 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:40,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:40,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:50:40,248 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:50:40,250 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,250 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,252 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:40,255 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,259 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:40,269 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,270 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,272 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:50:40,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-26 11:50:40,279 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:40,288 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:40,290 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:50:40,296 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 11:50:40,297 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:40,297 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,297 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:40,297 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:40,298 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-26 11:50:40,298 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:40,301 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:40,301 INFO L85 PathProgramCache]: Analyzing trace with hash 12021, now seen corresponding path program 1 times [2023-11-26 11:50:40,301 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:40,302 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1837853099] [2023-11-26 11:50:40,302 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:40,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:40,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:40,475 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:40,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:40,476 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1837853099] [2023-11-26 11:50:40,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1837853099] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:40,476 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:40,477 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:40,477 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1727977007] [2023-11-26 11:50:40,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:40,478 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:40,478 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:40,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:40,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:40,499 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:50:40,500 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,501 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:40,501 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:50:40,501 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:40,920 INFO L124 PetriNetUnfolderBase]: 772/1568 cut-off events. [2023-11-26 11:50:40,920 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:50:40,924 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1568 events. 772/1568 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11041 event pairs, 580 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 2813. Up to 887 conditions per place. [2023-11-26 11:50:40,937 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 11:50:40,937 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-26 11:50:40,938 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:40,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:40,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:50:40,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:50:40,943 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,943 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,945 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:40,945 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:50:40,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:40,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,949 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,951 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:50:40,952 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-26 11:50:40,955 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:40,957 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:50:40,957 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:50:40,958 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 11:50:40,959 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:50:40,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:40,959 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:40,964 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:40,964 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-26 11:50:40,965 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:40,966 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:40,966 INFO L85 PathProgramCache]: Analyzing trace with hash 358453275, now seen corresponding path program 1 times [2023-11-26 11:50:40,966 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:40,966 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083793490] [2023-11-26 11:50:40,966 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:40,967 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:41,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:41,089 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:41,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:41,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083793490] [2023-11-26 11:50:41,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083793490] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:41,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:41,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:41,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2059268363] [2023-11-26 11:50:41,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:41,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:41,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:41,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:41,094 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:41,112 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:41,112 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,113 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:41,113 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:41,113 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:41,424 INFO L124 PetriNetUnfolderBase]: 774/1552 cut-off events. [2023-11-26 11:50:41,424 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:50:41,428 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2813 conditions, 1552 events. 774/1552 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10902 event pairs, 595 based on Foata normal form. 0/1405 useless extension candidates. Maximal degree in co-relation 2802. Up to 888 conditions per place. [2023-11-26 11:50:41,439 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 11:50:41,439 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-26 11:50:41,440 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:41,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:41,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 11:50:41,443 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 11:50:41,444 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 11:50:41,444 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 11:50:41,444 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:41,444 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 11:50:41,446 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:41,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,449 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,449 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-26 11:50:41,449 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-26 11:50:41,452 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:41,454 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 11:50:41,454 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 11:50:41,456 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 11:50:41,456 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 11:50:41,456 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,456 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:41,456 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:50:41,456 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-26 11:50:41,457 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:41,457 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:41,457 INFO L85 PathProgramCache]: Analyzing trace with hash 358453276, now seen corresponding path program 1 times [2023-11-26 11:50:41,458 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:41,458 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [285703310] [2023-11-26 11:50:41,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:41,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:41,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:41,586 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:41,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [285703310] [2023-11-26 11:50:41,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [285703310] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:41,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:41,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:41,592 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2132432841] [2023-11-26 11:50:41,592 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:41,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:41,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:41,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:41,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:41,610 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:50:41,611 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,611 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:41,611 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:50:41,611 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:41,915 INFO L124 PetriNetUnfolderBase]: 772/1562 cut-off events. [2023-11-26 11:50:41,916 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-26 11:50:41,920 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2820 conditions, 1562 events. 772/1562 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11045 event pairs, 438 based on Foata normal form. 3/1420 useless extension candidates. Maximal degree in co-relation 2810. Up to 883 conditions per place. [2023-11-26 11:50:41,930 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 11:50:41,931 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-26 11:50:41,931 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:41,931 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:41,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:50:41,933 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:50:41,933 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:50:41,933 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:50:41,934 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:41,934 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:50:41,935 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:41,936 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,936 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,936 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:50:41,936 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-26 11:50:41,938 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:41,940 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 11:50:41,940 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 11:50:41,942 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-26 11:50:41,942 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 11:50:41,942 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:41,942 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:41,943 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:41,943 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-26 11:50:41,944 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:41,944 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:41,944 INFO L85 PathProgramCache]: Analyzing trace with hash 1393182645, now seen corresponding path program 1 times [2023-11-26 11:50:41,944 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:41,945 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1227828525] [2023-11-26 11:50:41,945 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:41,945 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:41,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:42,137 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:42,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:42,138 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1227828525] [2023-11-26 11:50:42,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1227828525] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:42,142 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:42,143 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:42,143 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [664412806] [2023-11-26 11:50:42,143 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:42,144 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:42,144 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:42,145 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-26 11:50:42,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:42,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-26 11:50:42,148 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:42,389 INFO L124 PetriNetUnfolderBase]: 603/1165 cut-off events. [2023-11-26 11:50:42,389 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-26 11:50:42,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 1165 events. 603/1165 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 7642 event pairs, 96 based on Foata normal form. 0/1147 useless extension candidates. Maximal degree in co-relation 2151. Up to 742 conditions per place. [2023-11-26 11:50:42,399 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-26 11:50:42,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 192 flow [2023-11-26 11:50:42,400 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:42,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:42,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-26 11:50:42,401 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2023-11-26 11:50:42,401 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-26 11:50:42,401 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-26 11:50:42,401 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:42,402 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-26 11:50:42,402 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,403 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,403 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,404 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 124 transitions. [2023-11-26 11:50:42,404 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 192 flow [2023-11-26 11:50:42,405 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:42,406 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-26 11:50:42,406 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-26 11:50:42,407 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:50:42,407 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-26 11:50:42,407 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,407 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:42,407 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:42,408 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-26 11:50:42,408 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:42,408 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:42,408 INFO L85 PathProgramCache]: Analyzing trace with hash 1393181611, now seen corresponding path program 1 times [2023-11-26 11:50:42,408 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:42,409 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1829588865] [2023-11-26 11:50:42,409 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:42,409 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:42,427 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:42,485 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:42,485 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:42,485 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1829588865] [2023-11-26 11:50:42,486 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1829588865] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:42,486 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:42,486 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:42,486 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302930275] [2023-11-26 11:50:42,486 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:42,487 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:42,487 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:42,487 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:42,487 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:42,502 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:50:42,502 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,502 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:42,502 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:50:42,503 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:42,733 INFO L124 PetriNetUnfolderBase]: 528/1117 cut-off events. [2023-11-26 11:50:42,734 INFO L125 PetriNetUnfolderBase]: For 69/69 co-relation queries the response was YES. [2023-11-26 11:50:42,736 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2033 conditions, 1117 events. 528/1117 cut-off events. For 69/69 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7559 event pairs, 181 based on Foata normal form. 12/1090 useless extension candidates. Maximal degree in co-relation 2022. Up to 671 conditions per place. [2023-11-26 11:50:42,744 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 24 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-26 11:50:42,744 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 160 flow [2023-11-26 11:50:42,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:42,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:42,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-26 11:50:42,745 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:50:42,745 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-26 11:50:42,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-26 11:50:42,746 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:42,746 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-26 11:50:42,746 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:42,747 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,747 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,748 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 114 transitions. [2023-11-26 11:50:42,748 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 160 flow [2023-11-26 11:50:42,749 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:42,751 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-26 11:50:42,751 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-26 11:50:42,754 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 11:50:42,754 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-26 11:50:42,755 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,755 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:42,755 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:42,755 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-26 11:50:42,755 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:42,756 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:42,756 INFO L85 PathProgramCache]: Analyzing trace with hash 1393181610, now seen corresponding path program 1 times [2023-11-26 11:50:42,756 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:42,756 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [224604840] [2023-11-26 11:50:42,756 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:42,756 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:42,771 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:42,814 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:42,815 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:42,815 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [224604840] [2023-11-26 11:50:42,820 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [224604840] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:42,820 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:42,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:50:42,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [823132452] [2023-11-26 11:50:42,820 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:42,821 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:42,821 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:42,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:42,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:42,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:42,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:42,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:42,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:42,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:43,079 INFO L124 PetriNetUnfolderBase]: 545/1125 cut-off events. [2023-11-26 11:50:43,079 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:50:43,081 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2048 conditions, 1125 events. 545/1125 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 81. Compared 7490 event pairs, 325 based on Foata normal form. 0/1092 useless extension candidates. Maximal degree in co-relation 2038. Up to 700 conditions per place. [2023-11-26 11:50:43,089 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 25 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-26 11:50:43,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 158 flow [2023-11-26 11:50:43,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:43,090 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:43,090 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-26 11:50:43,091 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2023-11-26 11:50:43,091 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-26 11:50:43,091 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-26 11:50:43,091 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:43,091 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-26 11:50:43,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:43,092 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:43,093 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:43,093 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 112 transitions. [2023-11-26 11:50:43,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 158 flow [2023-11-26 11:50:43,094 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 154 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:43,095 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-26 11:50:43,096 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-26 11:50:43,097 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-26 11:50:43,097 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-26 11:50:43,097 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:43,097 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:43,097 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:43,098 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-26 11:50:43,098 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:43,098 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:43,098 INFO L85 PathProgramCache]: Analyzing trace with hash -2020674385, now seen corresponding path program 1 times [2023-11-26 11:50:43,098 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:43,099 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [425199261] [2023-11-26 11:50:43,099 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:43,099 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:43,152 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:43,697 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:43,697 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:43,697 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [425199261] [2023-11-26 11:50:43,697 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [425199261] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:43,697 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:43,698 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-26 11:50:43,698 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923662882] [2023-11-26 11:50:43,698 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:43,698 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-26 11:50:43,699 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:43,699 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-26 11:50:43,699 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-26 11:50:43,838 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:43,839 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:43,839 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:43,839 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:43,839 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:44,234 INFO L124 PetriNetUnfolderBase]: 530/1050 cut-off events. [2023-11-26 11:50:44,234 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:50:44,237 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1950 conditions, 1050 events. 530/1050 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 6944 event pairs, 282 based on Foata normal form. 36/1062 useless extension candidates. Maximal degree in co-relation 1939. Up to 671 conditions per place. [2023-11-26 11:50:44,244 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 24 selfloop transitions, 3 changer transitions 8/53 dead transitions. [2023-11-26 11:50:44,244 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 53 transitions, 186 flow [2023-11-26 11:50:44,244 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:44,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:44,245 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 186 transitions. [2023-11-26 11:50:44,246 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5740740740740741 [2023-11-26 11:50:44,246 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 186 transitions. [2023-11-26 11:50:44,246 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 186 transitions. [2023-11-26 11:50:44,246 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:44,247 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 186 transitions. [2023-11-26 11:50:44,248 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 31.0) internal successors, (186), 6 states have internal predecessors, (186), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,249 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,250 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,250 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 6 states and 186 transitions. [2023-11-26 11:50:44,250 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 53 transitions, 186 flow [2023-11-26 11:50:44,251 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 53 transitions, 182 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:44,252 INFO L231 Difference]: Finished difference. Result has 51 places, 38 transitions, 88 flow [2023-11-26 11:50:44,253 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=84, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=88, PETRI_PLACES=51, PETRI_TRANSITIONS=38} [2023-11-26 11:50:44,254 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 11:50:44,254 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 38 transitions, 88 flow [2023-11-26 11:50:44,254 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 26.75) internal successors, (214), 8 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,254 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:44,254 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:44,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-26 11:50:44,255 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:44,255 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:44,255 INFO L85 PathProgramCache]: Analyzing trace with hash -2020674866, now seen corresponding path program 1 times [2023-11-26 11:50:44,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:44,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1094789033] [2023-11-26 11:50:44,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:44,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:44,290 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:44,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:44,433 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:44,433 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1094789033] [2023-11-26 11:50:44,433 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1094789033] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:44,434 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:44,434 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:50:44,434 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1197116040] [2023-11-26 11:50:44,434 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:44,435 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:50:44,435 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:44,435 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:50:44,436 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:50:44,441 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:50:44,442 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 38 transitions, 88 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 11:50:44,442 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:44,442 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:50:44,442 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:44,838 INFO L124 PetriNetUnfolderBase]: 1213/2149 cut-off events. [2023-11-26 11:50:44,838 INFO L125 PetriNetUnfolderBase]: For 21/21 co-relation queries the response was YES. [2023-11-26 11:50:44,842 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4069 conditions, 2149 events. 1213/2149 cut-off events. For 21/21 co-relation queries the response was YES. Maximal size of possible extension queue 148. Compared 13567 event pairs, 147 based on Foata normal form. 80/2198 useless extension candidates. Maximal degree in co-relation 4058. Up to 1081 conditions per place. [2023-11-26 11:50:44,856 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 39 selfloop transitions, 5 changer transitions 1/61 dead transitions. [2023-11-26 11:50:44,856 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 61 transitions, 232 flow [2023-11-26 11:50:44,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:50:44,876 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:50:44,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 151 transitions. [2023-11-26 11:50:44,877 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6990740740740741 [2023-11-26 11:50:44,877 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 151 transitions. [2023-11-26 11:50:44,877 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 151 transitions. [2023-11-26 11:50:44,877 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:44,877 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 151 transitions. [2023-11-26 11:50:44,878 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 37.75) internal successors, (151), 4 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,879 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,879 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:44,879 INFO L175 Difference]: Start difference. First operand has 51 places, 38 transitions, 88 flow. Second operand 4 states and 151 transitions. [2023-11-26 11:50:44,879 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 61 transitions, 232 flow [2023-11-26 11:50:44,880 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 61 transitions, 224 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:44,881 INFO L231 Difference]: Finished difference. Result has 51 places, 41 transitions, 117 flow [2023-11-26 11:50:44,882 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=83, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=117, PETRI_PLACES=51, PETRI_TRANSITIONS=41} [2023-11-26 11:50:44,883 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -8 predicate places. [2023-11-26 11:50:44,883 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 41 transitions, 117 flow [2023-11-26 11:50:44,883 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 11:50:44,884 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:44,884 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:44,884 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-26 11:50:44,884 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:44,884 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:44,885 INFO L85 PathProgramCache]: Analyzing trace with hash -1040129738, now seen corresponding path program 1 times [2023-11-26 11:50:44,885 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:44,885 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [276874259] [2023-11-26 11:50:44,885 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:44,885 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:44,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:45,122 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:45,123 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:45,123 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [276874259] [2023-11-26 11:50:45,123 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [276874259] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:45,123 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:45,123 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:50:45,125 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2079267093] [2023-11-26 11:50:45,125 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:45,126 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:45,127 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:45,128 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:45,128 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:45,146 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:50:45,147 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 41 transitions, 117 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,147 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:45,147 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:50:45,147 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:45,499 INFO L124 PetriNetUnfolderBase]: 809/1445 cut-off events. [2023-11-26 11:50:45,499 INFO L125 PetriNetUnfolderBase]: For 366/366 co-relation queries the response was YES. [2023-11-26 11:50:45,502 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3271 conditions, 1445 events. 809/1445 cut-off events. For 366/366 co-relation queries the response was YES. Maximal size of possible extension queue 78. Compared 8107 event pairs, 73 based on Foata normal form. 68/1491 useless extension candidates. Maximal degree in co-relation 3258. Up to 521 conditions per place. [2023-11-26 11:50:45,511 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 49 selfloop transitions, 8 changer transitions 1/74 dead transitions. [2023-11-26 11:50:45,511 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 74 transitions, 322 flow [2023-11-26 11:50:45,512 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:45,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:45,513 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 190 transitions. [2023-11-26 11:50:45,513 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:50:45,513 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 190 transitions. [2023-11-26 11:50:45,513 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 190 transitions. [2023-11-26 11:50:45,513 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:45,514 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 190 transitions. [2023-11-26 11:50:45,514 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.0) internal successors, (190), 5 states have internal predecessors, (190), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,515 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,515 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,516 INFO L175 Difference]: Start difference. First operand has 51 places, 41 transitions, 117 flow. Second operand 5 states and 190 transitions. [2023-11-26 11:50:45,516 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 74 transitions, 322 flow [2023-11-26 11:50:45,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 74 transitions, 312 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:50:45,519 INFO L231 Difference]: Finished difference. Result has 55 places, 44 transitions, 157 flow [2023-11-26 11:50:45,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=109, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=157, PETRI_PLACES=55, PETRI_TRANSITIONS=44} [2023-11-26 11:50:45,520 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 11:50:45,520 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 44 transitions, 157 flow [2023-11-26 11:50:45,520 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,520 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:45,520 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:45,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-26 11:50:45,521 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:45,521 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:45,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1305782571, now seen corresponding path program 1 times [2023-11-26 11:50:45,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:45,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [522980309] [2023-11-26 11:50:45,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:45,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:45,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:45,798 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:45,798 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:45,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [522980309] [2023-11-26 11:50:45,799 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [522980309] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:45,799 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:45,799 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:45,800 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788690233] [2023-11-26 11:50:45,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:45,800 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:50:45,801 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:45,801 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:50:45,801 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:50:45,812 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:50:45,813 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 44 transitions, 157 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:45,813 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:45,813 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:50:45,814 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:46,083 INFO L124 PetriNetUnfolderBase]: 477/829 cut-off events. [2023-11-26 11:50:46,083 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2023-11-26 11:50:46,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2161 conditions, 829 events. 477/829 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3822 event pairs, 59 based on Foata normal form. 36/843 useless extension candidates. Maximal degree in co-relation 2146. Up to 268 conditions per place. [2023-11-26 11:50:46,091 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 11 changer transitions 1/71 dead transitions. [2023-11-26 11:50:46,092 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 71 transitions, 333 flow [2023-11-26 11:50:46,092 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:50:46,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:50:46,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 213 transitions. [2023-11-26 11:50:46,094 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6574074074074074 [2023-11-26 11:50:46,094 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 213 transitions. [2023-11-26 11:50:46,094 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 213 transitions. [2023-11-26 11:50:46,094 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:46,094 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 213 transitions. [2023-11-26 11:50:46,095 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.5) internal successors, (213), 6 states have internal predecessors, (213), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,096 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,097 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,097 INFO L175 Difference]: Start difference. First operand has 55 places, 44 transitions, 157 flow. Second operand 6 states and 213 transitions. [2023-11-26 11:50:46,097 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 71 transitions, 333 flow [2023-11-26 11:50:46,102 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 71 transitions, 308 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:46,104 INFO L231 Difference]: Finished difference. Result has 58 places, 44 transitions, 171 flow [2023-11-26 11:50:46,104 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=135, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=171, PETRI_PLACES=58, PETRI_TRANSITIONS=44} [2023-11-26 11:50:46,105 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -1 predicate places. [2023-11-26 11:50:46,105 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 44 transitions, 171 flow [2023-11-26 11:50:46,105 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,105 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:46,105 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] [2023-11-26 11:50:46,106 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-26 11:50:46,106 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:46,106 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:46,107 INFO L85 PathProgramCache]: Analyzing trace with hash -1592353612, now seen corresponding path program 1 times [2023-11-26 11:50:46,107 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:46,107 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [527669861] [2023-11-26 11:50:46,107 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:46,108 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:46,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:46,536 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:46,536 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:46,536 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [527669861] [2023-11-26 11:50:46,536 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [527669861] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:46,536 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:46,536 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:46,537 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [422740417] [2023-11-26 11:50:46,537 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:46,537 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:46,537 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:46,538 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:46,538 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:46,545 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:46,546 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 44 transitions, 171 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,546 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:46,546 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:46,546 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:46,873 INFO L124 PetriNetUnfolderBase]: 593/1157 cut-off events. [2023-11-26 11:50:46,874 INFO L125 PetriNetUnfolderBase]: For 428/446 co-relation queries the response was YES. [2023-11-26 11:50:46,877 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2567 conditions, 1157 events. 593/1157 cut-off events. For 428/446 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6387 event pairs, 275 based on Foata normal form. 8/1095 useless extension candidates. Maximal degree in co-relation 2551. Up to 528 conditions per place. [2023-11-26 11:50:46,881 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 25 selfloop transitions, 2 changer transitions 13/63 dead transitions. [2023-11-26 11:50:46,881 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 63 transitions, 297 flow [2023-11-26 11:50:46,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:46,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:46,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-26 11:50:46,883 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6518518518518519 [2023-11-26 11:50:46,883 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-26 11:50:46,883 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-26 11:50:46,883 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:46,883 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-26 11:50:46,884 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,885 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,885 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,886 INFO L175 Difference]: Start difference. First operand has 58 places, 44 transitions, 171 flow. Second operand 5 states and 176 transitions. [2023-11-26 11:50:46,886 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 63 transitions, 297 flow [2023-11-26 11:50:46,890 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 63 transitions, 233 flow, removed 14 selfloop flow, removed 8 redundant places. [2023-11-26 11:50:46,892 INFO L231 Difference]: Finished difference. Result has 57 places, 44 transitions, 127 flow [2023-11-26 11:50:46,892 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=115, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=127, PETRI_PLACES=57, PETRI_TRANSITIONS=44} [2023-11-26 11:50:46,894 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-26 11:50:46,894 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 44 transitions, 127 flow [2023-11-26 11:50:46,894 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:46,894 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:46,895 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] [2023-11-26 11:50:46,895 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-26 11:50:46,895 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:46,895 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:46,896 INFO L85 PathProgramCache]: Analyzing trace with hash -1389446916, now seen corresponding path program 2 times [2023-11-26 11:50:46,896 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:46,896 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [104984113] [2023-11-26 11:50:46,896 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:46,896 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:46,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:47,881 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:47,881 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:47,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [104984113] [2023-11-26 11:50:47,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [104984113] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:47,882 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:47,882 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:50:47,882 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1274227170] [2023-11-26 11:50:47,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:47,883 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:50:47,883 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:47,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:50:47,884 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:50:47,899 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:50:47,900 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 44 transitions, 127 flow. Second operand has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:47,900 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:47,901 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:50:47,901 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:48,262 INFO L124 PetriNetUnfolderBase]: 343/683 cut-off events. [2023-11-26 11:50:48,262 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-26 11:50:48,264 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1363 conditions, 683 events. 343/683 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 46. Compared 3249 event pairs, 83 based on Foata normal form. 8/642 useless extension candidates. Maximal degree in co-relation 1349. Up to 157 conditions per place. [2023-11-26 11:50:48,266 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 27 selfloop transitions, 4 changer transitions 21/77 dead transitions. [2023-11-26 11:50:48,267 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 77 transitions, 307 flow [2023-11-26 11:50:48,267 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:50:48,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:50:48,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 314 transitions. [2023-11-26 11:50:48,269 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6460905349794238 [2023-11-26 11:50:48,269 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 314 transitions. [2023-11-26 11:50:48,269 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 314 transitions. [2023-11-26 11:50:48,270 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:48,270 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 314 transitions. [2023-11-26 11:50:48,271 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 34.888888888888886) internal successors, (314), 9 states have internal predecessors, (314), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,272 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,273 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,273 INFO L175 Difference]: Start difference. First operand has 57 places, 44 transitions, 127 flow. Second operand 9 states and 314 transitions. [2023-11-26 11:50:48,273 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 77 transitions, 307 flow [2023-11-26 11:50:48,275 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 59 places, 77 transitions, 293 flow, removed 5 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:48,276 INFO L231 Difference]: Finished difference. Result has 63 places, 44 transitions, 135 flow [2023-11-26 11:50:48,276 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=117, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=135, PETRI_PLACES=63, PETRI_TRANSITIONS=44} [2023-11-26 11:50:48,277 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 4 predicate places. [2023-11-26 11:50:48,277 INFO L495 AbstractCegarLoop]: Abstraction has has 63 places, 44 transitions, 135 flow [2023-11-26 11:50:48,278 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,278 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:48,278 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] [2023-11-26 11:50:48,278 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-26 11:50:48,278 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:48,279 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:48,279 INFO L85 PathProgramCache]: Analyzing trace with hash 519774226, now seen corresponding path program 3 times [2023-11-26 11:50:48,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:48,279 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [922423991] [2023-11-26 11:50:48,279 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:48,280 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:48,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:48,575 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:48,576 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:48,576 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [922423991] [2023-11-26 11:50:48,576 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [922423991] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:48,576 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:48,576 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:48,577 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377133327] [2023-11-26 11:50:48,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:48,577 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:48,578 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:48,578 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:48,579 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:48,590 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 54 [2023-11-26 11:50:48,591 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 63 places, 44 transitions, 135 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,591 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:48,591 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 54 [2023-11-26 11:50:48,591 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:48,853 INFO L124 PetriNetUnfolderBase]: 518/1018 cut-off events. [2023-11-26 11:50:48,854 INFO L125 PetriNetUnfolderBase]: For 200/200 co-relation queries the response was YES. [2023-11-26 11:50:48,856 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2168 conditions, 1018 events. 518/1018 cut-off events. For 200/200 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 5296 event pairs, 246 based on Foata normal form. 8/970 useless extension candidates. Maximal degree in co-relation 2152. Up to 417 conditions per place. [2023-11-26 11:50:48,865 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 24 selfloop transitions, 6 changer transitions 13/64 dead transitions. [2023-11-26 11:50:48,866 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 64 transitions, 276 flow [2023-11-26 11:50:48,866 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:48,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:48,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 169 transitions. [2023-11-26 11:50:48,868 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6259259259259259 [2023-11-26 11:50:48,868 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 169 transitions. [2023-11-26 11:50:48,868 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 169 transitions. [2023-11-26 11:50:48,868 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:48,868 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 169 transitions. [2023-11-26 11:50:48,869 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 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-26 11:50:48,870 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,870 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,870 INFO L175 Difference]: Start difference. First operand has 63 places, 44 transitions, 135 flow. Second operand 5 states and 169 transitions. [2023-11-26 11:50:48,871 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 64 transitions, 276 flow [2023-11-26 11:50:48,873 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 64 transitions, 252 flow, removed 5 selfloop flow, removed 7 redundant places. [2023-11-26 11:50:48,874 INFO L231 Difference]: Finished difference. Result has 60 places, 47 transitions, 166 flow [2023-11-26 11:50:48,875 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=121, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=166, PETRI_PLACES=60, PETRI_TRANSITIONS=47} [2023-11-26 11:50:48,876 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2023-11-26 11:50:48,876 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 47 transitions, 166 flow [2023-11-26 11:50:48,876 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:48,876 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:48,877 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] [2023-11-26 11:50:48,877 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-26 11:50:48,877 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:48,877 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:48,877 INFO L85 PathProgramCache]: Analyzing trace with hash 1084380070, now seen corresponding path program 4 times [2023-11-26 11:50:48,878 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:48,878 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [640257714] [2023-11-26 11:50:48,878 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:48,878 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:48,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:49,189 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:49,190 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-26 11:50:49,190 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [640257714] [2023-11-26 11:50:49,190 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [640257714] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:49,190 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:49,191 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:50:49,191 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1035708438] [2023-11-26 11:50:49,191 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:49,192 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:50:49,194 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-26 11:50:49,195 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:50:49,195 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:50:49,200 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:50:49,200 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 47 transitions, 166 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:49,201 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:49,201 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:50:49,201 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:49,482 INFO L124 PetriNetUnfolderBase]: 591/1141 cut-off events. [2023-11-26 11:50:49,482 INFO L125 PetriNetUnfolderBase]: For 237/256 co-relation queries the response was YES. [2023-11-26 11:50:49,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2472 conditions, 1141 events. 591/1141 cut-off events. For 237/256 co-relation queries the response was YES. Maximal size of possible extension queue 79. Compared 6254 event pairs, 288 based on Foata normal form. 16/1032 useless extension candidates. Maximal degree in co-relation 2455. Up to 466 conditions per place. [2023-11-26 11:50:49,488 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 22 selfloop transitions, 2 changer transitions 20/67 dead transitions. [2023-11-26 11:50:49,489 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 62 places, 67 transitions, 309 flow [2023-11-26 11:50:49,489 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:50:49,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:50:49,490 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-26 11:50:49,490 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6555555555555556 [2023-11-26 11:50:49,491 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-26 11:50:49,491 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-26 11:50:49,491 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:49,491 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-26 11:50:49,492 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:49,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:49,493 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:49,494 INFO L175 Difference]: Start difference. First operand has 60 places, 47 transitions, 166 flow. Second operand 5 states and 177 transitions. [2023-11-26 11:50:49,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 62 places, 67 transitions, 309 flow [2023-11-26 11:50:49,497 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 58 places, 67 transitions, 289 flow, removed 3 selfloop flow, removed 4 redundant places. [2023-11-26 11:50:49,498 INFO L231 Difference]: Finished difference. Result has 61 places, 44 transitions, 147 flow [2023-11-26 11:50:49,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=150, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=147, PETRI_PLACES=61, PETRI_TRANSITIONS=44} [2023-11-26 11:50:49,500 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 2 predicate places. [2023-11-26 11:50:49,500 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 44 transitions, 147 flow [2023-11-26 11:50:49,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:49,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:49,501 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] [2023-11-26 11:50:49,501 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-26 11:50:49,501 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:49,503 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:49,503 INFO L85 PathProgramCache]: Analyzing trace with hash -246201754, now seen corresponding path program 5 times [2023-11-26 11:50:49,503 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-26 11:50:49,503 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [794014756] [2023-11-26 11:50:49,503 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:49,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-26 11:50:49,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:49,567 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:50:49,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:50:49,657 INFO L130 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2023-11-26 11:50:49,659 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:50:49,661 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 11:50:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 11:50:49,663 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 11:50:49,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 11:50:49,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 11:50:49,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 11:50:49,664 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 11:50:49,666 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 11:50:49,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 11:50:49,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 11:50:49,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 11:50:49,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 11:50:49,667 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 11:50:49,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-26 11:50:49,668 INFO L445 BasicCegarLoop]: Path program histogram: [5, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:50:49,687 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:50:49,687 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:50:49,742 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:50:49,744 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:50:49,746 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:50:49,757 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:49,758 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:50:49,769 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:50:49 BasicIcfg [2023-11-26 11:50:49,770 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:50:49,770 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:50:49,770 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:50:49,771 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:50:49,771 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:38" (3/4) ... [2023-11-26 11:50:49,773 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:50:49,774 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:50:49,775 INFO L158 Benchmark]: Toolchain (without parser) took 12707.79ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 113.0MB in the beginning and 104.4MB in the end (delta: 8.6MB). Peak memory consumption was 85.8MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,775 INFO L158 Benchmark]: CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:49,776 INFO L158 Benchmark]: CACSL2BoogieTranslator took 662.87ms. Allocated memory is still 157.3MB. Free memory was 113.0MB in the beginning and 89.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,776 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.10ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,776 INFO L158 Benchmark]: Boogie Preprocessor took 98.52ms. Allocated memory is still 157.3MB. Free memory was 87.0MB in the beginning and 128.5MB in the end (delta: -41.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,777 INFO L158 Benchmark]: RCFGBuilder took 1012.68ms. Allocated memory is still 157.3MB. Free memory was 128.5MB in the beginning and 81.4MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,777 INFO L158 Benchmark]: TraceAbstraction took 10858.78ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 80.5MB in the beginning and 104.4MB in the end (delta: -23.9MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. [2023-11-26 11:50:49,778 INFO L158 Benchmark]: Witness Printer took 3.99ms. Allocated memory is still 232.8MB. Free memory is still 104.4MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:50:49,785 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.24ms. Allocated memory is still 104.9MB. Free memory is still 53.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 662.87ms. Allocated memory is still 157.3MB. Free memory was 113.0MB in the beginning and 89.6MB in the end (delta: 23.4MB). Peak memory consumption was 23.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.10ms. Allocated memory is still 157.3MB. Free memory was 89.6MB in the beginning and 87.0MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 98.52ms. Allocated memory is still 157.3MB. Free memory was 87.0MB in the beginning and 128.5MB in the end (delta: -41.5MB). Peak memory consumption was 7.2MB. Max. memory is 16.1GB. * RCFGBuilder took 1012.68ms. Allocated memory is still 157.3MB. Free memory was 128.5MB in the beginning and 81.4MB in the end (delta: 47.1MB). Peak memory consumption was 48.2MB. Max. memory is 16.1GB. * TraceAbstraction took 10858.78ms. Allocated memory was 157.3MB in the beginning and 232.8MB in the end (delta: 75.5MB). Free memory was 80.5MB in the beginning and 104.4MB in the end (delta: -23.9MB). Peak memory consumption was 51.3MB. Max. memory is 16.1GB. * Witness Printer took 3.99ms. Allocated memory is still 232.8MB. Free memory is still 104.4MB. 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: 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={5:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L18] 0 __assert_fail ("0", "safe031_power.oepc_pso.oepc_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=1, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 834]: 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: 832]: 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 7 procedures, 79 locations, 13 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: 10.6s, OverallIterations: 16, TraceHistogramMax: 1, PathProgramHistogramMax: 5, EmptinessCheckTime: 0.0s, AutomataDifference: 5.8s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 596 SdHoareTripleChecker+Valid, 1.8s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 486 mSDsluCounter, 115 SdHoareTripleChecker+Invalid, 1.5s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 0 IncrementalHoareTripleChecker+Unchecked, 80 mSDsCounter, 36 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1438 IncrementalHoareTripleChecker+Invalid, 1474 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 36 mSolverCounterUnsat, 35 mSDtfsCounter, 1438 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 68 GetRequests, 14 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=171occurred in iteration=11, InterpolantAutomatonStates: 66, 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, 3.6s InterpolantComputationTime, 295 NumberOfCodeBlocks, 295 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 246 ConstructedInterpolants, 0 QuantifiedInterpolants, 1236 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 15 InterpolantComputations, 15 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:50:49,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-26 11:50:52,488 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-26 11:50:52,620 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-26 11:50:52,638 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-26 11:50:52,639 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-26 11:50:52,690 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-26 11:50:52,691 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-26 11:50:52,692 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-26 11:50:52,693 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-26 11:50:52,699 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-26 11:50:52,699 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-26 11:50:52,700 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-26 11:50:52,701 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-26 11:50:52,702 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-26 11:50:52,703 INFO L153 SettingsManager]: * Use SBE=true [2023-11-26 11:50:52,704 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-26 11:50:52,704 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-26 11:50:52,705 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-26 11:50:52,705 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-26 11:50:52,706 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-26 11:50:52,707 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-26 11:50:52,708 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-26 11:50:52,708 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-26 11:50:52,709 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-26 11:50:52,710 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-26 11:50:52,710 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-26 11:50:52,711 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-26 11:50:52,711 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-26 11:50:52,712 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-26 11:50:52,712 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-26 11:50:52,714 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-26 11:50:52,715 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-26 11:50:52,715 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-26 11:50:52,715 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-26 11:50:52,716 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:52,716 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-26 11:50:52,717 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-26 11:50:52,718 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-26 11:50:52,718 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-26 11:50:52,718 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-26 11:50:52,718 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-26 11:50:52,719 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-26 11:50:52,719 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-26 11:50:52,719 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-26 11:50:52,720 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_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 0c5111fe11e917830ff927fef759eebec65ab7406e64ef6d78fce931b0e70c57 [2023-11-26 11:50:53,166 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-26 11:50:53,202 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-26 11:50:53,205 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-26 11:50:53,207 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-26 11:50:53,207 INFO L274 PluginConnector]: CDTParser initialized [2023-11-26 11:50:53,209 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/../../sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:56,334 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-26 11:50:56,681 INFO L384 CDTParser]: Found 1 translation units. [2023-11-26 11:50:56,682 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/sv-benchmarks/c/pthread-wmm/safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:56,707 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/8c9372081/2b0924da017046779fe5f2315a7c6d14/FLAG11b268012 [2023-11-26 11:50:56,723 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/data/8c9372081/2b0924da017046779fe5f2315a7c6d14 [2023-11-26 11:50:56,726 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-26 11:50:56,727 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-26 11:50:56,729 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:56,729 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-26 11:50:56,735 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-26 11:50:56,736 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:56" (1/1) ... [2023-11-26 11:50:56,737 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@44a0a48c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:56, skipping insertion in model container [2023-11-26 11:50:56,737 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 26.11 11:50:56" (1/1) ... [2023-11-26 11:50:56,795 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-26 11:50:57,378 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:57,418 INFO L202 MainTranslator]: Completed pre-run [2023-11-26 11:50:57,473 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-26 11:50:57,514 WARN L675 CHandler]: The function __VERIFIER_atomic_begin is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:57,514 WARN L675 CHandler]: The function __VERIFIER_atomic_end is called, but not defined or handled by StandardFunctionHandler. [2023-11-26 11:50:57,522 INFO L206 MainTranslator]: Completed translation [2023-11-26 11:50:57,523 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57 WrapperNode [2023-11-26 11:50:57,523 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-26 11:50:57,524 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:57,525 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-26 11:50:57,525 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-26 11:50:57,532 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,553 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,581 INFO L138 Inliner]: procedures = 179, calls = 57, calls flagged for inlining = 6, calls inlined = 7, statements flattened = 133 [2023-11-26 11:50:57,587 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-26 11:50:57,588 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-26 11:50:57,588 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-26 11:50:57,588 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-26 11:50:57,600 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,600 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,605 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,623 INFO L175 MemorySlicer]: Split 5 memory accesses to 4 slices as follows [2, 1, 1, 1]. 40 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-26 11:50:57,623 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,623 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,634 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,636 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,639 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,642 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,646 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-26 11:50:57,647 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-26 11:50:57,648 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-26 11:50:57,648 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-26 11:50:57,649 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (1/1) ... [2023-11-26 11:50:57,663 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-26 11:50:57,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 [2023-11-26 11:50:57,701 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-26 11:50:57,728 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-26 11:50:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_begin [2023-11-26 11:50:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-26 11:50:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-26 11:50:57,751 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-26 11:50:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-26 11:50:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-26 11:50:57,752 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-26 11:50:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-26 11:50:57,754 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-26 11:50:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-26 11:50:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-26 11:50:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-26 11:50:57,755 INFO L130 BoogieDeclarations]: Found specification of procedure P0 [2023-11-26 11:50:57,755 INFO L138 BoogieDeclarations]: Found implementation of procedure P0 [2023-11-26 11:50:57,756 INFO L130 BoogieDeclarations]: Found specification of procedure P1 [2023-11-26 11:50:57,756 INFO L138 BoogieDeclarations]: Found implementation of procedure P1 [2023-11-26 11:50:57,757 INFO L130 BoogieDeclarations]: Found specification of procedure P2 [2023-11-26 11:50:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure P2 [2023-11-26 11:50:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_atomic_end [2023-11-26 11:50:57,758 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-26 11:50:57,758 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-26 11:50:57,765 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-26 11:50:57,931 INFO L241 CfgBuilder]: Building ICFG [2023-11-26 11:50:57,934 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-26 11:50:58,350 INFO L282 CfgBuilder]: Performing block encoding [2023-11-26 11:50:58,556 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-26 11:50:58,556 INFO L309 CfgBuilder]: Removed 0 assume(true) statements. [2023-11-26 11:50:58,557 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:58 BoogieIcfgContainer [2023-11-26 11:50:58,557 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-26 11:50:58,559 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-26 11:50:58,559 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-26 11:50:58,563 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-26 11:50:58,563 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 26.11 11:50:56" (1/3) ... [2023-11-26 11:50:58,564 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a4002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:58, skipping insertion in model container [2023-11-26 11:50:58,564 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 26.11 11:50:57" (2/3) ... [2023-11-26 11:50:58,565 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d7a4002 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 26.11 11:50:58, skipping insertion in model container [2023-11-26 11:50:58,565 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:58" (3/3) ... [2023-11-26 11:50:58,567 INFO L112 eAbstractionObserver]: Analyzing ICFG safe031_power.oepc_pso.oepc_rmo.oepc.i [2023-11-26 11:50:58,588 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-26 11:50:58,588 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 9 error locations. [2023-11-26 11:50:58,588 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-26 11:50:58,653 INFO L144 ThreadInstanceAdder]: Constructed 0 joinOtherThreadTransitions. [2023-11-26 11:50:58,689 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:58,744 INFO L124 PetriNetUnfolderBase]: 2/51 cut-off events. [2023-11-26 11:50:58,744 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:58,748 INFO L83 FinitePrefix]: Finished finitePrefix Result has 61 conditions, 51 events. 2/51 cut-off events. For 0/0 co-relation queries the response was YES. Maximal size of possible extension queue 6. Compared 94 event pairs, 0 based on Foata normal form. 0/40 useless extension candidates. Maximal degree in co-relation 50. Up to 2 conditions per place. [2023-11-26 11:50:58,749 INFO L82 GeneralOperation]: Start removeDead. Operand has 62 places, 54 transitions, 120 flow [2023-11-26 11:50:58,753 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 59 places, 51 transitions, 111 flow [2023-11-26 11:50:58,764 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-26 11:50:58,771 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;@6b944649, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-26 11:50:58,771 INFO L358 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2023-11-26 11:50:58,775 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-26 11:50:58,775 INFO L124 PetriNetUnfolderBase]: 0/2 cut-off events. [2023-11-26 11:50:58,776 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-26 11:50:58,776 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:58,777 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:58,777 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:58,783 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:58,783 INFO L85 PathProgramCache]: Analyzing trace with hash 12084, now seen corresponding path program 1 times [2023-11-26 11:50:58,796 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:58,797 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [427034769] [2023-11-26 11:50:58,797 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:58,798 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:58,798 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:58,804 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:58,835 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-26 11:50:58,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:50:58,919 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:50:58,924 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:50:58,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:50:59,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:50:59,012 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:50:59,014 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:50:59,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [427034769] [2023-11-26 11:50:59,015 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [427034769] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:50:59,015 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:50:59,016 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:50:59,018 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [74307455] [2023-11-26 11:50:59,018 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:50:59,029 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:50:59,035 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:50:59,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:50:59,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:50:59,109 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:50:59,114 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 51 transitions, 111 flow. Second operand has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:59,114 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:50:59,114 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:50:59,116 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:50:59,702 INFO L124 PetriNetUnfolderBase]: 772/1569 cut-off events. [2023-11-26 11:50:59,703 INFO L125 PetriNetUnfolderBase]: For 18/18 co-relation queries the response was YES. [2023-11-26 11:50:59,712 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2782 conditions, 1569 events. 772/1569 cut-off events. For 18/18 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 580 based on Foata normal form. 90/1507 useless extension candidates. Maximal degree in co-relation 2768. Up to 888 conditions per place. [2023-11-26 11:50:59,727 INFO L140 encePairwiseOnDemand]: 49/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/55 dead transitions. [2023-11-26 11:50:59,728 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 55 transitions, 179 flow [2023-11-26 11:50:59,729 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:50:59,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:50:59,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:50:59,743 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:50:59,744 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:50:59,745 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:50:59,747 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:50:59,749 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:50:59,754 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:50:59,761 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:59,762 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:59,764 INFO L175 Difference]: Start difference. First operand has 59 places, 51 transitions, 111 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:50:59,765 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 55 transitions, 179 flow [2023-11-26 11:50:59,770 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 55 transitions, 176 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:50:59,779 INFO L231 Difference]: Finished difference. Result has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:59,781 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=54, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=56, PETRI_TRANSITIONS=47} [2023-11-26 11:50:59,786 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 11:50:59,786 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 47 transitions, 104 flow [2023-11-26 11:50:59,786 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 28.666666666666668) internal successors, (86), 3 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:50:59,787 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:50:59,787 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-26 11:50:59,795 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Ended with exit code 0 [2023-11-26 11:50:59,989 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:59,989 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:50:59,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:50:59,990 INFO L85 PathProgramCache]: Analyzing trace with hash 12085, now seen corresponding path program 1 times [2023-11-26 11:50:59,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:50:59,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594921816] [2023-11-26 11:50:59,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:50:59,991 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:50:59,991 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:50:59,992 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:50:59,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-26 11:51:00,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:00,076 INFO L262 TraceCheckSpWp]: Trace formula consists of 49 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:51:00,077 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:00,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:51:00,098 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:00,098 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:00,099 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:00,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594921816] [2023-11-26 11:51:00,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594921816] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:00,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:00,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:51:00,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1981413233] [2023-11-26 11:51:00,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:00,101 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:00,102 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:00,102 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:00,102 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:00,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:51:00,138 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 47 transitions, 104 flow. Second operand has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:00,138 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:00,141 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:51:00,142 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:00,515 INFO L124 PetriNetUnfolderBase]: 772/1568 cut-off events. [2023-11-26 11:51:00,515 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:51:00,520 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2824 conditions, 1568 events. 772/1568 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11041 event pairs, 580 based on Foata normal form. 1/1417 useless extension candidates. Maximal degree in co-relation 2813. Up to 887 conditions per place. [2023-11-26 11:51:00,533 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/54 dead transitions. [2023-11-26 11:51:00,534 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 57 places, 54 transitions, 176 flow [2023-11-26 11:51:00,535 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:00,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:00,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:51:00,540 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:51:00,540 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:51:00,541 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:51:00,541 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:00,541 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:51:00,542 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:51:00,543 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:00,544 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:00,544 INFO L175 Difference]: Start difference. First operand has 56 places, 47 transitions, 104 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:51:00,544 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 57 places, 54 transitions, 176 flow [2023-11-26 11:51:00,547 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 55 places, 54 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:00,549 INFO L231 Difference]: Finished difference. Result has 55 places, 46 transitions, 102 flow [2023-11-26 11:51:00,549 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=102, PETRI_PLACES=55, PETRI_TRANSITIONS=46} [2023-11-26 11:51:00,563 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -4 predicate places. [2023-11-26 11:51:00,563 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 46 transitions, 102 flow [2023-11-26 11:51:00,564 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.666666666666668) internal successors, (89), 3 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:00,564 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:00,564 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:51:00,567 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Ended with exit code 0 [2023-11-26 11:51:00,766 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:00,767 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:00,767 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:00,768 INFO L85 PathProgramCache]: Analyzing trace with hash 360361885, now seen corresponding path program 1 times [2023-11-26 11:51:00,768 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:00,768 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [757165201] [2023-11-26 11:51:00,769 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:00,769 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:00,769 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:00,770 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:00,806 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-26 11:51:00,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:00,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:51:00,875 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:00,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:51:00,891 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:00,891 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:00,891 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:00,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [757165201] [2023-11-26 11:51:00,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [757165201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:00,893 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:00,893 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:00,893 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021730847] [2023-11-26 11:51:00,893 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:00,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:00,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:00,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:00,900 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:00,926 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:51:00,927 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 46 transitions, 102 flow. Second operand has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:00,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:00,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:51:00,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:01,272 INFO L124 PetriNetUnfolderBase]: 774/1567 cut-off events. [2023-11-26 11:51:01,273 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:51:01,300 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2828 conditions, 1567 events. 774/1567 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 11084 event pairs, 438 based on Foata normal form. 0/1421 useless extension candidates. Maximal degree in co-relation 2817. Up to 888 conditions per place. [2023-11-26 11:51:01,311 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 28 selfloop transitions, 2 changer transitions 0/53 dead transitions. [2023-11-26 11:51:01,311 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 53 transitions, 176 flow [2023-11-26 11:51:01,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:01,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:01,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 115 transitions. [2023-11-26 11:51:01,317 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7098765432098766 [2023-11-26 11:51:01,317 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 115 transitions. [2023-11-26 11:51:01,317 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 115 transitions. [2023-11-26 11:51:01,320 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:01,320 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 115 transitions. [2023-11-26 11:51:01,322 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:51:01,324 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:01,325 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:01,325 INFO L175 Difference]: Start difference. First operand has 55 places, 46 transitions, 102 flow. Second operand 3 states and 115 transitions. [2023-11-26 11:51:01,325 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 53 transitions, 176 flow [2023-11-26 11:51:01,329 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 53 transitions, 172 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:01,331 INFO L231 Difference]: Finished difference. Result has 54 places, 45 transitions, 100 flow [2023-11-26 11:51:01,332 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=96, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=54, PETRI_TRANSITIONS=45} [2023-11-26 11:51:01,333 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -5 predicate places. [2023-11-26 11:51:01,334 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 45 transitions, 100 flow [2023-11-26 11:51:01,334 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:01,334 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:01,334 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-26 11:51:01,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:01,537 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:01,537 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:01,538 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:01,538 INFO L85 PathProgramCache]: Analyzing trace with hash 360361886, now seen corresponding path program 1 times [2023-11-26 11:51:01,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:01,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [66073999] [2023-11-26 11:51:01,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:01,539 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:01,540 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:01,541 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:01,565 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-26 11:51:01,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:01,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:51:01,642 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:01,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:51:01,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:01,669 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:01,669 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:01,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [66073999] [2023-11-26 11:51:01,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [66073999] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:01,670 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:01,670 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:01,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1877359645] [2023-11-26 11:51:01,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:01,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:01,672 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:01,674 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:01,675 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:01,706 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:51:01,707 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 45 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:01,707 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:01,707 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:51:01,708 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:02,038 INFO L124 PetriNetUnfolderBase]: 772/1547 cut-off events. [2023-11-26 11:51:02,038 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-26 11:51:02,045 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2805 conditions, 1547 events. 772/1547 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 114. Compared 10902 event pairs, 593 based on Foata normal form. 3/1405 useless extension candidates. Maximal degree in co-relation 2795. Up to 883 conditions per place. [2023-11-26 11:51:02,057 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 27 selfloop transitions, 2 changer transitions 0/52 dead transitions. [2023-11-26 11:51:02,058 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 172 flow [2023-11-26 11:51:02,062 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:02,062 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:02,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 117 transitions. [2023-11-26 11:51:02,064 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7222222222222222 [2023-11-26 11:51:02,064 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 117 transitions. [2023-11-26 11:51:02,064 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 117 transitions. [2023-11-26 11:51:02,065 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:02,065 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 117 transitions. [2023-11-26 11:51:02,066 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:51:02,067 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,069 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,069 INFO L175 Difference]: Start difference. First operand has 54 places, 45 transitions, 100 flow. Second operand 3 states and 117 transitions. [2023-11-26 11:51:02,069 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 172 flow [2023-11-26 11:51:02,072 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 52 transitions, 168 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:02,073 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 98 flow [2023-11-26 11:51:02,074 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=94, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=98, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-26 11:51:02,075 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -6 predicate places. [2023-11-26 11:51:02,076 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 98 flow [2023-11-26 11:51:02,076 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.333333333333332) internal successors, (91), 3 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,076 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:02,076 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:02,080 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:02,279 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:02,279 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting P1Err0ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:02,280 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:02,280 INFO L85 PathProgramCache]: Analyzing trace with hash -1876957003, now seen corresponding path program 1 times [2023-11-26 11:51:02,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:02,281 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [534259126] [2023-11-26 11:51:02,281 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:02,281 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:02,282 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:02,283 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:02,317 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-26 11:51:02,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:02,382 INFO L262 TraceCheckSpWp]: Trace formula consists of 90 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:02,383 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:02,400 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:02,401 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:02,401 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:02,401 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [534259126] [2023-11-26 11:51:02,401 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [534259126] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:02,402 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:02,402 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-26 11:51:02,402 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1368115774] [2023-11-26 11:51:02,402 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:02,402 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:02,403 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:02,403 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:02,403 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:02,404 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 30 out of 54 [2023-11-26 11:51:02,404 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 98 flow. Second operand has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,404 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:02,405 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 30 of 54 [2023-11-26 11:51:02,405 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:02,661 INFO L124 PetriNetUnfolderBase]: 603/1141 cut-off events. [2023-11-26 11:51:02,661 INFO L125 PetriNetUnfolderBase]: For 38/38 co-relation queries the response was YES. [2023-11-26 11:51:02,685 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2137 conditions, 1141 events. 603/1141 cut-off events. For 38/38 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 7023 event pairs, 192 based on Foata normal form. 0/1123 useless extension candidates. Maximal degree in co-relation 2127. Up to 742 conditions per place. [2023-11-26 11:51:02,692 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 29 selfloop transitions, 2 changer transitions 2/56 dead transitions. [2023-11-26 11:51:02,693 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 56 transitions, 192 flow [2023-11-26 11:51:02,693 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:02,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:02,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2023-11-26 11:51:02,694 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7654320987654321 [2023-11-26 11:51:02,695 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 124 transitions. [2023-11-26 11:51:02,695 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 124 transitions. [2023-11-26 11:51:02,695 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:02,695 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 124 transitions. [2023-11-26 11:51:02,696 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 41.333333333333336) internal successors, (124), 3 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,697 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,697 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,697 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 98 flow. Second operand 3 states and 124 transitions. [2023-11-26 11:51:02,697 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 56 transitions, 192 flow [2023-11-26 11:51:02,698 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 56 transitions, 186 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:02,700 INFO L231 Difference]: Finished difference. Result has 52 places, 42 transitions, 94 flow [2023-11-26 11:51:02,700 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=52, PETRI_TRANSITIONS=42} [2023-11-26 11:51:02,701 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:51:02,701 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 42 transitions, 94 flow [2023-11-26 11:51:02,701 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.666666666666668) internal successors, (95), 3 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:02,702 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:02,702 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:02,709 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:02,908 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:02,909 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:02,909 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:02,910 INFO L85 PathProgramCache]: Analyzing trace with hash -1876958038, now seen corresponding path program 1 times [2023-11-26 11:51:02,910 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:02,910 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [658625422] [2023-11-26 11:51:02,910 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:02,910 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:02,911 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:02,914 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:02,977 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-26 11:51:03,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,049 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:51:03,051 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:03,059 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 7 [2023-11-26 11:51:03,067 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:03,067 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:03,068 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:03,068 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [658625422] [2023-11-26 11:51:03,068 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [658625422] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:03,068 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:03,068 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:03,069 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444715046] [2023-11-26 11:51:03,069 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:03,070 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:03,070 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:03,070 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:03,071 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:03,103 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 28 out of 54 [2023-11-26 11:51:03,103 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 42 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:03,104 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:03,104 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 28 of 54 [2023-11-26 11:51:03,104 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:03,393 INFO L124 PetriNetUnfolderBase]: 545/1134 cut-off events. [2023-11-26 11:51:03,393 INFO L125 PetriNetUnfolderBase]: For 72/72 co-relation queries the response was YES. [2023-11-26 11:51:03,396 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2082 conditions, 1134 events. 545/1134 cut-off events. For 72/72 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7608 event pairs, 181 based on Foata normal form. 0/1107 useless extension candidates. Maximal degree in co-relation 2071. Up to 700 conditions per place. [2023-11-26 11:51:03,406 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 25 selfloop transitions, 2 changer transitions 0/48 dead transitions. [2023-11-26 11:51:03,406 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 48 transitions, 162 flow [2023-11-26 11:51:03,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:03,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:03,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 112 transitions. [2023-11-26 11:51:03,408 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.691358024691358 [2023-11-26 11:51:03,408 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 112 transitions. [2023-11-26 11:51:03,408 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 112 transitions. [2023-11-26 11:51:03,409 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:03,409 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 112 transitions. [2023-11-26 11:51:03,410 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:51:03,411 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:03,411 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:03,411 INFO L175 Difference]: Start difference. First operand has 52 places, 42 transitions, 94 flow. Second operand 3 states and 112 transitions. [2023-11-26 11:51:03,411 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 48 transitions, 162 flow [2023-11-26 11:51:03,413 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 48 transitions, 156 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:03,415 INFO L231 Difference]: Finished difference. Result has 50 places, 41 transitions, 92 flow [2023-11-26 11:51:03,416 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=50, PETRI_TRANSITIONS=41} [2023-11-26 11:51:03,419 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -9 predicate places. [2023-11-26 11:51:03,419 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 41 transitions, 92 flow [2023-11-26 11:51:03,420 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 30.0) internal successors, (90), 3 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:03,421 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:03,421 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:03,433 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:03,624 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:03,624 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:03,625 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:03,625 INFO L85 PathProgramCache]: Analyzing trace with hash -1876958037, now seen corresponding path program 1 times [2023-11-26 11:51:03,625 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:03,625 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1559251810] [2023-11-26 11:51:03,625 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:03,626 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:03,626 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:03,627 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:03,630 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-26 11:51:03,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:03,754 INFO L262 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:51:03,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:03,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-26 11:51:03,781 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:03,782 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:03,782 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:03,782 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1559251810] [2023-11-26 11:51:03,782 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1559251810] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:03,783 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:03,783 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-26 11:51:03,783 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2135324288] [2023-11-26 11:51:03,783 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:03,784 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-26 11:51:03,784 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:03,784 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-26 11:51:03,785 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-26 11:51:03,827 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:51:03,828 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 41 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:03,828 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:03,828 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:51:03,828 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:04,083 INFO L124 PetriNetUnfolderBase]: 528/1105 cut-off events. [2023-11-26 11:51:04,084 INFO L125 PetriNetUnfolderBase]: For 45/45 co-relation queries the response was YES. [2023-11-26 11:51:04,107 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1999 conditions, 1105 events. 528/1105 cut-off events. For 45/45 co-relation queries the response was YES. Maximal size of possible extension queue 82. Compared 7426 event pairs, 181 based on Foata normal form. 12/1090 useless extension candidates. Maximal degree in co-relation 1989. Up to 671 conditions per place. [2023-11-26 11:51:04,114 INFO L140 encePairwiseOnDemand]: 51/54 looper letters, 24 selfloop transitions, 2 changer transitions 0/47 dead transitions. [2023-11-26 11:51:04,115 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 47 transitions, 156 flow [2023-11-26 11:51:04,115 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-26 11:51:04,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-26 11:51:04,116 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2023-11-26 11:51:04,116 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:51:04,117 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 114 transitions. [2023-11-26 11:51:04,117 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 114 transitions. [2023-11-26 11:51:04,117 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:04,117 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 114 transitions. [2023-11-26 11:51:04,118 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 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-26 11:51:04,119 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,119 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 54.0) internal successors, (216), 4 states have internal predecessors, (216), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,119 INFO L175 Difference]: Start difference. First operand has 50 places, 41 transitions, 92 flow. Second operand 3 states and 114 transitions. [2023-11-26 11:51:04,119 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 47 transitions, 156 flow [2023-11-26 11:51:04,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 47 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:04,121 INFO L231 Difference]: Finished difference. Result has 49 places, 40 transitions, 90 flow [2023-11-26 11:51:04,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=90, PETRI_PLACES=49, PETRI_TRANSITIONS=40} [2023-11-26 11:51:04,122 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -10 predicate places. [2023-11-26 11:51:04,123 INFO L495 AbstractCegarLoop]: Abstraction has has 49 places, 40 transitions, 90 flow [2023-11-26 11:51:04,123 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 31.0) internal successors, (93), 3 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,123 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:04,123 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:04,139 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:04,326 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:04,326 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:04,327 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:04,327 INFO L85 PathProgramCache]: Analyzing trace with hash 1359001327, now seen corresponding path program 1 times [2023-11-26 11:51:04,327 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:04,327 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1854525013] [2023-11-26 11:51:04,327 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:04,327 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:04,327 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:04,328 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:04,333 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-26 11:51:04,454 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:04,458 INFO L262 TraceCheckSpWp]: Trace formula consists of 122 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-26 11:51:04,459 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:04,512 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:04,512 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:04,513 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:04,515 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1854525013] [2023-11-26 11:51:04,515 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1854525013] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:04,516 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:04,516 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-26 11:51:04,516 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [323509730] [2023-11-26 11:51:04,516 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:04,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-26 11:51:04,520 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:04,520 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-26 11:51:04,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-26 11:51:04,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:51:04,540 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 40 transitions, 90 flow. Second operand has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 11:51:04,540 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:04,540 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:51:04,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:04,966 INFO L124 PetriNetUnfolderBase]: 1361/2433 cut-off events. [2023-11-26 11:51:04,966 INFO L125 PetriNetUnfolderBase]: For 86/86 co-relation queries the response was YES. [2023-11-26 11:51:04,972 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4632 conditions, 2433 events. 1361/2433 cut-off events. For 86/86 co-relation queries the response was YES. Maximal size of possible extension queue 162. Compared 15818 event pairs, 147 based on Foata normal form. 80/2484 useless extension candidates. Maximal degree in co-relation 4622. Up to 1297 conditions per place. [2023-11-26 11:51:04,987 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 40 selfloop transitions, 5 changer transitions 1/63 dead transitions. [2023-11-26 11:51:04,988 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 63 transitions, 234 flow [2023-11-26 11:51:04,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-26 11:51:04,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-26 11:51:04,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 152 transitions. [2023-11-26 11:51:04,989 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7037037037037037 [2023-11-26 11:51:04,989 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 152 transitions. [2023-11-26 11:51:04,990 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 152 transitions. [2023-11-26 11:51:04,990 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:04,990 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 152 transitions. [2023-11-26 11:51:04,991 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 38.0) internal successors, (152), 4 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,992 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,992 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 54.0) internal successors, (270), 5 states have internal predecessors, (270), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:04,992 INFO L175 Difference]: Start difference. First operand has 49 places, 40 transitions, 90 flow. Second operand 4 states and 152 transitions. [2023-11-26 11:51:04,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 63 transitions, 234 flow [2023-11-26 11:51:04,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 63 transitions, 228 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:04,996 INFO L231 Difference]: Finished difference. Result has 52 places, 43 transitions, 120 flow [2023-11-26 11:51:04,996 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=40, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=120, PETRI_PLACES=52, PETRI_TRANSITIONS=43} [2023-11-26 11:51:04,997 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -7 predicate places. [2023-11-26 11:51:04,997 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 43 transitions, 120 flow [2023-11-26 11:51:04,998 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 29.0) internal successors, (116), 4 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-26 11:51:04,998 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:04,998 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-26 11:51:05,002 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Ended with exit code 0 [2023-11-26 11:51:05,201 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:05,201 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:05,201 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:05,202 INFO L85 PathProgramCache]: Analyzing trace with hash -1330927527, now seen corresponding path program 1 times [2023-11-26 11:51:05,202 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:05,202 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1086684111] [2023-11-26 11:51:05,202 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:05,202 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:05,202 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:05,203 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:05,204 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-26 11:51:05,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:05,335 INFO L262 TraceCheckSpWp]: Trace formula consists of 143 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-26 11:51:05,337 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:05,390 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:05,391 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:05,391 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:05,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1086684111] [2023-11-26 11:51:05,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1086684111] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:05,391 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:05,392 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:05,392 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [78726528] [2023-11-26 11:51:05,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:05,392 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:05,393 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:05,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:05,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:05,406 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:51:05,407 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 43 transitions, 120 flow. Second operand has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:05,407 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:05,407 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:51:05,408 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:05,779 INFO L124 PetriNetUnfolderBase]: 877/1585 cut-off events. [2023-11-26 11:51:05,780 INFO L125 PetriNetUnfolderBase]: For 378/378 co-relation queries the response was YES. [2023-11-26 11:51:05,785 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3507 conditions, 1585 events. 877/1585 cut-off events. For 378/378 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9088 event pairs, 73 based on Foata normal form. 68/1631 useless extension candidates. Maximal degree in co-relation 3494. Up to 625 conditions per place. [2023-11-26 11:51:05,795 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 50 selfloop transitions, 8 changer transitions 1/76 dead transitions. [2023-11-26 11:51:05,795 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 76 transitions, 325 flow [2023-11-26 11:51:05,796 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:05,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:51:05,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 191 transitions. [2023-11-26 11:51:05,797 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.7074074074074074 [2023-11-26 11:51:05,797 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 191 transitions. [2023-11-26 11:51:05,797 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 191 transitions. [2023-11-26 11:51:05,798 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:05,798 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 191 transitions. [2023-11-26 11:51:05,799 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 38.2) internal successors, (191), 5 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:05,800 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:05,800 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:05,800 INFO L175 Difference]: Start difference. First operand has 52 places, 43 transitions, 120 flow. Second operand 5 states and 191 transitions. [2023-11-26 11:51:05,801 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 76 transitions, 325 flow [2023-11-26 11:51:05,802 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 76 transitions, 315 flow, removed 1 selfloop flow, removed 2 redundant places. [2023-11-26 11:51:05,804 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 160 flow [2023-11-26 11:51:05,804 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=160, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-26 11:51:05,805 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -3 predicate places. [2023-11-26 11:51:05,805 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 160 flow [2023-11-26 11:51:05,806 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 29.0) internal successors, (145), 5 states have internal predecessors, (145), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:05,806 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:05,806 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:05,820 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:06,009 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:06,009 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:06,010 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:06,010 INFO L85 PathProgramCache]: Analyzing trace with hash -114250698, now seen corresponding path program 1 times [2023-11-26 11:51:06,010 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:06,011 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [267916947] [2023-11-26 11:51:06,011 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:06,011 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:06,011 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:06,012 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:06,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-26 11:51:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:06,148 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:06,150 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:06,232 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:06,232 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:06,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:06,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [267916947] [2023-11-26 11:51:06,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [267916947] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:06,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:06,234 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:06,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040479825] [2023-11-26 11:51:06,234 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:06,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:06,235 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:06,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:06,235 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2023-11-26 11:51:06,244 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 26 out of 54 [2023-11-26 11:51:06,244 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 160 flow. Second operand has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:06,245 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:06,245 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 26 of 54 [2023-11-26 11:51:06,245 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:06,608 INFO L124 PetriNetUnfolderBase]: 489/857 cut-off events. [2023-11-26 11:51:06,608 INFO L125 PetriNetUnfolderBase]: For 680/680 co-relation queries the response was YES. [2023-11-26 11:51:06,611 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2189 conditions, 857 events. 489/857 cut-off events. For 680/680 co-relation queries the response was YES. Maximal size of possible extension queue 47. Compared 3935 event pairs, 59 based on Foata normal form. 36/871 useless extension candidates. Maximal degree in co-relation 2174. Up to 268 conditions per place. [2023-11-26 11:51:06,617 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 44 selfloop transitions, 11 changer transitions 1/73 dead transitions. [2023-11-26 11:51:06,617 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 73 transitions, 336 flow [2023-11-26 11:51:06,618 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:06,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:51:06,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 214 transitions. [2023-11-26 11:51:06,619 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6604938271604939 [2023-11-26 11:51:06,620 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 214 transitions. [2023-11-26 11:51:06,620 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 214 transitions. [2023-11-26 11:51:06,620 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:06,620 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 214 transitions. [2023-11-26 11:51:06,622 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 35.666666666666664) internal successors, (214), 6 states have internal predecessors, (214), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:06,623 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:06,623 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:06,623 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 160 flow. Second operand 6 states and 214 transitions. [2023-11-26 11:51:06,624 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 73 transitions, 336 flow [2023-11-26 11:51:06,628 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 73 transitions, 311 flow, removed 4 selfloop flow, removed 4 redundant places. [2023-11-26 11:51:06,630 INFO L231 Difference]: Finished difference. Result has 59 places, 46 transitions, 174 flow [2023-11-26 11:51:06,630 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=138, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=174, PETRI_PLACES=59, PETRI_TRANSITIONS=46} [2023-11-26 11:51:06,631 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 0 predicate places. [2023-11-26 11:51:06,631 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 46 transitions, 174 flow [2023-11-26 11:51:06,632 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 28.833333333333332) internal successors, (173), 6 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:06,632 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:06,632 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] [2023-11-26 11:51:06,642 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:06,835 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:06,836 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:06,836 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:06,836 INFO L85 PathProgramCache]: Analyzing trace with hash -1780071015, now seen corresponding path program 1 times [2023-11-26 11:51:06,837 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:06,837 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1525179335] [2023-11-26 11:51:06,837 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:06,837 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:06,838 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:06,839 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:06,842 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-26 11:51:07,049 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:07,053 INFO L262 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 11:51:07,058 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:07,663 WARN L876 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ BitVec 32)) (|v_ULTIMATE.start_main_~#t2515~0#1.base_47| (_ BitVec 32))) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ bv1 1)))) (and (= (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ bv0 1)) |v_ULTIMATE.start_main_~#t2515~0#1.base_47| (_ bv0 1)) |c_#valid|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start_main_~#t2513~0#1.base_59|) (_ bv0 1)) (= (_ bv0 1) (select .cse0 |v_ULTIMATE.start_main_~#t2514~0#1.base_55|)) (= (_ bv0 1) (select (store .cse0 |v_ULTIMATE.start_main_~#t2514~0#1.base_55| (_ bv1 1)) |v_ULTIMATE.start_main_~#t2515~0#1.base_47|))))) is different from true [2023-11-26 11:51:07,665 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:07,665 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:07,665 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:07,665 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1525179335] [2023-11-26 11:51:07,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1525179335] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:07,666 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:07,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-26 11:51:07,666 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1921056663] [2023-11-26 11:51:07,666 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:07,667 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-26 11:51:07,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:07,668 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-26 11:51:07,668 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=14, Unknown=1, NotChecked=6, Total=30 [2023-11-26 11:51:07,725 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 20 out of 54 [2023-11-26 11:51:07,725 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 46 transitions, 174 flow. Second operand has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:07,725 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:07,726 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 20 of 54 [2023-11-26 11:51:07,726 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:07,995 INFO L124 PetriNetUnfolderBase]: 278/590 cut-off events. [2023-11-26 11:51:07,995 INFO L125 PetriNetUnfolderBase]: For 164/169 co-relation queries the response was YES. [2023-11-26 11:51:07,997 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1261 conditions, 590 events. 278/590 cut-off events. For 164/169 co-relation queries the response was YES. Maximal size of possible extension queue 35. Compared 2964 event pairs, 59 based on Foata normal form. 8/555 useless extension candidates. Maximal degree in co-relation 1244. Up to 383 conditions per place. [2023-11-26 11:51:08,000 INFO L140 encePairwiseOnDemand]: 46/54 looper letters, 29 selfloop transitions, 7 changer transitions 0/59 dead transitions. [2023-11-26 11:51:08,000 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 59 transitions, 272 flow [2023-11-26 11:51:08,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-26 11:51:08,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-26 11:51:08,002 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 157 transitions. [2023-11-26 11:51:08,002 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4845679012345679 [2023-11-26 11:51:08,002 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 157 transitions. [2023-11-26 11:51:08,002 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 157 transitions. [2023-11-26 11:51:08,003 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:08,003 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 157 transitions. [2023-11-26 11:51:08,004 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 26.166666666666668) internal successors, (157), 6 states have internal predecessors, (157), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,005 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,005 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 54.0) internal successors, (378), 7 states have internal predecessors, (378), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,005 INFO L175 Difference]: Start difference. First operand has 59 places, 46 transitions, 174 flow. Second operand 6 states and 157 transitions. [2023-11-26 11:51:08,005 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 59 transitions, 272 flow [2023-11-26 11:51:08,007 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 59 transitions, 216 flow, removed 10 selfloop flow, removed 8 redundant places. [2023-11-26 11:51:08,008 INFO L231 Difference]: Finished difference. Result has 57 places, 49 transitions, 150 flow [2023-11-26 11:51:08,009 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=150, PETRI_PLACES=57, PETRI_TRANSITIONS=49} [2023-11-26 11:51:08,009 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, -2 predicate places. [2023-11-26 11:51:08,010 INFO L495 AbstractCegarLoop]: Abstraction has has 57 places, 49 transitions, 150 flow [2023-11-26 11:51:08,010 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 23.166666666666668) internal successors, (139), 6 states have internal predecessors, (139), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,010 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:08,010 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] [2023-11-26 11:51:08,021 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:08,214 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:08,214 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:08,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:08,215 INFO L85 PathProgramCache]: Analyzing trace with hash 482156640, now seen corresponding path program 1 times [2023-11-26 11:51:08,215 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:08,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1174441248] [2023-11-26 11:51:08,216 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-26 11:51:08,216 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:08,216 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:08,217 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:08,223 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-26 11:51:08,368 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-26 11:51:08,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:08,376 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:08,415 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:08,415 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:08,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:08,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1174441248] [2023-11-26 11:51:08,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1174441248] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:08,416 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:08,416 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:08,416 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1795850985] [2023-11-26 11:51:08,416 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:08,417 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:08,417 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:08,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:08,418 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:08,426 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:51:08,426 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 57 places, 49 transitions, 150 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,426 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:08,426 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:51:08,427 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:08,744 INFO L124 PetriNetUnfolderBase]: 639/1247 cut-off events. [2023-11-26 11:51:08,744 INFO L125 PetriNetUnfolderBase]: For 386/411 co-relation queries the response was YES. [2023-11-26 11:51:08,749 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2876 conditions, 1247 events. 639/1247 cut-off events. For 386/411 co-relation queries the response was YES. Maximal size of possible extension queue 66. Compared 6863 event pairs, 285 based on Foata normal form. 8/1185 useless extension candidates. Maximal degree in co-relation 2863. Up to 566 conditions per place. [2023-11-26 11:51:08,756 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 43 selfloop transitions, 5 changer transitions 0/72 dead transitions. [2023-11-26 11:51:08,756 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 61 places, 72 transitions, 322 flow [2023-11-26 11:51:08,756 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:08,757 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:51:08,757 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 178 transitions. [2023-11-26 11:51:08,758 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6592592592592592 [2023-11-26 11:51:08,758 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 178 transitions. [2023-11-26 11:51:08,758 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 178 transitions. [2023-11-26 11:51:08,758 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:08,758 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 178 transitions. [2023-11-26 11:51:08,759 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.6) internal successors, (178), 5 states have internal predecessors, (178), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,760 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,761 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,761 INFO L175 Difference]: Start difference. First operand has 57 places, 49 transitions, 150 flow. Second operand 5 states and 178 transitions. [2023-11-26 11:51:08,761 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 61 places, 72 transitions, 322 flow [2023-11-26 11:51:08,763 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 72 transitions, 308 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-26 11:51:08,764 INFO L231 Difference]: Finished difference. Result has 60 places, 53 transitions, 178 flow [2023-11-26 11:51:08,765 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=53, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=49, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=44, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=60, PETRI_TRANSITIONS=53} [2023-11-26 11:51:08,765 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 1 predicate places. [2023-11-26 11:51:08,766 INFO L495 AbstractCegarLoop]: Abstraction has has 60 places, 53 transitions, 178 flow [2023-11-26 11:51:08,766 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:08,766 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:08,766 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] [2023-11-26 11:51:08,776 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:08,976 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:08,976 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:08,977 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:08,977 INFO L85 PathProgramCache]: Analyzing trace with hash -1411855162, now seen corresponding path program 2 times [2023-11-26 11:51:08,977 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:08,977 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [431895105] [2023-11-26 11:51:08,977 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-26 11:51:08,978 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:08,978 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:08,979 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:09,016 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-26 11:51:09,124 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-26 11:51:09,124 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:09,128 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-26 11:51:09,131 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:09,612 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:09,613 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:09,613 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:09,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [431895105] [2023-11-26 11:51:09,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [431895105] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:09,614 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:09,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2023-11-26 11:51:09,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [639980873] [2023-11-26 11:51:09,614 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:09,615 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-26 11:51:09,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:09,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-26 11:51:09,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2023-11-26 11:51:09,635 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 29 out of 54 [2023-11-26 11:51:09,636 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 60 places, 53 transitions, 178 flow. Second operand has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:09,636 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:09,636 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 29 of 54 [2023-11-26 11:51:09,636 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:10,338 INFO L124 PetriNetUnfolderBase]: 806/1575 cut-off events. [2023-11-26 11:51:10,338 INFO L125 PetriNetUnfolderBase]: For 601/667 co-relation queries the response was YES. [2023-11-26 11:51:10,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3900 conditions, 1575 events. 806/1575 cut-off events. For 601/667 co-relation queries the response was YES. Maximal size of possible extension queue 89. Compared 9183 event pairs, 188 based on Foata normal form. 8/1498 useless extension candidates. Maximal degree in co-relation 3885. Up to 667 conditions per place. [2023-11-26 11:51:10,352 INFO L140 encePairwiseOnDemand]: 45/54 looper letters, 56 selfloop transitions, 12 changer transitions 0/95 dead transitions. [2023-11-26 11:51:10,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 95 transitions, 466 flow [2023-11-26 11:51:10,353 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-26 11:51:10,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 9 states. [2023-11-26 11:51:10,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 318 transitions. [2023-11-26 11:51:10,354 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.654320987654321 [2023-11-26 11:51:10,355 INFO L72 ComplementDD]: Start complementDD. Operand 9 states and 318 transitions. [2023-11-26 11:51:10,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 9 states and 318 transitions. [2023-11-26 11:51:10,355 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:10,355 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 9 states and 318 transitions. [2023-11-26 11:51:10,357 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 10 states, 9 states have (on average 35.333333333333336) internal successors, (318), 9 states have internal predecessors, (318), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:10,358 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:10,359 INFO L81 ComplementDD]: Finished complementDD. Result has 10 states, 10 states have (on average 54.0) internal successors, (540), 10 states have internal predecessors, (540), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:10,359 INFO L175 Difference]: Start difference. First operand has 60 places, 53 transitions, 178 flow. Second operand 9 states and 318 transitions. [2023-11-26 11:51:10,359 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 95 transitions, 466 flow [2023-11-26 11:51:10,361 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 67 places, 95 transitions, 464 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-26 11:51:10,363 INFO L231 Difference]: Finished difference. Result has 71 places, 61 transitions, 270 flow [2023-11-26 11:51:10,364 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=176, PETRI_DIFFERENCE_MINUEND_PLACES=59, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=53, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=42, PETRI_DIFFERENCE_SUBTRAHEND_STATES=9, PETRI_FLOW=270, PETRI_PLACES=71, PETRI_TRANSITIONS=61} [2023-11-26 11:51:10,365 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 12 predicate places. [2023-11-26 11:51:10,365 INFO L495 AbstractCegarLoop]: Abstraction has has 71 places, 61 transitions, 270 flow [2023-11-26 11:51:10,365 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 30.77777777777778) internal successors, (277), 9 states have internal predecessors, (277), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:10,365 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:10,366 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] [2023-11-26 11:51:10,375 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:10,569 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:10,570 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:10,570 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:10,570 INFO L85 PathProgramCache]: Analyzing trace with hash -219809456, now seen corresponding path program 3 times [2023-11-26 11:51:10,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:10,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [197454660] [2023-11-26 11:51:10,571 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-26 11:51:10,571 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:10,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:10,573 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:10,588 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-26 11:51:10,741 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-26 11:51:10,741 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-26 11:51:10,748 INFO L262 TraceCheckSpWp]: Trace formula consists of 165 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-26 11:51:10,750 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-26 11:51:10,794 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-26 11:51:10,794 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-26 11:51:10,794 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-26 11:51:10,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [197454660] [2023-11-26 11:51:10,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [197454660] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-26 11:51:10,795 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-26 11:51:10,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-26 11:51:10,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [879795320] [2023-11-26 11:51:10,795 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-26 11:51:10,796 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-26 11:51:10,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-26 11:51:10,797 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-26 11:51:10,797 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-26 11:51:10,808 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 27 out of 54 [2023-11-26 11:51:10,809 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 71 places, 61 transitions, 270 flow. Second operand has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:10,809 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-26 11:51:10,809 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 27 of 54 [2023-11-26 11:51:10,809 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-26 11:51:11,466 INFO L124 PetriNetUnfolderBase]: 1579/3016 cut-off events. [2023-11-26 11:51:11,467 INFO L125 PetriNetUnfolderBase]: For 2196/2325 co-relation queries the response was YES. [2023-11-26 11:51:11,484 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8263 conditions, 3016 events. 1579/3016 cut-off events. For 2196/2325 co-relation queries the response was YES. Maximal size of possible extension queue 181. Compared 20231 event pairs, 716 based on Foata normal form. 9/2809 useless extension candidates. Maximal degree in co-relation 8243. Up to 1315 conditions per place. [2023-11-26 11:51:11,502 INFO L140 encePairwiseOnDemand]: 48/54 looper letters, 57 selfloop transitions, 14 changer transitions 0/96 dead transitions. [2023-11-26 11:51:11,502 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 75 places, 96 transitions, 602 flow [2023-11-26 11:51:11,503 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-26 11:51:11,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-26 11:51:11,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2023-11-26 11:51:11,504 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.662962962962963 [2023-11-26 11:51:11,505 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 179 transitions. [2023-11-26 11:51:11,505 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 179 transitions. [2023-11-26 11:51:11,505 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-26 11:51:11,505 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 179 transitions. [2023-11-26 11:51:11,506 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:11,508 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:11,508 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 54.0) internal successors, (324), 6 states have internal predecessors, (324), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:11,508 INFO L175 Difference]: Start difference. First operand has 71 places, 61 transitions, 270 flow. Second operand 5 states and 179 transitions. [2023-11-26 11:51:11,509 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 75 places, 96 transitions, 602 flow [2023-11-26 11:51:11,521 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 72 places, 96 transitions, 594 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-26 11:51:11,524 INFO L231 Difference]: Finished difference. Result has 75 places, 74 transitions, 452 flow [2023-11-26 11:51:11,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=54, PETRI_DIFFERENCE_MINUEND_FLOW=264, PETRI_DIFFERENCE_MINUEND_PLACES=68, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=61, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=75, PETRI_TRANSITIONS=74} [2023-11-26 11:51:11,525 INFO L281 CegarLoopForPetriNet]: 59 programPoint places, 16 predicate places. [2023-11-26 11:51:11,525 INFO L495 AbstractCegarLoop]: Abstraction has has 75 places, 74 transitions, 452 flow [2023-11-26 11:51:11,526 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-26 11:51:11,526 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-26 11:51:11,526 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] [2023-11-26 11:51:11,535 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:11,735 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:11,735 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK === [P1Err0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 10 more)] === [2023-11-26 11:51:11,735 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-26 11:51:11,736 INFO L85 PathProgramCache]: Analyzing trace with hash -2001031414, now seen corresponding path program 4 times [2023-11-26 11:51:11,736 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-26 11:51:11,736 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [636946236] [2023-11-26 11:51:11,736 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-26 11:51:11,737 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:11,737 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat [2023-11-26 11:51:11,738 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-26 11:51:11,749 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-26 11:51:11,960 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-26 11:51:11,960 INFO L229 tOrderPrioritization]: Conjunction of SSA is sat [2023-11-26 11:51:11,960 INFO L356 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2023-11-26 11:51:12,064 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2023-11-26 11:51:12,160 INFO L130 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2023-11-26 11:51:12,160 INFO L360 BasicCegarLoop]: Counterexample is feasible [2023-11-26 11:51:12,161 INFO L805 garLoopResultBuilder]: Registering result UNSAFE for location ULTIMATE.startErr6ASSERT_VIOLATIONMEMORY_LEAK (12 of 13 remaining) [2023-11-26 11:51:12,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (11 of 13 remaining) [2023-11-26 11:51:12,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (10 of 13 remaining) [2023-11-26 11:51:12,164 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE (9 of 13 remaining) [2023-11-26 11:51:12,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (8 of 13 remaining) [2023-11-26 11:51:12,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE (7 of 13 remaining) [2023-11-26 11:51:12,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE (6 of 13 remaining) [2023-11-26 11:51:12,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE (5 of 13 remaining) [2023-11-26 11:51:12,165 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_LEAK (4 of 13 remaining) [2023-11-26 11:51:12,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (3 of 13 remaining) [2023-11-26 11:51:12,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (2 of 13 remaining) [2023-11-26 11:51:12,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2INUSE_VIOLATIONSUFFICIENT_THREAD_INSTANCES (1 of 13 remaining) [2023-11-26 11:51:12,166 INFO L805 garLoopResultBuilder]: Registering result UNKNOWN for location P1Err0ASSERT_VIOLATIONMEMORY_LEAK (0 of 13 remaining) [2023-11-26 11:51:12,173 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-26 11:51:12,371 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-26 11:51:12,372 INFO L445 BasicCegarLoop]: Path program histogram: [4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-26 11:51:12,379 INFO L228 ceAbstractionStarter]: Analysis of concurrent program completed with 1 thread instances [2023-11-26 11:51:12,385 INFO L178 ceAbstractionStarter]: Computing trace abstraction results [2023-11-26 11:51:12,479 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre5 could not be translated [2023-11-26 11:51:12,481 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre7 could not be translated [2023-11-26 11:51:12,494 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: IdentifierExpression #t~pre9 could not be translated [2023-11-26 11:51:12,504 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:51:12,507 WARN L1572 BoogieBacktranslator]: Unfinished Backtranslation: unknown boogie variable #t~nondet0 [2023-11-26 11:51:12,535 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 26.11 11:51:12 BasicIcfg [2023-11-26 11:51:12,536 INFO L131 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2023-11-26 11:51:12,536 INFO L112 PluginConnector]: ------------------------Witness Printer---------------------------- [2023-11-26 11:51:12,536 INFO L270 PluginConnector]: Initializing Witness Printer... [2023-11-26 11:51:12,537 INFO L274 PluginConnector]: Witness Printer initialized [2023-11-26 11:51:12,537 INFO L184 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 26.11 11:50:58" (3/4) ... [2023-11-26 11:51:12,539 INFO L140 WitnessPrinter]: No result that supports witness generation found [2023-11-26 11:51:12,541 INFO L131 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2023-11-26 11:51:12,541 INFO L158 Benchmark]: Toolchain (without parser) took 15814.18ms. Allocated memory was 86.0MB in the beginning and 243.3MB in the end (delta: 157.3MB). Free memory was 60.9MB in the beginning and 123.8MB in the end (delta: -62.8MB). Peak memory consumption was 94.9MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,542 INFO L158 Benchmark]: CDTParser took 1.30ms. Allocated memory is still 65.0MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:12,542 INFO L158 Benchmark]: CACSL2BoogieTranslator took 794.79ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 55.4MB in the end (delta: 5.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,543 INFO L158 Benchmark]: Boogie Procedure Inliner took 63.17ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 52.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,543 INFO L158 Benchmark]: Boogie Preprocessor took 58.73ms. Allocated memory is still 86.0MB. Free memory was 52.9MB in the beginning and 49.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,544 INFO L158 Benchmark]: RCFGBuilder took 909.46ms. Allocated memory is still 86.0MB. Free memory was 49.1MB in the beginning and 47.5MB in the end (delta: 1.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,544 INFO L158 Benchmark]: TraceAbstraction took 13976.75ms. Allocated memory was 86.0MB in the beginning and 243.3MB in the end (delta: 157.3MB). Free memory was 47.0MB in the beginning and 124.8MB in the end (delta: -77.8MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. [2023-11-26 11:51:12,545 INFO L158 Benchmark]: Witness Printer took 4.42ms. Allocated memory is still 243.3MB. Free memory was 124.8MB in the beginning and 123.8MB in the end (delta: 1.0MB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-26 11:51:12,548 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 1.30ms. Allocated memory is still 65.0MB. Free memory is still 41.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 794.79ms. Allocated memory is still 86.0MB. Free memory was 60.7MB in the beginning and 55.4MB in the end (delta: 5.4MB). Peak memory consumption was 19.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 63.17ms. Allocated memory is still 86.0MB. Free memory was 55.4MB in the beginning and 52.9MB in the end (delta: 2.5MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 58.73ms. Allocated memory is still 86.0MB. Free memory was 52.9MB in the beginning and 49.5MB in the end (delta: 3.4MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 909.46ms. Allocated memory is still 86.0MB. Free memory was 49.1MB in the beginning and 47.5MB in the end (delta: 1.6MB). Peak memory consumption was 19.4MB. Max. memory is 16.1GB. * TraceAbstraction took 13976.75ms. Allocated memory was 86.0MB in the beginning and 243.3MB in the end (delta: 157.3MB). Free memory was 47.0MB in the beginning and 124.8MB in the end (delta: -77.8MB). Peak memory consumption was 79.5MB. Max. memory is 16.1GB. * Witness Printer took 4.42ms. Allocated memory is still 243.3MB. Free memory was 124.8MB in the beginning and 123.8MB in the end (delta: 1.0MB). 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: 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: 18]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: overapproximation of memtrack at line 18. Possible FailurePath: [L710] 0 int __unbuffered_cnt = 0; [L712] 0 int __unbuffered_p0_EAX = 0; [L713] 0 _Bool main$tmp_guard0; [L714] 0 _Bool main$tmp_guard1; [L716] 0 int x = 0; [L717] 0 _Bool x$flush_delayed; [L718] 0 int x$mem_tmp; [L719] 0 _Bool x$r_buff0_thd0; [L720] 0 _Bool x$r_buff0_thd1; [L721] 0 _Bool x$r_buff0_thd2; [L722] 0 _Bool x$r_buff0_thd3; [L723] 0 _Bool x$r_buff1_thd0; [L724] 0 _Bool x$r_buff1_thd1; [L725] 0 _Bool x$r_buff1_thd2; [L726] 0 _Bool x$r_buff1_thd3; [L727] 0 _Bool x$read_delayed; [L728] 0 int *x$read_delayed_var; [L729] 0 int x$w_buff0; [L730] 0 _Bool x$w_buff0_used; [L731] 0 int x$w_buff1; [L732] 0 _Bool x$w_buff1_used; [L734] 0 int y = 0; [L736] 0 int z = 0; [L737] 0 _Bool weak$$choice0; [L738] 0 _Bool weak$$choice2; [L829] 0 pthread_t t2513; [L830] FCALL, FORK 0 pthread_create(&t2513, ((void *)0), P0, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L831] 0 pthread_t t2514; [L832] FCALL, FORK 0 pthread_create(&t2514, ((void *)0), P1, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=0, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=0, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L772] 2 x$w_buff1 = x$w_buff0 [L773] 2 x$w_buff0 = 1 [L774] 2 x$w_buff1_used = x$w_buff0_used [L775] 2 x$w_buff0_used = (_Bool)1 [L776] CALL 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L19] COND FALSE 2 !(!expression) [L776] RET 2 __VERIFIER_assert(!(x$w_buff1_used && x$w_buff0_used)) [L777] 2 x$r_buff1_thd0 = x$r_buff0_thd0 [L778] 2 x$r_buff1_thd1 = x$r_buff0_thd1 [L779] 2 x$r_buff1_thd2 = x$r_buff0_thd2 [L780] 2 x$r_buff1_thd3 = x$r_buff0_thd3 [L781] 2 x$r_buff0_thd2 = (_Bool)1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L833] 0 pthread_t t2515; [L834] FCALL, FORK 0 pthread_create(&t2515, ((void *)0), P2, ((void *)0)) VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=0, z=0] [L784] 2 y = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=1, z=0] [L801] 3 y = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=0] [L804] 3 z = 1 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=1] [L742] 1 z = 2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice0=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L747] 1 weak$$choice0 = __VERIFIER_nondet_bool() [L748] 1 weak$$choice2 = __VERIFIER_nondet_bool() [L749] 1 x$flush_delayed = weak$$choice2 [L750] 1 x$mem_tmp = x [L751] 1 x = !x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff1) [L752] 1 x$w_buff0 = weak$$choice2 ? x$w_buff0 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff0 : x$w_buff0)) [L753] 1 x$w_buff1 = weak$$choice2 ? x$w_buff1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1 : (x$w_buff0_used && x$r_buff0_thd1 ? x$w_buff1 : x$w_buff1)) [L754] 1 x$w_buff0_used = weak$$choice2 ? x$w_buff0_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff0_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$w_buff0_used)) [L755] 1 x$w_buff1_used = weak$$choice2 ? x$w_buff1_used : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$w_buff1_used : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L756] 1 x$r_buff0_thd1 = weak$$choice2 ? x$r_buff0_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff0_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : x$r_buff0_thd1)) [L757] 1 x$r_buff1_thd1 = weak$$choice2 ? x$r_buff1_thd1 : (!x$w_buff0_used || !x$r_buff0_thd1 && !x$w_buff1_used || !x$r_buff0_thd1 && !x$r_buff1_thd1 ? x$r_buff1_thd1 : (x$w_buff0_used && x$r_buff0_thd1 ? (_Bool)0 : (_Bool)0)) [L758] 1 __unbuffered_p0_EAX = x [L759] 1 x = x$flush_delayed ? x$mem_tmp : x [L760] 1 x$flush_delayed = (_Bool)0 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L807] 3 x = x$w_buff0_used && x$r_buff0_thd3 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd3 ? x$w_buff1 : x) [L808] 3 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$w_buff0_used [L809] 3 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$w_buff1_used [L810] 3 x$r_buff0_thd3 = x$w_buff0_used && x$r_buff0_thd3 ? (_Bool)0 : x$r_buff0_thd3 [L811] 3 x$r_buff1_thd3 = x$w_buff0_used && x$r_buff0_thd3 || x$w_buff1_used && x$r_buff1_thd3 ? (_Bool)0 : x$r_buff1_thd3 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=1, x$w_buff1=0, x$w_buff1_used=0, x=0, y=2, z=2] [L787] 2 x = x$w_buff0_used && x$r_buff0_thd2 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd2 ? x$w_buff1 : x) [L788] 2 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$w_buff0_used [L789] 2 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$w_buff1_used [L790] 2 x$r_buff0_thd2 = x$w_buff0_used && x$r_buff0_thd2 ? (_Bool)0 : x$r_buff0_thd2 [L791] 2 x$r_buff1_thd2 = x$w_buff0_used && x$r_buff0_thd2 || x$w_buff1_used && x$r_buff1_thd2 ? (_Bool)0 : x$r_buff1_thd2 VAL [__unbuffered_cnt=0, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L765] 1 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=1, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L794] 2 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=2, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L814] 3 __unbuffered_cnt = __unbuffered_cnt + 1 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=0, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L836] 0 main$tmp_guard0 = __unbuffered_cnt == 3 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L838] CALL 0 assume_abort_if_not(main$tmp_guard0) [L4] COND FALSE 0 !(!cond) [L838] RET 0 assume_abort_if_not(main$tmp_guard0) [L840] 0 x = x$w_buff0_used && x$r_buff0_thd0 ? x$w_buff0 : (x$w_buff1_used && x$r_buff1_thd0 ? x$w_buff1 : x) [L841] 0 x$w_buff0_used = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$w_buff0_used [L842] 0 x$w_buff1_used = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$w_buff1_used [L843] 0 x$r_buff0_thd0 = x$w_buff0_used && x$r_buff0_thd0 ? (_Bool)0 : x$r_buff0_thd0 [L844] 0 x$r_buff1_thd0 = x$w_buff0_used && x$r_buff0_thd0 || x$w_buff1_used && x$r_buff1_thd0 ? (_Bool)0 : x$r_buff1_thd0 VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L847] 0 main$tmp_guard1 = !(y == 2 && z == 2 && __unbuffered_p0_EAX == 0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, t2513={7:0}, t2514={6:0}, t2515={3:0}, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L849] CALL 0 __VERIFIER_assert(main$tmp_guard1) [L19] COND TRUE 0 !expression [L19] CALL 0 reach_error() [L18] COND FALSE 0 !(0) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] [L18] 0 __assert_fail ("0", "safe031_power.oepc_pso.oepc_rmo.oepc.c", 9, __extension__ __PRETTY_FUNCTION__) VAL [__unbuffered_cnt=3, __unbuffered_p0_EAX=0, arg={0:0}, arg={0:0}, arg={0:0}, arg={0:0}, main$tmp_guard0=1, main$tmp_guard1=0, weak$$choice2=0, x$flush_delayed=0, x$mem_tmp=0, x$r_buff0_thd0=0, x$r_buff0_thd1=0, x$r_buff0_thd2=1, x$r_buff0_thd3=0, x$r_buff1_thd0=0, x$r_buff1_thd1=0, x$r_buff1_thd2=0, x$r_buff1_thd3=0, x$read_delayed=0, x$read_delayed_var={0:0}, x$w_buff0=1, x$w_buff0_used=0, x$w_buff1=0, x$w_buff1_used=0, x=1, y=2, z=2] - UnprovableResult [Line: 18]: 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: 827]: Unable to prove that all allocated memory was freed Unable to prove that all allocated memory was freed Reason: Not analyzed. - UnprovableResult [Line: 830]: 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: 834]: 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: 832]: 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 7 procedures, 79 locations, 13 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: 13.7s, OverallIterations: 15, TraceHistogramMax: 1, PathProgramHistogramMax: 4, EmptinessCheckTime: 0.0s, AutomataDifference: 6.5s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.1s, HoareTripleCheckerStatistics: 0 mSolverCounterUnknown, 488 SdHoareTripleChecker+Valid, 2.2s IncrementalHoareTripleChecker+Time, 0 mSdLazyCounter, 400 mSDsluCounter, 78 SdHoareTripleChecker+Invalid, 1.8s Time, 0 mProtectedAction, 0 SdHoareTripleChecker+Unchecked, 53 IncrementalHoareTripleChecker+Unchecked, 50 mSDsCounter, 31 IncrementalHoareTripleChecker+Valid, 0 mProtectedPredicate, 1285 IncrementalHoareTripleChecker+Invalid, 1369 SdHoareTripleChecker+Unknown, 0 mSolverCounterNotChecked, 31 mSolverCounterUnsat, 28 mSDtfsCounter, 1285 mSolverCounterSat, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Unknown, PredicateUnifierStatistics: 0 DeclaredPredicates, 243 GetRequests, 196 SyntacticMatches, 0 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=452occurred in iteration=14, InterpolantAutomatonStates: 61, 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, 0.8s SatisfiabilityAnalysisTime, 1.7s InterpolantComputationTime, 277 NumberOfCodeBlocks, 277 NumberOfCodeBlocksAsserted, 16 NumberOfCheckSat, 229 ConstructedInterpolants, 1 QuantifiedInterpolants, 1624 SizeOfPredicates, 12 NumberOfNonLiveVariables, 1594 ConjunctsInSsa, 76 ConjunctsInUnsatCore, 14 InterpolantComputations, 14 PerfectInterpolantSequences, 0/0 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate could not prove your program: unable to determine feasibility of some traces [2023-11-26 11:51:12,593 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_d5505671-716a-4789-b63c-9690193b0ea0/bin/uautomizer-verify-VRDe98Ueme/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: UNKNOWN: Overapproximated counterexample